Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(15)- EXPTIME-completeness of thorough refinement on modal transition systems
- Modal and mixed specifications: key decision problems and their complexities
- Modal transition systems with weight intervals
- Checking simple properties of transition systems defined by Thue specifications
- On refinements of Boolean and parametric modal transition systems
- Modal transition systems: composition and LTL model checking
- Consistency and refinement for interval Markov chains
- Refinement checking on parametric modal transition systems
- Weighted modal transition systems
- Extending modal transition systems with structured labels
- EXPTIME-complete decision problems for modal and mixed specifications
- On Modal Refinement and Consistency
- Simulation relations and applications in formal methods
- Abstract probabilistic automata
- Abstract probabilistic automata
This page was built for publication: Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393402)