Abstract
Spatial logics have been introduced to reason about distributed computation in models for concurrency. We first define a spatial logic for a general class of infinite-state transition systems, the Spatial Transition Systems (sts), where a monoidal structure on states accounts for the spatial dimension. We then show that the model checking problem for this logic is undecidable already when interpreted over Petri nets. Next, building on work by Finkel and Schnöbelen, we introduce a subclass of sts, the Well-Structured sts (ws-sts), which is general enough to include such models as Petri nets, Broadcast Protocols, ccs and Weighted Automata. Over ws-sts, an interesting fragment of spatial logic - the monotone fragment - turns out to be decidable under reasonable effectiveness assumptions. For this class of systems, we also offer a Hennessy-Milner theorem, characterizing the logical preorder induced by the monotone fragment as the largest spatial-behavioural simulation. We finally prove that, differently from the corresponding logic, this preorder is in general not decidable, even when confining to effective ws-sts.
Research partly supported by the EU within the FET-GC2 initiative, project Sensoria. The third author is partially supported by the EU integrated project HATS.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Acciai, L., Boreale, M., Zavattaro, G.: On the relationship between spatial logics and behavioral simulations. Tech. rep. (2010), http://rap.dsi.unifi.it/~acciai
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)
Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.P.: Synchronization and linearity. Wiley, Chichester (1992)
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)
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)
Caires, L., Cardelli, L.: A spatial logic for concurrency (part II). Theor. Comput. Sci. 322(3), 517–565 (2004)
Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). Inf. Comput. 186(2), 194–235 (2003)
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)
Cardelli, L., Gordon, A.D.: Anytime, Anywhere: Modal Logics for Mobile Ambients. In: Proc. of POPL, pp. 365–377 (2000)
Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with r distinct prime factors. Amer. Journal Math 35, 413–422 (1913)
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)
Esparza, J., Finkel, A., Meyr, R.: On the Verification of Broadcast Protocols. In: Proc. of LICS, pp. 352–359 (1999)
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)
Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part I: Completions. In: Proc. of STACS, Dagstuhl Seminar Proceedings 09001, pp. 433–444 (2009)
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)
Finkel, A., McKenzie, P., Picaronny, C.: A Well-Structured Framework for Analysing Petri Net Extensions. Information and Computation 195(1-2), 1–29 (2004)
Finkel, A., Schnöebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256(1-2), 63–92 (2001)
Hack, M.H.T.: Decidability questions for Petri nets. Ph.D Thesis. MIT (1976)
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)
Hirschkoff, D., Lozes, E., Sangiorgi, D.: Separability, Expressiveness, and Decidability in the Ambient Logic. In: Proc. of LICS, pp. 423–432 (2002)
Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Monographs in Theoretical Computer Science, EATCS Series, vol. 5. Springer, Heidelberg (1986)
Milner, R.: Communication and concurrency. Prentice-Hall, Englewood Cliffs (1989)
Minsky, M.: Computation: Finite and Infinite Machines, 1st edn. Prentice-Hall, Inc., Englewood Cliffs (1967)
Sangiorgi, D.: Extensionality and Intensionality of the Ambient Logics. In: Proc. of POPL, pp. 4–13 (2001)
Simon, I.: Limited subset of a Free Monoid. In: Proc. of FOCS, pp. 143–150 (1978)
Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability problems in Petri nets. Acta Informatica 21, 643–674 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Acciai, L., Boreale, M., Zavattaro, G. (2010). On the Relationship between Spatial Logics and Behavioral Simulations . In: Ong, L. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2010. Lecture Notes in Computer Science, vol 6014. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12032-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-12032-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12031-2
Online ISBN: 978-3-642-12032-9
eBook Packages: Computer ScienceComputer Science (R0)