Branching-Time Model Checking Gap-Order Constraint Systems

Richard Mayr, Patrick Totzke

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


We consider the model checking problem for Gap-order Constraint Systems (GCS) w.r.t. the branching-time temporal logic CTL, and in particular its fragments EG and EF. GCS are nondeterministic infinitely branching processes described by evolutions of integer-valued variables, subject to Presburger constraints of the form x − y ≥ k, where x and y are variables or constants and k ∈ ℕ is a non-negative constant. We show that EG model checking is undecidable for GCS, while EF is decidable. In particular, this implies the decidability of strong and weak bisimulation equivalence between GCS and finite-state systems.
Original languageEnglish
Title of host publicationReachability Problems
Subtitle of host publication7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings
PublisherSpringer Berlin Heidelberg
Number of pages12
ISBN (Electronic)978-3-642-41036-9
ISBN (Print)978-3-642-41035-2
Publication statusPublished - 2013


Dive into the research topics of 'Branching-Time Model Checking Gap-Order Constraint Systems'. Together they form a unique fingerprint.

Cite this