Model-checking games for fixpoint logics with partial order models
From MaRDI portal
Publication:532389
DOI10.1016/J.IC.2010.12.002zbMath1215.68149OpenAlexW2111763696MaRDI QIDQ532389
Julian Bradfield, Julian Gutierrez
Publication date: 4 May 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2010.12.002
Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Models for concurrency: Towards a classification
- Results on the propositional \(\mu\)-calculus
- A distributed operational semantics of CCS based on condition/event systems
- Petri nets, event structures and domains. I
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
- A partial approach to model checking
- A partial order approach to branching time logic model checking.
- Automata, logics, and infinite games. A guide to current research
- Bisimulation from open maps
- Unfoldings: A partial-order approach to model checking.
- Model-Checking Games for Fixpoint Logics with Partial Order Models
- Logics and Bisimulation Games for Concurrency, Causality and Conflict
- Algebraic laws for nondeterminism and concurrency
- CONCURRENT AUTOMATA AND DOMAINS
- Model Checking Games
- Refinement of actions and equivalence notions for concurrent systems
- Comparing transition systems with independence and asynchronous transition systems
This page was built for publication: Model-checking games for fixpoint logics with partial order models
