Model Checking of Time Petri Nets Using the State Class Timed Automaton

Lime, Didier; Roux, Olivier H.

doi:10.1007/s10626-006-8133-9

Cited by 64 publications

(60 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that the decidability was already proven in [20], [32] as a corollary of bisimilar translations from TPN to TA. Moreover we prove that the model-checking of a TPN-TCTL formula on a bounded TPN is a PSPACE-complete problem.…”

Section: B Decidability and Complexity Of Tpn-tctlmentioning

confidence: 84%

“…[19], [20] proposes a structural approach: each transition is translated into a TA using the same pattern. In [31], [32], the authors propose a method for building the State Class Graph of a bounded TPN as a TA. Such translations show that TCTL and CTL are decidable for bounded TPN and that developed algorithms on TA may be extended to TPN.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

TCTL Model Checking of Time Petri Nets

Boucheneb¹,

Gardey

Roux³

2009

Journal of Logic and Computation

View full text Add to dashboard Cite

We consider Time Petri Nets (TPN) for which a firing time interval is associated with each transition. State space abstractions for TPN preserving various classes of properties (LTL, CTL, CTL * ) can be computed, in terms of so called state classes. Some methods were proposed to check quantitative timed properties but are not suitable for effective verification of properties of real-life systems.In this paper, we consider subscript TCTL for TPN (TPN-TCTL) for which temporal operators are extended with a time interval, specifying a time constraint on the firing sequences. We prove the decidability of TPN-TCTL on bounded TPN and give its theoretical complexity.We propose a zone based state space abstraction that preserves marking reachability and traces of the TPN. As for Timed Automata (TA), the abstraction may use an over-approximation operator on zones to enforce the termination. A coarser (and efficient) abstraction is then provided and proved exact w.r.t. marking reachability and traces (LTL properties).Finally, we consider a subset of TPN-TCTL properties (TPN-TCTL S ) for which it is possible to propose efficient on-the-fly model-checking algorithms. Our approach consists in computing and exploring the zone based state space abstraction. On a practical point of view, the method is integrated in ROMEO [24], a tool for Time Petri Nets edition and analysis. In addition to the old features it is now possible to effectively verify a subset of TCTL directly on Time Petri Nets. Index TermsTime Petri Net, Model-checking, TCTL, zone based state space abstraction.

show abstract

Section: B Decidability and Complexity Of Tpn-tctlmentioning

confidence: 84%

Section: Related Workmentioning

confidence: 99%

TCTL Model Checking of Time Petri Nets

Boucheneb¹,

Gardey

Roux³

2009

Journal of Logic and Computation

View full text Add to dashboard Cite

show abstract

“…Paper accepted 7 April 2011. Technical Editor: Glauco Caurin time systems (Berthomieu and Diaz, 1991;Yoneda and Ryuba, 1998;Virbitskaite and Pokozy, 1999;Lime and Roux, 2006;Hadjidj and Boucheneb, 2008;Yovine, 1996).…”

Section: Introductionmentioning

confidence: 99%

Some issues in real-time systems verification using time Petri Nets

Foyo¹,

Silva

2011

J. Braz. Soc. Mech. Sci. & Eng.

View full text Add to dashboard Cite

“…Another approach by Lime and Roux [62] extends these results to bounded TPN but also requires first a construction of the state class graph of the given bounded TPN. An extended version of their paper [63] provides an efficient reduction technique to decrease the number of clocks in the resulting timed automaton. A structural translation from TPN to NTA preserving weak timed bisimilarity, which does not require the construction of the state class graph, was proposed by Cassez and Roux in [40].…”

Section: Relationships Among the Modelsmentioning

confidence: 99%

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

Srba

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded platforms where reliability and safety depend to a large extent on the time features. Many of the time dependant models were suggested as real-time extensions of several well-known untimed models. The most studied formalisms include Networks of Timed Automata which extend the model of communicating finite-state machines with a finite number of real-valued clocks, and timed extensions of Petri nets where the added time constructs include e.g. time intervals that are assigned to the transitions (Time Petri Nets) or to the arcs (Timed-Arc Petri Nets). In this paper, we shall semiformally introduce these models, discuss their strengths and weaknesses, and provide an overview of the known results about the relationships among the models.

show abstract

Model Checking of Time Petri Nets Using the State Class Timed Automaton

Cited by 64 publications

References 21 publications

TCTL Model Checking of Time Petri Nets

TCTL Model Checking of Time Petri Nets

Some issues in real-time systems verification using time Petri Nets

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

Contact Info

Product

Resources

About