Modal and mixed specifications: key decision problems and their complexities

DOI10.1017/S0960129509990260zbMath1191.68426OpenAlexW2075287480MaRDI QIDQ3550702

Michael Huth, Ulrik Nyman, Andrzej Wąsowski, Adam Antonik, Kim Guldstrand Larsen

Publication date: 1 April 2010

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129509990260

zbMATH Keywords

transition systems

Mathematics Subject Classification ID

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

Consistency and refinement for interval Markov chains ⋮ EXPTIME-completeness of thorough refinement on modal transition systems

Cites Work

• Unnamed Item
• State explosion in almost-sure probabilistic reachability
• A finite model theorem for the propositional \(\mu\)-calculus
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Refinement is complete for implementations
• On the Complexity of Semantic Self-minimization
• Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
• Strategy Construction for Parity Games with Imperfect Information
• Alternation
• EXPTIME-complete Decision Problems for Modal and Mixed Specifications
• Labelled transition systems as a Stone space
• Complexity of Decision Problems for Mixed and Modal Specifications
• Three theorems on phrase structure grammars of type 1