Model-Checking Games for Fixpoint Logics with Partial Order Models

  • Julian Gutierrez
  • Julian Bradfield
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5710)

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 (), in a noninterleaving setting they verify properties of Separation Fixpoint Logic (SFL), a logic that can specify in partial orders properties not expressible with . 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.

Keywords

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Julian Gutierrez
    • 1
  • Julian Bradfield
    • 1
  1. 1.LFCS. School of InformaticsUniversity of Edinburgh, Informatics ForumEdinburghUK

Personalised recommendations