Refinement checking on parametric modal transition systems
From MaRDI portal
Publication:2340259
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
Cites work
- scientific article; zbMATH DE number 1693039 (Why is no real title available?)
- scientific article; zbMATH DE number 1693527 (Why is no real title available?)
- scientific article; zbMATH DE number 125881 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1863177 (Why is no real title available?)
- scientific article; zbMATH DE number 7319028 (Why is no real title available?)
- scientific article; zbMATH DE number 2209335 (Why is no real title available?)
- 20 years of modal and mixed specifications.
- A modal interface theory for component-based design
- Abstraction for branching time properties.
- Behavioural equivalences on finite-state systems are PTIME-hard
- Characteristic \(\mu\)-calculus formulas for underspecified transition systems
- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
- Comparing disjunctive modal transition systems with an one-selecting variant
- Complexity of Decision Problems for Mixed and Modal Specifications
- Compositional may-must program analysis: unleashing the power of alternation
- Deciding bisimilarity is P-complete
- Don't know for multi-valued systems
- Dual-priced modal transition systems with time durations
- EXPTIME-completeness of thorough refinement on modal transition systems
- Graphical versus logical specifications
- Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
- MoTraS: a tool for modal transition systems and their extensions
- Modal Abstractions of Concurrent Behaviour
- Modal I/O Automata for Interface and Product Line Theories
- Modal event-clock specifications for timed component-based design
- Modal interface automata
- Modal transition systems with weight intervals
- Modal transition systems: composition and LTL model checking
- On Modal Refinement and Consistency
- On determinism in modal transition systems
- On refinements of Boolean and parametric modal transition systems
- Parametric modal transition systems
- Process algebra for modal transition systemses
- Quantitative refinement for weighted modal transition systems
Cited in
(14)- An inductive approach for modal transition system refinement
- 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
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)
