An algebraic theory of interface automata

DOI10.1016/j.tcs.2014.07.018zbMath1360.68608OpenAlexW2143787859MaRDI QIDQ402131

Bengt Jonsson, Chris Chilton, Marta Kwiatkowska

Publication date: 27 August 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.07.018

zbMATH Keywords

synthesisinterfacescompositionalityrefinementspecification theorycomponent-based designsubstitutivity

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Combining Partial Specifications using Alternating Interface Automata, Theory and methodology of assumption/commitment based system interface specification and architectural contracts, A linear-time branching-time perspective on interface automata, A generalised theory of interface automata, component compatibility and error, Interface automata for shared memory, Trace- and failure-based semantics for responsiveness, Conditions of contracts for separating responsibilities in heterogeneous systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on fairness in I/O automata
• A process algebraic view of input/output automata
• Receptive process theory
• Conjunction on processes: Full abstraction via ready-tree semantics
• Ready simulation for concurrency: it's logical!
• A calculus of communicating systems
• Quiescence, fairness, testing, and the notion of implementation
• Interface synthesis and protocol conversion
• A Compositional Specification Theory for Component Behaviours
• A Modal Interface Theory for Component-based Design
• Learning I/O Automata
• A Theory of Communicating Sequential Processes
• Revisiting Timed Specification Theories: A Linear-Time Perspective
• Modal I/O Automata for Interface and Product Line Theories