On the relationship between spatial logics and behavioral simulations

  • Authors:

  • Lucia Acciai;Michele Boreale;Gianluigi Zavattaro

  • Affiliations:

  • Dipartimento di Sistemi e Informatica, Università di Firenze, Italy;Dipartimento di Sistemi e Informatica, Università di Firenze, Italy;Dipartimento di Scienze dell'Informazione, Università di Bologna, Italy

  • Venue:
  • FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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-Structuredsts (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.