A classification of the expressive power of well-structured transition systems

Information and Computation

Volumn 209, Issue 3, 2011, Pages 248-279

  Abdulla, Parosh Aziz ^a   Delzanno, Giorgio ^b   Van Begin, Laurent ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF GENOA   (Italy)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Expressiveness; Language theory; Well structured transition systems

Indexed keywords

COVERABILITY; EXPRESSIVE POWER; EXPRESSIVENESS; LABELED TRANSITION SYSTEMS; LANGUAGE THEORY; LOSSY CHANNEL SYSTEMS; MULTISET REWRITING; REACHABILITY; WELL-STRUCTURED TRANSITION SYSTEMS;

SEMANTICS;

PETRI NETS;

EID: 79751535222     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2010.11.003     Document Type: Article

References (22)

1. P.A. Abdulla, K. Černs, B. Jonsson, and T. Yih-Kuen General decidability theorems for infinite-state systems LICS 1996 313 321
2. P.A. Abdulla, G. Delzanno, On the coverability problem for constrained multiset rewriting systems, AVIS 2006 (ETAPS 2006 workshop), Available at the URL http://www.disi.unige.it/person/DelzannoG/Papers/avis06.pdf.
3. P.A. Abdulla, G. Delzanno, and L. Van Begin Comparing the expressive power of well-structured transition systems CSL 2007 99 114
4. (Pubitemid 126411497)
5. P.A. Abdulla, and B. Jonsson Undecidable verification problems for programs with unreliable channels Inf. Comput. 130 1 1996 71 90 (Pubitemid 126411858)
6. N. Bertrand, and Ph. Schnoebelen A short visit to the STS hierarchy ENTCS 154 3 2006 59 69 (Pubitemid 44038481)
7. G. Cécé, A. Finkel, and S.P. Iyer Unreliable channels are easier to verify than perfect channels Inf. Comput. 124 1 1996 20 31 (Pubitemid 126411491)
8. K. Černs Deciding properties of integral relational automata ICALP 1994 35 46
9. G. Ciardo Petri nets with marking-dependent arc multiplicity: properties and analysis ICATPN 1994 179 198
10. L.E. Dickson Finiteness of the odd perfect and primitive abundant numbers with r distinct prime factors Am. J. Math. 35 1913 413 422
11. J. Esparza, A. Finkel, and R. Mayr On the verification of broadcast protocols LICS 1999 352 359
12. C. Dufourd, A. Finkel, and Ph. Schnoebelen Reset nets between decidability and undecidability ICALP 1998 103 115 (Pubitemid 128111106)
13. A. Finkel, G. Geeraerts, J.-F. Raskin, and L. Van Begin On the ω-language expressive power of extended Petri nets TCS 356 3 2006 374 386 (Pubitemid 44304409)
14. A. Finkel, and Ph. Schnoebelen Well-structured transition systems everywhere TCS 256 1-2 2001 63 92
15. G. Geeraerts, J.-F. Raskin, and L. Van Begin Well-structured languages Acta Inform. 44 3-4 2007 249 288
16. M. Hack, Petri net languages, Technical Report TR-159, MIT, 1976.
17. T.A. Henzinger, R. Majumdar, and J.-F. Raskin A classification of symbolic transition systems ACM Trans. Comput. Log. 6 1 2005 1 32 (Pubitemid 40080280)
18. F. Rosa Velardo, and D. de Frutos-Escrig Name creation vs. replication in Petri net systems ICATPN 2007 402 422
19. A. Finkel, P. McKenzie, and C. Picaronny A well-structured framework for analysing petri net extensions Inf. Comput. 195 1-2 2004 1 29
20. R. Lazic, T.C. Newcomb, J. Ouaknine, A.W. Roscoe, and J. Worrell Nets with tokens which carry data ICATPN 2007 301 320
21. R. Mayr Undecidable problems in unreliable computations LATIN 2000 377 386
22. C.A. Petri, Kommunikation mit Automaten, Ph.D. Thesis, University of Bonn, 1962.