Testing for unboundedness of fifo channels
- 24 May 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 113 (1) , 93-117
- https://doi.org/10.1016/0304-3975(93)90212-c
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Automated Protocol Validation in Argos: Assertion Proving and Scatter SearchingIEEE Transactions on Software Engineering, 1987
- Boundedness, empty channel detection, and synchronization for communicating finite automataTheoretical Computer Science, 1986
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Homomorphisms between models of parallel computationJournal of Computer and System Sciences, 1982
- Parallel program schemataJournal of Computer and System Sciences, 1969