A Logic for True Concurrency

DOI10.1145/2629638zbMath1321.68355arXiv1110.4094OpenAlexW1766510866MaRDI QIDQ5501929

Paolo Baldan, Silvia Crafa

Publication date: 14 August 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.4094

zbMATH Keywords

causalitybehavioural equivalencestrue concurrencymu-calculushistory-preserving bisimilarityevent structures

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

Behavioural logics for configuration structures ⋮ Contextual equivalences in configuration structures and reversibility ⋮ Verification of finite-state machines: a distributed approach ⋮ Characterising spectra of equivalences for event structures, logically ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ A coalgebraic semantics for causality in Petri nets ⋮ Unnamed Item ⋮ Local Model Checking in a Logic for True Concurrency ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ Conflict vs causality in event structures ⋮ Unnamed Item ⋮ A study on team bisimulation and H-team bisimulation for BPP nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-checking games for fixpoint logics with partial order models
• Petri nets, event structures and domains. I
• Undecidability of domino games and hhp-bisimilarity.
• Model checking mobile processes
• Bisimulation from open maps
• Model-checking processes with data
• Concurrent bisimulations in Petri nets
• Model-Checking Games for Fixpoint Logics with Partial Order Models
• A Logic for True Concurrency
• Logics and Bisimulation Games for Concurrency, Causality and Conflict
• The power of the future perfect in program logics
• Algebraic laws for nondeterminism and concurrency
• Computer Science Logic
• Refinement of actions and equivalence notions for concurrent systems

This page was built for publication: A Logic for True Concurrency