Weak time petri nets strike back!

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

Volumn 5710 LNCS, Issue , 2009, Pages 557-571

  Reynier, Pierre Alain ^a   Sangnier, Arnaud ^b  

^a AIX MARSEILLE UNIV   (France)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ON TIME; REACHABILITY; REACHABILITY PROBLEM; TIME PETRI NETS; VERIFICATION PROBLEMS;

GRAPH THEORY; PETRI NETS;

SEMANTICS;

EID: 70349880730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04081-8_37     Document Type: Conference Paper

References (18)

1. Abdulla, P.A., Mahata, P., Mayr, R.: Dense-timed Petri nets: Checking zenoness, token liveness and boundedness. Logical Methods in Computer Science 3(1), 1-61 (2007)
2. Abdulla, P.A., Nylèn, A.: Timed Petri nets and bqos. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol.2075, pp. 53-70. Springer, Heidelberg (2001)
3. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183-235 (1994)
4. Bèrard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: Comparison of different semantics for time Petri nets. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.3707, pp. 293-307. Springer, Heidelberg (2005)
5. Bolognesi, T., Lucidi, F., Trigila, S.: From timed Petri nets to timed LOTOS. In: PSTV 1990, pp. 395-408. North-Holland, Amsterdam (1990)
6. Bouyer, P., Haddad, S., Reynier, P.-A.: Timed Petri nets and timed automata: On the discriminating power of zeno sequences. Information and Computation 206(1), 73-107 (2008)
7. Boyer, M., Roux, O.H.: On the compared expressiveness of arc, place and transition time Petri nets. Fundamenta Informaticae 88(3), 225-249 (2008)
8. de Frutos-Escrig, D., Valero Ruiz, V., Alonso, O.M.: Decidability of properties of timed-arc Petri nets. In: Nielsen,M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.1825, pp. 187-206. Springer, Heidelberg (2000)
9. Haar, S., Simonot-Lion, F., Kaiser, L., Toussaint, J.: Equivalence of timed state machines and safe time Petri nets. In: WoDES 2002, pp. 119-126 (2002)
10. Jones, N.D., Landweber, L.H., Lien, Y.E.: Complexity of some problems in Petri nets. Theoretical Computer Science 4(3), 277-299 (1977)
11. Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer System Sciences 3(2), 147-195 (1969)
12. Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC 1982, pp. 267-281. ACM, New York (1982)
13. Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM Journal on Computing 13(3), 441-460 (1984)
14. Merlin, P.M.: A Study of the Recoverability of Computing Systems. PhD thesis, University of California, Irvine, CA, USA (1974)
15. Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Inc., Upper Saddle River (1967)
16. Reynier, P.-A., Sangnier, A.: Weak Time Petri Nets strike back! Research Report HAL- 00374482, HAL, CNRS, France (2009)
17. Sifakis, J., Yovine, S.: Compositional specification of timed systems. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.1046, pp. 347-359. Springer, Heidelberg (1996)
18. Valero Ruiz, V., de Frutos-Escrig, D., Cuartero, F.: On non-decidability of reachability for timed-arc Petri nets. In: PNPM 1999, pp. 188-196. IEEE Computer Society Press, Los Alamitos (1999)