Efficient state space search for time Petri nets

Electronic Notes in Theoretical Computer Science

Volumn 18, Issue , 1998, Pages 113-133

  Lilius, Johan ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT SYSTEM; REACTIVE SYSTEM; SUBSETS; TIMING CONSTRAINTS;

ALGORITHMS; MATHEMATICAL MODELS; PETRI NETS; PROBLEM SOLVING; REAL TIME SYSTEMS; SEMANTICS;

CONCURRENT ENGINEERING;

EID: 0343961904     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80254-3     Document Type: Conference Paper

References (15)

1. Aura T., Lilius J. Time processes for time Petri nets. Applications and Theory of Petri Nets 1997, volume 1248 of Lecture Notes in Computer Science. 1997;136-155 Springer Verlag
2. J. Bengtsson, B. Jonsson, J. Lilius, and W. Yi. Partial order reductions for timed system. In Proceedings of CONCUR ′98, 1998, to appear.
3. Berthomieu B., Diaz M. Modelling and verification of time dependent systems using time Petri nets. IEEE Transactions on Software Engineering. 17:(3):March 1991;259-273
4. Berthomieu B., Menasche M. A state enumeration approach for analyzing time Petri nets. Proc. of 3rd European Workshop on Appl. and Theory of Petri Nets. September 1982;27-56 Varenna, Italy
5. Engelfriet J. Branching processes of Petri nets. Ada Informatica. 28:1991;575-591
6. Esparza J., Römer S., Volger W. An improvement of McMillan' s unfolding algorithm. Proc. of TACAS'96, volume 1055 of LNCS. 1996;87-106 Springer Verlag
7. Esparza J. Model checking using net unfoldings. Science of Computer Programming. 23:1994;151-195
8. Godefroid P. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem. volume 1032 of LNCS. 1996;Springer Verlag
9. Larsen K.G., Larsson F., Pettersson P., Yi W. Efficient verification of real-time systems: Compact data structure and state-space reduction. Proc. of the 18th IEEE Real-Time Systems Symposium. 1997;14-24
10. McMillan K.L. A technique of a state space search based on unfolding. Formal Methods in System Design. 16:(l):1995;45-56
11. McMillan K. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. Proc. of CAV'92, volume 663 of LNCS. 1992;164-177 Springer-Verlag
12. Merlin P.M., Farber D.J. Recoverability of communication protocols implications of a theoretical study. IEEE Transactions on Communications. 24:(9):September 1976;1036-1043
13. Semenov A., Yakovlev A. Verification of asynchronous circuits using time petri-net unfolding. Proc. ACM/IEEE Design Automation Conference. 1996
14. Yoneda T., Schlingloff H. Efficient verification of parallel real-time systems. Journal of Formal Methods in System Design. 11:(2):1997;187-215
15. S. Yovine. Méthodes et Outils pur la Vérification Symbolique de Systémes Temporisés. PhD thesis, Institut National Polytechnique de Grenoble, 1993.