Timed automata as task models for event-driven systems

Norström, Christer; Wall, Anders; Yi, Wang

doi:10.1109/rtcsa.1999.811218

Cited by 62 publications

(37 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our model of adaptive task automata is based on the model of task automata (or timed automata with tasks) [8,10,12], which extends the model of timed automata with a notion of tasks. A timed automata [1] is simply a finite state automata extended with a finite set of real-valued clocks.…”

Section: Preliminaries: Task Automatamentioning

confidence: 99%

See 1 more Smart Citation

Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems

Hatvani

Pettersson

Seceleanu

2012

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. We present a framework for modeling and analysis of adaptive embedded systems, based on the model of timed automata with tasks. The model is extended with primitives allowing modeling of adaptivity, by testing the potential schedulability of a given task, in the context of the set of currently enqueued tasks. This makes it possible to describe adaptive embedded systems, in which decisions to admit further tasks or take other measures of adaptivity is based on available CPU resources, external, or internal events. We show that this model can be encoded in the framework of timed automata, and hence that the problem is decidable. We also validate the framework, by using the Uppaal tool.

show abstract

Section: Preliminaries: Task Automatamentioning

confidence: 99%

“…Verification problems of the above model, with non-preemptive and preemptive tasks, have been already investigated in [10,12]. Here we briefly review the notions of reachability and schedulability.…”

Section: Definition 2 [10] Given a Task Automata L L 0 E I M Wimentioning

confidence: 99%

Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems

Hatvani

Pettersson

Seceleanu

2012

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…Often, these resources cannot be shared between different activities: When a workflow is executed, only one activity can access a resource exclusively. This leads us to another possible source of incorrect workflow specifications: When one activity needs a resource that is occupied exclusively by another activity, the workflow is deadlocked and [3,8] {r8, r9} [1,2] Figure 3: Workflow with information about time and resources cannot proceed. In real life, we can formulate the previous sentence even more strictly: If the other activity occupies the required resource exclusively until some deadline is reached, the workflow cannot be completed in time and hence does not fulfill its purpose.…”

Section: Timed Workflow Specifications With Ressource Constraintsmentioning

confidence: 99%

Using Timed Model Checking for Verifying Workflows

Gruhn

Laue

2005

Proceedings of the 4th International Workshop on Wireless Information Systems

View full text Add to dashboard Cite

The correctness of a workflow specification is critical for the automation of business processes. For this reason, errors in the specification should be detected and corrected as early as possible -at specification time.In this paper, we present a validation method for workflow specifications using model-checking techniques. A formalized workflow specification, its properties and the correctness requirements are translated into a timed state machine that can be analyzed with the Uppaal model checker. The main contribution of this paper is the use of timed model checking for verifying time-related properties of workflow specifications.Using only one tool (the model checker) for verifying these different kinds of properties gives an advantage over using different specialized algorithms for verifying different kinds of properties.

show abstract

“…In the literature, numerous modeling frameworks for real-time task systems have been proposed, see for instance [26][27][28][29][30][31][32]. In the design space exploration of printers, a small gain (5%) of performance can be decisive, and consequently detailed models of real-time task systems are needed in which, for instance, we can express that the completion time of a task slightly increases if another task is using the same communication bus simultaneously.…”

Section: Introductionmentioning

confidence: 99%

Modeling task systems using parameterized partial orders

Houben

Igna

Vaandrager

2012

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

Abstract. Inspired by work on model-based design of printers, the notion of a parametrized partial order (PPO) was introduced recently. PPOs are a simple extension of partial orders, expressive enough to compactly represent large task graphs with finite repetitive behavior. We present a translation of the PPO subclass to timed automata and prove that the transition system induced by the Uppaal models is isomorphic to the configuration structure of the original PPO. Moreover, we introduce real-time task systems (RTTS), a general model for real-time embedded systems that we have used to describe the data paths of realistic printer designs. In an RTTS, tasks are represented as PPOs and the pace of a task instance may vary, depending on the resources that are allocated to it. We describe a translation of a subclass of RTTSs to Uppaal, and establish, for an even smaller subclass, bisimulation equivalence between the timed configuration semantics of an RTTS and the transition system induced by the corresponding Uppaal translation. Lastly, we report on a series of experiments which demonstrates that the resulting Uppaal models are more tractable than handcrafted models of the same systems used in earlier case studies.

show abstract

Timed automata as task models for event-driven systems

Abstract: In

Cited by 62 publications

References 14 publications

Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems

Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems

Using Timed Model Checking for Verifying Workflows

Modeling task systems using parameterized partial orders

Contact Info

Product

Resources

About