scientific article
From MaRDI portal
Publication:3396636
zbMath1169.68498MaRDI QIDQ3396636
Ulrik Nyman, Andrzej Wąsowski, Michael Huth, Adam Antonik, Kim Guldstrand Larsen
Publication date: 19 September 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (18)
Model Checking Value-Passing Modal Specifications ⋮ Simulation relations and applications in formal methods ⋮ Coherent modal transition systems refinement ⋮ A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories ⋮ Modal event-clock specifications for timed component-based design ⋮ Consistency and refinement for interval Markov chains ⋮ Modal transition systems with weight intervals ⋮ Refinement modal logic ⋮ Counterexample-guided inductive synthesis for probabilistic systems ⋮ Weighted modal transition systems ⋮ EXPTIME-completeness of thorough refinement on modal transition systems ⋮ EXPTIME-complete Decision Problems for Modal and Mixed Specifications ⋮ Modelling and analysing variability in product families: model checking of modal transition systems with variability constraints ⋮ A linear-time-branching-time spectrum for behavioral specification theories ⋮ On the Complexity of Semantic Self-minimization ⋮ k-Bounded Petri Net Synthesis from Modal Transition Systems. ⋮ Refinement checking on parametric modal transition systems ⋮ From EU Projects to a Family of Model Checkers
This page was built for publication: