An algebraic theory of interface automata
- 1 September 2014
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 549, 146-174
Abstract
No abstract availableKeywords
Funding Information
- EU FP7 (231167)
- ERC (VERIWARE)
This publication has 13 references indexed in Scilit:
- Ready simulation for concurrency: It’s logical!Information and Computation, 2010
- Residual for Component SpecificationsElectronic Notes in Theoretical Computer Science, 2008
- Conjunction on processes: Full abstraction via ready-tree semanticsTheoretical Computer Science, 2007
- Interface automataACM SIGSOFT Software Engineering Notes, 2001
- Quiescence, Fairness, Testing, and the Notion of ImplementationInformation and Computation, 1997
- A note on fairness in I/O automataInformation Processing Letters, 1996
- A process algebraic view of input/output automataTheoretical Computer Science, 1995
- Compositional specification and verification of distributed systemsACM Transactions on Programming Languages and Systems, 1994
- Receptive process theoryActa Informatica, 1992
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984