Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete

DOI10.1007/978-3-642-03466-4_7zbMath1250.68117OpenAlexW1594368577MaRDI QIDQ3393402

Jan Křetínský, Nikola Beneš, Kim Guldstrand Larsen, Jiří Srba

Publication date: 20 August 2009

Published in: Theoretical Aspects of Computing - ICTAC 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03466-4_7

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

Extending modal transition systems with structured labels ⋮ Abstract probabilistic automata ⋮ Simulation relations and applications in formal methods ⋮ Consistency and refinement for interval Markov chains ⋮ Modal transition systems with weight intervals ⋮ Modal and mixed specifications: key decision problems and their complexities ⋮ Weighted modal transition systems ⋮ Abstract Probabilistic Automata ⋮ Refinement checking on parametric modal transition systems

Uses Software

• MSTA

This page was built for publication: Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete