Applying step coverability trees to communicating component-based systems

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

Volumn 5961 LNCS, Issue , 2010, Pages 178-193

  Kleijn, Jetty ^a   Koutny, Maciej ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Boundedness; Components; Decidability; Localities; Marked graphs; Maximal concurrency; Petri nets; Step coverability tree; Step semantics

Indexed keywords

BOUNDEDNESS; COMPONENTS; COVERABILITY; LOCALITIES; MARKED GRAPHS;

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SOFTWARE; DYNAMICAL SYSTEMS; GRAPH THEORY; PERMANENT MAGNETS; PETRI NETS; SEMANTICS;

COMPUTABILITY AND DECIDABILITY;

EID: 77949449322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11623-0_10     Document Type: Conference Paper

References (24)

1. Agerwala, T.: A Complete Model for Representing the Coordination of Asynchronous Processes. In: Hopkins Comp. Research Rep., vol. 32. Johns Hopkins Univ. (1974)
2. Baeten, J.C.M., Weijland, W.P.: Process algebra. Cambridge Tracts in Theoretical Computer Science, vol. 18. Cambridge University Press, Cambridge (1990)
3. Busi, N.: Analysis Issues in Petri Nets with Inhibitor Arcs. Theoretical Computer Science 275, 127-177 (2002)
4. Commoner, F., Holt, A.W., Even, S., Pnueli, A.: Marked Directed Graphs. J. Comput. Syst. Sci. 5, 511-523 (1971)
5. Darondeau, P., Genest, B., Thiagarajan, P.S., Yang, S.: Quasi-Static Scheduling of Communicating Tasks. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 310-324. Springer, Heidelberg (2008)
6. Desel, J., Esparza, J.: Free Choice Nets. Cambridge University Press, Cambridge (1995)
7. Desel, J., Reisig, W.: Place/Transition Petri Nets. In: [20], pp. 122-173
8. Esparza, J., Nielsen, M.: Decidability Issues for Petri Nets: A Survey. J. of Inf. Processing and Cybernetics 30, 143-160 (1994)
9. Ghamarian, A.H., Geilen, M.C.W., Basten, T., Theelen, B.D., Mousavi, M.R., Stuijk, S.: Liveness and Boundedness of Synchronous Data Flow Graphs. In: FMCAD 2006, pp. 12-16 (2006)
10. Hack, M.: Decision Problems for Petri Nets and Vector Addition Systems. Technical Memo 59, Project MAC, MIT (1975)
11. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
12. Karp, R.M., Miller, R.E.: Parallel Program Schemata. J. Comput. Syst. Sci. 3, 147-195 (1969)
13. Kleijn, J., Koutny, M.: Steps and Coverability in Inhibitor Nets. In: Lodaya, K., Mukund, M., Ramanujam, R. (eds.) Perspectives in Concurrency Theory, pp. 264-295. Universities Press, Hyderabad (2008)
14. Kleijn, J., Koutny, M., Rozenberg, G.: Process Semantics for Membrane Systems. J. of Aut., Lang. and Comb. 11, 321-340 (2006)
15. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
16. Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes. Inf. and Comp. 100, 1-77 (1992)
17. Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs (1981)
18. Petri, C.A.: Fundamentals of a Theory of Asynchronous Information Flow. In: IFIP Congress 1962, pp. 386-390. North Holland, Amsterdam (1962)
19. Rozenberg, G., Engelfriet, J.: Elementary Net Systems. In: [20], 12-121
20. Reisig, W., Rozenberg, G. (eds.): APN 1998. LNCS, vol. 1491. Springer, Heidelberg (1998)
21. Rozenberg, G., Thiagarajan, P.S.: Petri Nets: Basic Notions, Structure, Behaviour. In: Rozenberg, G., de Bakker, J.W., de Roever, W.-P. (eds.) Current Trends in Concurrency. LNCS, vol. 224, pp. 585-668. Springer, Heidelberg (1986)
22. Valmari, A.: The State Explosion Problem. In: [20], 429-528
23. Wimmel, H.: Entscheidbarkeitsfragen bei Petri Netzen. Habilitation (2007)
24. Yoeli, M.: Specification and Verification of Asynchronous Circuits using Marked Graphs. In: Rozenberg, G. (ed.) APN 1987. LNCS, vol. 266, pp. 605-622. Springer, Heidelberg (1987)