Timed state space analysis of real-time preemptive systems

Bucci, G.; Fedeli, A.; Sassoli, L.; Vicario, Enrico

doi:10.1109/tse.2004.1265815

Cited by 92 publications

(146 citation statements)

References 27 publications

Supporting

Mentioning

145

Contrasting

Order By: Relevance

“…Several extensions of time Petri nets have been proposed to express the preemptive scheduling of tasks, such as Scheduling-TPNs [2], inhibitor hyperarc TPNs (ITPNs) [3] or Preemptive-TPNs [4]. All these models belong to the class of TPNs extended with stopwatches (SwPNs) [5].…”

Section: Introductionmentioning

confidence: 99%

Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches

Lime

Roux

Seidner

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Last time we reported on Romeo, analyses with this tool were mostly based on translations to other tools. This new version provides an integrated TCTL model-checker and has gained in expressivity with the addition of parameters. Although there exists other tools to compute the state-space of stopwatch models, Romeo is the first one that performs TCTL model-checking on stopwatch models. Moreover, it is the first tool that performs TCTL model-checking on timed parametric models. Indeed, Romeo now features an efficient model-checking of time Petri nets using the Uppaal DBM Library, the model-checking of stopwatch Petri nets and parametric stopwatch Petri nets using the Parma Polyhedra Library and a graphical editor and simulator of these models. Furthermore, its audience has increased leading to several industrial contracts. This paper reports on these recent developments of Romeo.

show abstract

Section: Introductionmentioning

confidence: 99%

Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches

Lime

Roux

Seidner

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Several extensions of TPNs have been proposed that address the modeling of suspension and resumption of actions, including Scheduling-TPNs (Roux and Déplanche, 2002;Lime and Roux, 2003), Preemptive-TPNs (Bucci et al, 2004), and Inhibitor Hyperarc TPNs (IHTPNs) (Roux and Lime, 2004). The first two add resources and priorities primitives to the TPN model, IHTPNs introduce special inhibitor arcs that control the progress of transitions.…”

Section: Introductionmentioning

confidence: 99%

Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches

Berthomieu

Lime²,

Roux³

et al. 2007

Discrete Event Dyn Syst

View full text Add to dashboard Cite

Several extensions of Time Petri nets (TPNs) have been proposed for modeling suspension and resumption of actions in timed systems. We first introduce a simple class of TPNs extended with stopwatches (SwTPNs), and present a semialgorithm for building exact representations of the behavior of SwTPNs, based on the known state class method for Time Petri nets. Then, we prove that state reachability in SwTPNs and all similar models is undecidable, even when bounded, which solves an open problem. Finally, we discuss overapproximation methods yielding finite abstractions of their behavior for a subclass of bounded SwTPNs, and propose a new one based on a quantization of the polyhedra representing temporal information. By adjusting a parameter, the exact behavior can be approximated as closely as desired. The methods have been implemented, experiments are reported.

show abstract

“…Finally, Roux and Déplanche [21] propose an extension for time Petri nets (SETPN) that allows to take into account the way the real-time tasks of an application distributed over different processors are scheduled. The same approach is developed in [4,3], with preemptive time Petri nets. These last two models are subclasses 1 of inhibitor hyperarcs time Petri nets (IHTPN) [22], which, since they have a more general purpose, are not as well-suited for modelling real-time systems.…”

Section: Formal Models For Online Schedulingmentioning

confidence: 99%

“…exponential complexity). As a consequence, an idea to speed up the state space computation, is to expand the general polyhedra into DBM ( [5,14,4]). This is clearly an over-approximation.…”

Section: State-space Computationmentioning

confidence: 99%