Nondeterministic modal interfaces
DOI10.1016/j.tcs.2016.06.011zbMath1345.68231OpenAlexW2442527218MaRDI QIDQ2629098
Walter Vogler, Gerald Lüttgen, Sascha Fendrich, Ferenc Bujtor
Publication date: 20 July 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.011
modal transition systemscomponent based designdisjunctive must-transitionsinterface theoriesmodal interface automata
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A process algebraic view of input/output automata
- Comparing disjunctive modal transition systems with an one-selecting variant
- Refinement checking on parametric modal transition systems
- Richer interface automata with optimistic and pessimistic compatibility
- Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
- Merging Partial Behaviour Models with Different Vocabularies
- A Compositional Specification Theory for Component Behaviours
- A Modal Interface Theory for Component-based Design
- Error-Pruning in Interface Automata
- On Weak Modal Compatibility, Refinement, and the MIO Workbench
- MoTraS: A Tool for Modal Transition Systems and Their Extensions
- Nondeterministic Modal Interfaces
- Modal I/O Automata for Interface and Product Line Theories
- Modal Interface Automata
- Formal Approaches to Software Testing
This page was built for publication: Nondeterministic modal interfaces
