A generalised theory of interface automata, component compatibility and error

DOI10.1007/s00236-018-0319-8zbMath1421.68093OpenAlexW2802929298WikidataQ129966043 ScholiaQ129966043MaRDI QIDQ2415373

Sascha Fendrich, Gerald Lüttgen

Publication date: 21 May 2019

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-018-0319-8

Mathematics Subject Classification ID

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

Related Items (2)

A linear-time branching-time perspective on interface automata ⋮ Interface automata for shared memory

Uses Software

• Motras
• MIO Workbench
• Mica

Cites Work

• Unnamed Item
• Unnamed Item
• An algebraic theory of interface automata
• Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
• Moving from interface theories to assembly theories
• Richer interface automata with optimistic and pessimistic compatibility
• Nondeterministic modal interfaces
• A Generalised Theory of Interface Automata, Component Compatibility and Error
• Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
• 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

This page was built for publication: A generalised theory of interface automata, component compatibility and error