We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history preserving bisimilarity, and fragments of the logic can be identified which correspond to other true concurrent behavioural equivalences in the literature: step, pomset and history preserving bisimilarity. Standard Hennessy-Milner logic, thus (interleaving) bisimilarity, is also recovered as a fragment. We believe that this contributes to a rational presentation of the true concurrent spectrum and to a deeper understanding of the relations between the involved behavioural equivalences. © 2010 Springer-Verlag.
CITATION STYLE
Baldan, P., & Crafa, S. (2010). A logic for true concurrency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6269 LNCS, pp. 147–161). https://doi.org/10.1007/978-3-642-15375-4_11
Mendeley helps you to discover research relevant for your work.