Refinement checking on parametric modal transition systems
DOI10.1007/S00236-015-0215-4zbMATH Open1309.68130OpenAlexW2151274864MaRDI QIDQ2340259FDOQ2340259
Authors: Nikola Beneš, Jan Křetínský, Mikael H. Møller, Salomon Sickert, Jiří Srba, Kim G. Larsen 
Publication date: 16 April 2015
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://vbn.aau.dk/da/publications/28419191-f4e1-4b9d-b06a-f0ce2469c78a
Recommendations
- Parametric modal transition systems
- On refinements of Boolean and parametric modal transition systems
- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
- EXPTIME-completeness of thorough refinement on modal transition systems
- Modal transition systems: composition and LTL model checking
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
- MoTraS: a tool for modal transition systems and their extensions
- Title not available (Why is that?)
- Deciding bisimilarity is P-complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modal I/O Automata for Interface and Product Line Theories
- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
- Graphical versus logical specifications
- On determinism in modal transition systems
- Modal event-clock specifications for timed component-based design
- Dual-priced modal transition systems with time durations
- A modal interface theory for component-based design
- Quantitative refinement for weighted modal transition systems
- Modal transition systems: composition and LTL model checking
- Modal transition systems with weight intervals
- Title not available (Why is that?)
- Compositional may-must program analysis: unleashing the power of alternation
- Parametric modal transition systems
- 20 years of modal and mixed specifications.
- Modal Abstractions of Concurrent Behaviour
- Comparing disjunctive modal transition systems with an one-selecting variant
- Title not available (Why is that?)
- On Modal Refinement and Consistency
- Complexity of Decision Problems for Mixed and Modal Specifications
- Behavioural equivalences on finite-state systems are PTIME-hard
- On refinements of Boolean and parametric modal transition systems
- Title not available (Why is that?)
- EXPTIME-completeness of thorough refinement on modal transition systems
- Characteristic \(\mu\)-calculus formulas for underspecified transition systems
- Abstraction for branching time properties.
- Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
- Process algebra for modal transition systemses
- Title not available (Why is that?)
- Modal interface automata
- Don't know for multi-valued systems
Cited In (14)
- Counterexample-guided inductive synthesis for probabilistic systems
- EXPTIME-completeness of thorough refinement on modal transition systems
- On refinements of Boolean and parametric modal transition systems
- Modal transition systems: composition and LTL model checking
- On the expressiveness of refinement settings
- Partitioned PLTL model-checking for refined transition systems
- Coherent modal transition systems refinement
- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
- Parameterized Model Checking of Token-Passing Systems
- Refinement is complete for implementations
- Parametric modal transition systems
- Nondeterministic modal interfaces
- Counterexample-driven synthesis for probabilistic program sketches
- An inductive approach for modal transition system refinement
Uses Software
This page was built for publication: Refinement checking on parametric modal transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340259)
