Forward reachability analysis of timed petri nets

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

Volumn 3253, Issue , 2004, Pages 343-362

  Abdulla, Parosh Aziz ^a   Deneux, Johann ^a   Mahata, Pritha ^a   Nylén, Aletta ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; PETRI NETS; TIME SHARING SYSTEMS;

ACCELERATION TECHNIQUE; FINITE-STATE ABSTRACTION; PARAMETERIZED; REACHABILITY ANALYSIS; SAFETY PROPERTY; SYMBOLIC REACHABILITY ANALYSIS; TIMED PETRI NET; TIMED SYSTEMS;

REAL TIME SYSTEMS;

EID: 33745645692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30206-3_24     Document Type: Article

References (16)

1. [ABJ98] Parosh Aziz Abdulla, Ahmed Bouajjani, and Bengt Jonsson. On-the-fly analysis of systems with unbounded, lossy fifo channels. In Proc. CAV'98, volume 1427 of LNCS, pages 305-318, 1998.
2. [AČJYK00] Parosh Aziz Abdulla, Karlis Černs, Bengt Jonsson, and Tsay Yih-Kuen. Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation, 160:109-127, 2000.
3. [AD90] R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. ICALP '90, volume 443 of LNCS, pages 322-335, 1990.
4. [ADMN03] Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, and Aletta Nylén. Forward reachability analysis of timed petri nets. Technical Report 2003-056, Dept. of Information Technology, Uppsala University, Sweden, 2003. http://user.it.uu.se/~pritha/Papers/tpn.ps.
5. [AN01] Parosh Aziz Abdulla and Aletta Nylén. Timed Petri nets and BQOs. In Proc. ICATPN'2001, volume 2075 of LNCS, pages 53-70, 2001.
6. [BG96] B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Proc. CAV'96, volume 1102 of LNCS, pages 1-12, 1996.
7. [BH97] A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. In Proc. ICALP'97, volume 1256 of LNCS, 1997.
8. [BLO98] S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems automatically and compositionally. In Proc. CAV'98, volume 1427 of LNCS, pages 319-331, 1998.
9. [Bow96] F. D. J. Bowden. Modelling time in Petri nets. In Proc. Second Australian-Japan Workshop on Stochastic Models, 1996.
10. [CPS89] R. Cleaveland, J. Parrow, and B. Steffen. A semantics-based tool for the verification of finite-state systems. In Brinksma, Scollo, and Vissers, editors, Protocol Specification, Testing, and Verification IX, pages 287-302. North-Holland, 1989.
11. [DR00] G. Delzanno and J. F. Raskin. Symbolic representation of upward-closed sets. In Proc. TACAS'00, volume 1785 of LNCS, pages 426-440, 2000.
12. [FIS00] A. Finkel, S. Purushothaman Iyer, and G. Sutre. Well-abstracted transition systems. In Proc. CONCUR'00, pages 566-580, 2000.
13. [FRSB02] A. Finkel, J.-F. Raskin, M. Samuelides, and L. Van Begin. Monotonie extensions of petri nets: Forward and backward search revisited. In Proc. Infinity'02, 2002.
14. [God94] J.C. Godskesen. Timed Modal Specifications. PhD thesis, Aalborg University, 1994.
15. [KM69] R.M. Karp and R.E. Miller. Parallel program schemata. Journal of Computer and Systems Sciences, 3(2):147-195, May 1969.
16. [LBBO01] Y. Lakhnech, S. Bensalem, S. Berezin, and S. Owre. Symbolic techniques for parametric reasoning about counter and clock systems. In Proc. TACAS'01, volume 2031 of LNCS, 2001.