Modal and mixed specifications: key decision problems and their complexities
DOI10.1017/S0960129509990260zbMATH Open1191.68426OpenAlexW2075287480MaRDI QIDQ3550702FDOQ3550702
Authors: Adam Antonik, Michael Huth, Ulrik Nyman, Andrzej Wąsowski, Kim G. 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
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A finite model theorem for the propositional \(\mu\)-calculus
- Alternation
- State explosion in almost-sure probabilistic reachability
- Title not available (Why is that?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
- EXPTIME-complete decision problems for modal and mixed specifications
- Complexity of Decision Problems for Mixed and Modal Specifications
- Refinement is complete for implementations
- Labelled transition systems as a Stone space
- Three theorems on phrase structure grammars of type 1
- Strategy Construction for Parity Games with Imperfect Information
- On the complexity of semantic self-minimization
Cited In (5)
- EXPTIME-completeness of thorough refinement on modal transition systems
- Consistency and refinement for interval Markov chains
- Complexity of Decision Problems for Mixed and Modal Specifications
- 20 years of modal and mixed specifications.
- EXPTIME-complete decision problems for modal and mixed specifications
This page was built for publication: Modal and mixed specifications: key decision problems and their complexities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550702)
