Extending modal transition systems with structured labels

DOI10.1017/S0960129511000697zbMath1277.68160MaRDI QIDQ2909731

Sebastian S. Bauer, Line Juhl, Axel Legay, Jiří Srba, Kim Guldstrand Larsen

Publication date: 6 September 2012

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

refinementmodal transition systemsstructured labelsdeterminisation

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

Event algebra for transition systems composition application to timed automata ⋮ General quantitative specification theories with modal transition systems ⋮ A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories ⋮ Stuttering for abstract probabilistic automata ⋮ Weighted modal transition systems ⋮ Parametric and Quantitative Extensions of Modal Transition Systems ⋮ Compositionality for quantitative specifications ⋮ A linear-time-branching-time spectrum for behavioral specification theories ⋮ Logical vs. behavioural specifications

Uses Software

• MIO Workbench

Cites Work

• Unnamed Item
• Modal logics for communicating systems
• Graphical versus logical specifications
• On determinism in modal transition systems
• Modal specifications for the control theory of discrete event systems
• Calculi for synchrony and asynchrony
• A context dependent equivalence between processes
• A compositional protocol verification using relativized bisimulation
• Timed I/O automata
• Abstract Probabilistic Automata
• Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
• On Weak Modal Compatibility, Refinement, and the MIO Workbench
• Refinement and Consistency of Timed Modal Specifications
• Compositional Abstraction for Stochastic Systems
• Algebraic laws for nondeterminism and concurrency
• Behavioral equivalence in the polymorphic pi-calculus
• An axiomatic basis for computer programming
• Modal I/O Automata for Interface and Product Line Theories

This page was built for publication: Extending modal transition systems with structured labels