On determinism in modal transition systems

DOI10.1016/j.tcs.2009.06.009zbMath1186.68314OpenAlexW1963951244MaRDI QIDQ843096

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

Publication date: 29 September 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.009

zbMATH Keywords

consistencyrefinementmodal transition systemscompositional verificationdeterministic specifications

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

Extending modal transition systems with structured labels ⋮ Abstract probabilistic automata ⋮ General quantitative specification theories with modal transition systems ⋮ Simulation relations and applications in formal methods ⋮ Coherent modal transition systems refinement ⋮ Modal transition systems with weight intervals ⋮ EXPTIME-completeness of thorough refinement on modal transition systems ⋮ Interface theories for concurrency and data ⋮ Safe reasoning with logic LTS ⋮ Constraint Markov chains ⋮ Compositionality for quantitative specifications ⋮ Logical vs. behavioural specifications ⋮ Refinement checking on parametric modal transition systems