Model-Checking Games for Fixpoint Logics with Partial Order Models

DOI10.1007/978-3-642-04081-8_24zbMath1254.68150OpenAlexW1720837145MaRDI QIDQ3184685

Julian Bradfield, Julian Gutierrez

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:0c1cfae1-feb8-4a87-b03b-fb31f13aaeb8

zbMATH Keywords

temporal logicprocess algebrasmodel-checking gamesHintikka game semanticspartial order models of concurrency

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Characterising spectra of equivalences for event structures, logically ⋮ Local Model Checking in a Logic for True Concurrency ⋮ Model-checking games for fixpoint logics with partial order models ⋮ Event Identifier Logic ⋮ A Logic for True Concurrency

Cites Work

• Bisimulation from open maps
• Logics and Bisimulation Games for Concurrency, Causality and Conflict
• Model Checking Games
• Modal and temporal properties of processes
• Unnamed Item
• Unnamed Item

This page was built for publication: Model-Checking Games for Fixpoint Logics with Partial Order Models