Model-Checking Games for Fixpoint Logics with Partial Order Models

Julian Gutierrez, Julian Bradfield

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We introduce model-checking games that allow local second-order power on sets of independent transitions in the underlying partial order models where the games are played. Since the one-step interleaving semantics of such models is not considered, some problems that may arise when using interleaving semantics are avoided and new decidability results for partial orders are achieved. The games are shown to be sound and complete, and therefore determined. While in the interleaving case they coincide with the local model-checking games for the μ-calculus (Lμ), in a noninterleaving setting they verify properties of Separation Fixpoint Logic (SFL), a logic that can specify in partial orders properties not expressible with Lμ. The games underpin a novel decision procedure for model-checking all temporal properties of a class of infinite and regular event structures, thus improving previous results in the literature.
Original languageEnglish
Title of host publicationCONCUR 2009 - Concurrency Theory
Subtitle of host publication20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings
EditorsMario Bravetti, Gianluigi Zavattaro
PublisherSpringer Berlin Heidelberg
Pages354-368
Number of pages15
Volume5710
ISBN (Electronic)978-3-642-04081-8
ISBN (Print)978-3-642-04080-1
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume5710

Keywords

  • Modal and temporal logics
  • Model-checking games
  • Hintikka game semantics
  • Partial order models of concurrency
  • Process algebras

Fingerprint Dive into the research topics of 'Model-Checking Games for Fixpoint Logics with Partial Order Models'. Together they form a unique fingerprint.

Cite this