Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
The power of the future perfect in program logics
Information and Control
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Branching time and partial order in temporal logics
Time and logic
Handbook of logic in computer science (vol. 4)
Model checking mobile processes
Information and Computation
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Games and logics for a noninterleaving bisimulation
Nordic Journal of Computing
Independence-friendly modal logic and true concurrency
Nordic Journal of Computing
On Plain and Hereditary History-Preserving Bisimulation
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Deciding History Preserving Bisimilarity
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Back and Forth Bisimulations On Prime Event Structures
PARLE '92 Proceedings of the 4th International PARLE Conference on Parallel Architectures and Languages Europe
Minimal Transition Systems for History-Preserving Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Toward Parametric Verification of Open Distributed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Observational Logics and Concurrency Models
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Undecidability of domino games and hhp-bisimilarity
Information and Computation
Logics and Bisimulation Games for Concurrency, Causality and Conflict
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Model-Checking Games for Fixpoint Logics with Partial Order Models
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
The complexity of independence-friendly fixpoint logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Hi-index | 0.00 |
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.