On the relationship between spatial logics and behavioral simulations

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

Volumn 6014 LNCS, Issue , 2010, Pages 146-160

  Acciai, Lucia ^a   Boreale, Michele ^a   Zavattaro, Gianluigi ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL SIMULATION; BEHAVIOURAL SIMULATIONS; BROADCAST PROTOCOLS; DISTRIBUTED COMPUTATIONS; GENERAL CLASS; INFINITE-STATE; MODEL CHECKING PROBLEM; MONOIDAL STRUCTURE; PREORDERS; SPATIAL DIMENSION; SPATIAL LOGIC; TRANSITION SYSTEM; WEIGHTED AUTOMATA;

COMPUTABILITY AND DECIDABILITY; COMPUTER SOFTWARE; GRAPH THEORY; PETRI NETS;

MODEL CHECKING;

EID: 77951475621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12032-9_11     Document Type: Conference Paper

References (26)

1. Acciai, L., Boreale, M., Zavattaro, G.: On the relationship between spatial logics and behavioral simulations. Tech. rep. (2010), http://rap.dsi.unifi.it/~acciai
2. Acciai, L., Boreale, M.: Deciding safety properties in infinite-state pi-calculus via behavioural types. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 31-42. Springer, Heidelberg (2009)
3. Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.P.: Synchronization and linearity. Wiley, Chichester (1992)
4. Busi, N., Gabbrielli, M., Zavattaro, G.: Comparing Recursion, Replication, and Iteration in Process Calculi. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 307-319. Springer, Heidelberg (2004)
5. Caires, L.: Behavioural and Spatial Observations in a Logic for the pi-Calculus. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 72-89. Springer, Heidelberg (2004)
6. Caires, L., Cardelli, L.: A spatial logic for concurrency (part II). Theor. Comput. Sci. 322(3), 517-565 (2004)
7. Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). Inf. Comput. 186(2), 194-235 (2003)
8. Caires, L., Lozes, E.: Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 240-257. Springer, Heidelberg (2004)
9. Cardelli, L., Gordon, A.D.: Anytime, Anywhere: Modal Logics for Mobile Ambients. In: Proc. of POPL, pp. 365-377 (2000)
10. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with r distinct prime factors. Amer. Journal Math 35, 413-422 (1913)
11. Dufourd, E.C., Finkel, A., Schnöebelen, 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)
12. Esparza, J., Finkel, A., Meyr, R.: On the Verification of Broadcast Protocols. In: Proc. of LICS, pp. 352-359 (1999)
13. Esparza, J.: On the Decidability of Model Checking for Several μ-calculi and Petri Nets. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 115-129. Springer, Heidelberg (1994)
14. Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part I: Completions. In: Proc. of STACS, Dagstuhl Seminar Proceedings 09001, pp. 433-444 (2009)
15. Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part II: Complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 188-199. Springer, Heidelberg (2009)
16. Finkel, A., McKenzie, P., Picaronny, C.: A Well-Structured Framework for Analysing Petri Net Extensions. Information and Computation 195(1-2), 1-29 (2004)
17. Finkel, A., Schnöebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256(1-2), 63-92 (2001)
18. Hack, M.H.T.: Decidability questions for Petri nets. Ph.D Thesis. MIT (1976)
19. Hennessy, M., Milner, R.: On Observing Nondeterminism and Concurrency. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 299-309. Springer, Heidelberg (1980)
20. Hirschkoff, D., Lozes, E., Sangiorgi, D.: Separability, Expressiveness, and Decidability in the Ambient Logic. In: Proc. of LICS, pp. 423-432 (2002)
21. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Monographs in Theoretical Computer Science, EATCS Series, vol. 5. Springer, Heidelberg (1986)
22. Milner, R.: Communication and concurrency. Prentice-Hall, Englewood Cliffs (1989)
23. Minsky, M.: Computation: Finite and Infinite Machines, 1st edn. Prentice-Hall, Inc., Englewood Cliffs (1967)
24. Sangiorgi, D.: Extensionality and Intensionality of the Ambient Logics. In: Proc. of POPL, pp. 4-13 (2001)
25. Simon, I.: Limited subset of a Free Monoid. In: Proc. of FOCS, pp. 143-150 (1978)
26. Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability problems in Petri nets. Acta Informatica 21, 643-674 (1985)