Comparing disjunctive modal transition systems with an one-selecting variant

DOI10.1016/j.jlap.2008.05.003zbMath1151.68035MaRDI QIDQ953529

Heiko Schmidt, Harald Fecher

Publication date: 6 November 2008

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2008.05.003

zbMATH Keywords

refinement; expressiveness; abstraction; branching time; underspecification

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

EXPTIME-complete Decision Problems for Modal and Mixed Specifications, Parametric and Quantitative Extensions of Modal Transition Systems, Abstraction in Fixpoint Logic, Complexity of Decision Problems for Mixed and Modal Specifications, Modelling and analysing variability in product families: model checking of modal transition systems with variability constraints, Modal transition systems with weight intervals, EXPTIME-completeness of thorough refinement on modal transition systems, Logical vs. behavioural specifications, Refinement checking on parametric modal transition systems, Modal transition system encoding of featured transition systems, Nondeterministic modal interfaces

Cites Work

• Results on the propositional \(\mu\)-calculus
• Bisimulation through probabilistic testing
• Forward and backward simulations. I. Untimed Systems
• Testing equivalence as a bisimulation equivalence
• Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
• Automata for the modal μ-calculus and related results
• Tools and Algorithms for the Construction and Analysis of Systems
• More Precise Partition Abstractions
• Program development by stepwise refinement
• Verification, Model Checking, and Abstract Interpretation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item