ACTL for modal interface automata
From MaRDI portal
Publication:2404073
DOI10.1016/j.tcs.2017.06.011zbMath1373.68296OpenAlexW2727157302MaRDI QIDQ2404073
Publication date: 12 September 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.06.011
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items (2)
A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories ⋮ Richer interface automata with optimistic and pessimistic compatibility
Uses Software
Cites Work
- Safe reasoning with logic LTS
- Graphical versus logical specifications
- Conjunction on processes: Full abstraction via ready-tree semantics
- Richer interface automata with optimistic and pessimistic compatibility
- Nondeterministic modal interfaces
- Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
- A Modal Interface Theory for Component-based Design
- Structural Refinement for the Modal nu-Calculus
- Modal Transition Systems: Composition and LTL Model Checking
- On Weak Modal Compatibility, Refinement, and the MIO Workbench
- Algebraic laws for nondeterminism and concurrency
- An action-based framework for veryfying logical and behavioural properties of concurrent systems
- Modal I/O Automata for Interface and Product Line Theories
- Modal Interface Automata
This page was built for publication: ACTL for modal interface automata