Comparing the expressive power of well-structured transition systems

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

Volumn 4646 LNCS, Issue , 2007, Pages 99-114

  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 systems

Indexed keywords

AUTOMATA THEORY; CHANNEL ESTIMATION; PETRI NETS; SEMANTICS;

EXPRESSIVENESS; LANGUAGE THEORY; LOSSY CHANNEL SYSTEMS; WELL-STRUCTURED SYSTEMS;

FORMAL LANGUAGES;

EID: 38049076840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74915-8_11     Document Type: Conference Paper

References (19)

1. Abdulla, P.A., Čerãns, K., Jonsson, B., Yih-Kuen, T.: General decidability theorems for infinite-state systems. In: LICS, pp. 313-321 (1996)
2. Abdulla, P.A., Delzanno, G.: On the coverability problem for constrained multiset rewriting. In: AVIS 2006, an ETAPS Workshop (2006)
3. Abdulla, P.A., Delzanno, G., Van Begin, L.: Comparing the expressive power of well-structured transition systems. Technical Report, DISI (June 2007)
4. Abdulla, P.A., Jonsson, B.: Model checking of systems with many identical timed processes. TCS 290(1), 241-264 (2003)
5. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. 127(2), 91-101 (1996)
6. Abdulla, P.A., Jonsson, B.: Undecidable verification problems for programs with unreliable channels. Inf. Comput. 130(1), 71-90 (1996)
7. Bertrand, N., Schnoebelen, Ph.: A short visit to the STS hierarchy. ENTCS 154(3), 59-69 (2006)
8. Cécé, G., Finkel, A., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Inf. Comput. 124(1), 20-31 (1996)
9. Čerãns, K.: Deciding properties of integral relational automata. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 35-46. Springer, Heidelberg (1994)
10. 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)
11. Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: LICS 1999, pp. 352-359 (1999)
12. Finkel, A., Geeraerts, G., Raskin, J.-F., Van Begin, L.: On the ω-language expressive power of extended petri nets. TCS 356(3), 374-386 (2006)
13. Finkel, A., Schnoebelen, Ph.: Well-structured transition systems everywhere! TCS 256(1-2), 63-92 (2001)
14. Geeraerts, G., Raskin, J.-F., Van Begin, L.: Well-structured languages. Technical report 542, ULB (2005)
15. Hack, M.: Petri net languages. Technical report 159, MIT, Cambridge (1976)
16. Henzinger, T.A., Majumdar, R., Raskin, J.-F.: A classification of symbolic transition systems. ACM Trans. Comput. Log. 6(1), 1-32 (2005)
17. Lazieć, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worell, J.: Nets with tokens which carry data. In: ATPN 2007 (to appear, 2007)
18. Mayr, R.: Undecidable problems in unreliable computations. In: Gönnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 377-386. Springer, Heidelberg (2000)
19. Petri, CA.: Kommunikation mit Automaten. PhD Thesis. Univ. of Bonn (1962)