Parametric behaviour analysis for time petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1662, Issue , 1999, Pages 134-140

  Virbitskaite, I B ^a   Pokozy, E A ^a  

^a ENERGY SYSTEMS INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957883714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48387-X_14     Document Type: Conference Paper

References (7)

1. Alur, R., Dill, D. A theory of timed automata. Theoretical Computer Science 126 (1994) 183–235.
2. th ACM STOC (1993) 592–601.
3. Bengtsson, J., Jonsson, B., Lilius, J., Yi, W. Partial order reductions for timed systems. Proc. CONCUR’98 (1998) 485–496.
4. Merlin, P., Faber, D. J. Recoverability of communication protocols. IEEE Trans. of Communication COM-24(9) (1976).
5. Virbitskaite, I. B., Pokozy, E. A. Towards efficient verification of time Petri nets. Logical Journal of IGPL 5(6) (1997) 921–924.
6. Wang F. Timing behavior analysis for real-time systems. Proc. 10th IEEE LICS (1995) 112–122.
7. Yoneda, T., Shibayama, A., Schlingloff, B. H., Clarke, E. M. Efficient verification of concurrent real-time systems. Lecture Notes in Computer Science 697 (1993) 321–333.