An algebraic theory of interface automata
DOI10.1016/J.TCS.2014.07.018zbMATH Open1360.68608OpenAlexW2143787859MaRDI QIDQ402131FDOQ402131
Authors: Chris Chilton, Bengt Jonsson, 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
Recommendations
- Automated Technology for Verification and Analysis
- scientific article; zbMATH DE number 3250570
- scientific article; zbMATH DE number 3390671
- A generalised theory of interface automata, component compatibility and error
- A generalised theory of interface automata, component compatibility and error
- Algebraic structures of automata
- Automata algebras
- Automata and algebraicity
- scientific article; zbMATH DE number 871424
- Automata on algebraic structures
synthesisrefinementinterfacescompositionalityspecification theorycomponent-based designsubstitutivity
Specification and verification (program logics, model checking, etc.) (68Q60) Algebraic theory of languages and automata (68Q70)
Cites Work
- Title not available (Why is that?)
- A calculus of communicating systems
- Title not available (Why is that?)
- A Theory of Communicating Sequential Processes
- Title not available (Why is that?)
- Modal I/O Automata for Interface and Product Line Theories
- 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
- Title not available (Why is that?)
- Learning I/O automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Revisiting timed specification theories: a linear-time perspective
- Controllable delay-insensitive processes
- 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!
Cited In (29)
- Feedback in synchronous relational interfaces
- Trace- and failure-based semantics for responsiveness
- An interface model of software components
- Interface automata with complex actions: limiting interleaving in interface automata
- The algebraic structure of interfaces
- Moving from interface theories to assembly theories
- Richer interface automata with optimistic and pessimistic compatibility
- Combining partial specifications using alternating interface automata
- Conditions of contracts for separating responsibilities in heterogeneous systems
- Error-pruning in interface automata
- ACTL for modal interface automata
- Generalized interface automata with multicast synchronization
- A compositional specification theory for component behaviours
- Modal Interface Automata
- Modal interface automata
- A generalised theory of interface automata, component compatibility and error
- Title not available (Why is that?)
- Modal I/O Automata for Interface and Product Line Theories
- Interface automata for shared memory
- Fault-free refinements for interface automata
- An Algebraic Semantics for Contract-Based Software Components
- A linear-time branching-time perspective on interface automata
- Extending interface automata with Z notation
- Theory and methodology of assumption/commitment based system interface specification and architectural contracts
- Error-pruning in interface automata
- From interface automata to hypercontracts
- Relating alternating relations for conformance and refinement
- Interface automata for shared memory
- Component algebra
This page was built for publication: An algebraic theory of interface automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402131)
