Comparing disjunctive modal transition systems with an one-selecting variant

DOI10.1016/J.JLAP.2008.05.003zbMATH Open1151.68035OpenAlexW2062964969MaRDI QIDQ953529FDOQ953529

Authors: Harald Fecher, Heiko Schmidt 

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

Recommendations

• Process algebra for modal transition systemses
• Modal transition systems: composition and LTL model checking
• Observational refinement and merge for disjunctive MTSs
• Parametric modal transition systems
• On determinism in modal transition systems

zbMATH Keywords

abstractionrefinementexpressivenessunderspecificationbranching time

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• EXPTIME-completeness of thorough refinement on modal transition systems
• Modal transition systems with weight intervals
• Refinement checking on parametric modal transition systems
• Modelling and analysing variability in product families: model checking of modal transition systems with variability constraints
• Complexity of Decision Problems for Mixed and Modal Specifications
• Abstraction in fixpoint logic
• Parametric and quantitative extensions of modal transition systems
• Logical vs. behavioural specifications
• EXPTIME-complete decision problems for modal and mixed specifications
• Nondeterministic modal interfaces
• Modal transition system encoding of featured transition systems
• Comparative expressiveness of product line calculus of communicating systems and 1-selecting modal transition systems

This page was built for publication: Comparing disjunctive modal transition systems with an one-selecting variant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953529)