On the coverability and reachability languages of monotonic extensions of Petri nets

Theoretical Computer Science

Volumn 467, Issue , 2013, Pages 12-29

  Delzanno, Giorgio ^a   Rosa Velardo, Fernando ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Expressive power; Language theory; Petri nets; Well structured transition systems

Indexed keywords

COVERABILITY; EXPRESSIVE POWER; INFINITE-STATE; LANGUAGE THEORY; MONOTONIC EXTENSIONS OF PETRI NETS; ORDERED DOMAINS; REACHABILITY; RESET NETS; WELL-STRUCTURED TRANSITION SYSTEMS;

COMPUTER SCIENCE;

PETRI NETS;

EID: 84871002256     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2012.09.021     Document Type: Article

References (24)

1. P.A. Abdulla, G. Delzanno, and L. Van Begin Comparing the expressive power of well-structured transition systems 21st Int. Workshop on Computer Science Logic, CSL'07 LNCS vol. 4646 2007 Springer 99 114
2. P.A. Abdulla, G. Delzanno, and L. Van Begin A language-based comparison of extensions of Petri nets with and without whole-place operations 3rd Int. Conference on Language and Automata Theory and Applications, LATA'09 LNCS vol. 5457 2009 Springer 71 82
3. P.A. Abdulla, G. Delzanno, and L. Van Begin A classification of the expressive power of well-structured transition systems Inform. and Comput. 209 3 2011 248 279
4. P.A. Abdulla, G. Delzanno, On the coverability problem for constrained multiset rewriting, in: AVIS 2006, an ETAPS Workshop, 2006.
5. R. Bonnet, A. Finkel, S. Haddad, and F. Rosa-Velardo Ordinal theory for the expressiveness of well structured transition systems In 14th Int. Conference on Foundations of Software Sciences and Computation Structures, FOSSACS'11 LNCS vol. 6604 2011 Springer-Verlag 153 167
6. G. Cécé, A. Finkel, and S.P. Iyer Unreliable channels are easier to verify than perfect channels Inform. Comput. 124 1 1996 20 31
7. G. Decker, M. Weske, Instance isolation analysis for service-oriented architectures, in: IEEE Int. Conf. on Services Computing, SCC 2008, 2008, pp. 249-256.
8. C. Dufourd, A. Finkel, and Ph. Schnoebelen Reset nets between decidability and undecidability 25th Int. Col. on Automata, Languages and Programming, ICALP'98 LNCS vol. 1443 1998 Springer 103 115
9. A. Finkel, and P. Schnoebelen Well-structured transition systems everywhere! Theoret. Comput. Sci. 256 1-2 2001 63 92
10. A. Finkel, P. McKenzie, and C. Picaronny A well-structured framework for analysing petri net extensions Information and Computation 195 1-2 2004 1 29
11. G. Geeraerts, J. Raskin, and L. Van Begin Well-structured languages Acta Inform. 44 2007 249 288
12. S. Ginsburg Algebraic and Automata-Theoretic Properties of Formal Languages 1975 Elsevier Science Inc. New York, NY, USA
13. A. Gordon Notes on nominal calculi for security and mobility Foundations of Security Analysis and Design, FOSAD'00 Lecture Notes in Computer Science vol. 2171 2001 Springer 262 330
14. P. Habermehl, R. Meyer, and H. Wimmel The downward-closure of petri net languages ICALP'10 LNCS vol. 6199 2010 466 477
15. K. van Hee, A. Serebrenik, N. Sidorova, and M. Voorhoeve Soundness of resource-constrained workflow nets ICATPN'05 LNCS vol. 3536 2005 250 267
16. G. Higman Ordering by divisibility in abstract algebras Proc. Lond. Math. Soc., (3) 2 7 1952 326 336
17. P. Jancar, J. Esparza, and F. Moller Petri nets and regular processes J. Comput. Syst. Sci. 59 3 1999 476 503
18. R. Lazic, T.C. Newcomb, J. Ouaknine, A.W. Roscoe, and J. Worrell Nets with tokens which carry data Fund. Inform. 88 3 2008 251 274
19. M.L. Minsky Computation: Finite and Infinite Machines 1971 Prentice-Hall
20. J.L. Peterson Petri Net Theory and the Modeling of Systems 1981 Prentice Hall PTR Upper Saddle River NJ, USA
21. W. Reisig Petri nets, an introduction EATCS Monographs on Theoretical Computer Science 1985 Springer Verlag Berlin
22. F. Rosa-Velardo, and D. de Frutos-Escrig Name creation vs. replication in Petri Net systems Fund. Inform. 88 3 2008 329 356
23. F. Rosa-Velardo, and G. Delzanno Language-based comparison of Petri nets with black tokens, pure names and ordered data 4th International Conference on Language and Automata Theory and Applications, LATA 2010 LNCS vol. 6031 2010 524 535
24. F. Rosa-Velardo, and D. de Frutos-Escrig Decidability and complexity of Petri nets with unordered data Theoret. Comput. Sci. 412 34 2011 4439 4451