A language-based comparison of extensions of petri nets with and without whole-place operations

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

Volumn 5457, Issue , 2009, Pages 71-82

  Aziz Abdulla, Parosh ^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

[No Author keywords available]

Indexed keywords

COVERABILITY; IN-BETWEEN; INFINITE DOMAINS; INFINITE-STATE; LANGUAGE THEORY; WELL-STRUCTURED TRANSITION SYSTEMS;

GRAPH THEORY; LINGUISTICS; PETRI NETS; ROBOTS; TRANSLATION (LANGUAGES); TURING MACHINES;

QUERY LANGUAGES;

EID: 67649971312     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00982-2_6     Document Type: Conference Paper

References (14)

1. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! TCS 256(1-2), 63-92 (2001)
2. Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, Vol. 1443, pp. 103-115. Springer, Heidelberg (1998) (Pubitemid 128111106)
3. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation 127(2), 91-101 (1996) (Pubitemid 126411497)
4. Cécé, G., Finkel, A., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Information and Computation 124(1), 20-31 (1996) (Pubitemid 126411491)
5. Abdulla, P.A., Delzanno, G.: On the coverability problem for constrained multiset rewriting. In: Proc. AVIS 2006, an ETAPS 2006 workshop (2006)
6. Abdulla, P.A., Delzanno, G., Van Begin, L.: Comparing the expressive power of well-structured transition systems. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, Vol. 4646, pp. 99-114. Springer, Heidelberg (2007)
7. Finkel, A., Geeraerts, G., Raskin, J.F., Van Begin, L.: On the ω-language expressive power of extended petri nets. TCS 356, 374-386 (2006) (Pubitemid 44304409)
8. Geeraerts, G., Raskin, J.F., Van Begin, L.: Well-structured languages. Acta Informatica 44(3-4), 249-288 (2007)
9. Abdulla, P.A., Čerans, K., Jonsson, B., Tsay, Y.K.: General decidability theorems for infinite-state systems. In: Proc. LICS 1996, pp. 313-321 (1996)
10. Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing petri net extensions. Information and Computation 195(1-2), 1-29 (2004)
11. Lazić, R.S., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.B.: Nets with tokens which carry data. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, Vol. 4546, pp. 301-320. Springer, Heidelberg (2007)
12. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35, 413-422 (1913)
13. Henzinger, T.A., Majumdar, R., Raskin, J.F.: A classification of symbolic transition systems. ACM Trans. Comput. Log. 44(1), 1-32 (2005) (Pubitemid 40080280)
14. Bertrand, N., Schnoebelen, P.: A short visit to the sts hierarchy. ENTCS 154(3), 59-69 (2006) (Pubitemid 44038481)