Well-structured languages

Acta Informatica

Volumn 44, Issue 3-4, 2007, Pages 249-288

  Geeraerts, Gilles ^a   Raskin, Jean François ^a   Van Begin, Laurent ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSURE PROPERTY; COMPUTER-AIDED VERIFICATIONS; EXPRESSIVE POWER; NON-BLOCKING; PUMPING LEMMA; TRANSFER ARCS; TRANSITION SYSTEM; WELL-STRUCTURED TRANSITION SYSTEMS;

COMPUTER AIDED ANALYSIS; FINITE AUTOMATA; PUMPS;

PETRI NETS;

EID: 34347336505     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s00236-007-0050-3     Document Type: Article

References (20)

1. Ahdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proceedings of the 11th Annual Symposium on Logic in Computer Science (LICS'96), pp. 313-321, IEEE Computer Society Press (1996)
2. Abdulla, P.A., Bouajjani, A., Jonsson, B.: On-the-fly analysis of systems with unbounded, lossy FIFO channels. In: Proceedings of the 10th International Conference on Computer Aided Verification (CAV'98), vol. 1427 of LNCS, pp. 305-318, Springer, Heidelberg (1998)
3. Abdulla, P., Annichini, A., Bouajjani, A.: Symbolic verification of lossy channel systems: application to the bounded retransmission protocol. In: Proceedings 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), number 1579 in LNCS, pp. 208-222. Springer, Heidelberg (1999)
4. Ciardo, G.: Petri nets with marking-dependent arc multiplicity: properties and analysis. In: Proceedings of the 15th International Conference on Applications and Theory of Petri Nets (ICATPN 94), vol. 815 of LNCS, pp. 179-198. Springer, Heidelberg (1994)
5. Delzanno, G.: Automatic verification of parameterized cache coherence protocols. In: Proceedings of the 12th International Conference on Computer Aided Verification (CAV 2000), vol. 1855 of LNCS, pp. 53-68, Springer, Heidelberg (2000)
6. Delzanno, G., Raskin, J.-K. Van Begin, L.: Towards the automated verification of multithreaded Java programs. In: Proceedings of the International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS 2002), vol. 2280 of LNCS, pp. 173-187. Springer, Heidelberg (2002)
7. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with a distinct prime factors. Am. J. Math. 35, 413-422 (1913)
8. Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinite-state systems. In: Proceedings of the 13th Annual Symposium on Logic in Computer Science (LICS '98). PP. 70-80. IEEE Computer Society Press (1998)
9. Finkel, A., Geeraerts, G., Raskin, J.-F., Van Begin, L.: On the omega-language expressive power of extended Petri nets. In: Proceedings of EXPRESS'04, 11th International Workshop on Expressiveness in Concurrency, London, Great Britain, vol. 128(2) of Electronic Notes in Theoretical Computer Science, pp. 87-101. Elsevier, Amsterdam (2004)
10. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theoret. Comput. Sci. 256 (1-2), 63-92 (2001)
11. German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM 39(3), 675-735 (1992)
12. Ginsburg, S.: Algebraic and automata-theoretic properties of formal languages. Elsevier. Amsterdam (1975)
13. Hopcroft, J., Motwani, R., Ullman, J.: Introduction to automata theory, languages, and computation, second edition. Addison-Wesley, Reading (2001)
14. Jantzen, M.: Language theory of Petri nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Proceedings of Advances in Petri Nets 1986. vol. 254 of LNCS, pp. 397-412, Springer, Heidelberg (1986)
15. Minsky, N.M.: Finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)
16. Peterson, J.L.: Petri net theory and the modeling of systems. Prentice-Hall, Englewood Cliffs (1981)
17. Raskin, J.-F. Van Begin, L.: Petri nets with non-blocking arcs are difficult to analyse. In: Proceedings of the 5th International Workshop on Verification of Infinite-state Systems (INFINITY 2003), vol. 96(1) of ENTCS. Elsevier, Amsterdam (2003)
18. Salomaa, A.: Formal languages. Academic. New York (1973)
19. Salomaa, A.: Computation and automata, vol. 25 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1985)
20. Van Begin, L.: Efficient verification of counting abstractions for parametric systems. PhD thesis, Université Libre de Bruxelles, Belgium (2003)