Verifying identical communicating processes is undecidable
- 15 March 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 174 (1-2) , 217-230
- https://doi.org/10.1016/s0304-3975(96)00026-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Decidability of the termination problem for completely specified protocolsDistributed Computing, 1994
- An introduction to FIFO nets— monogeneous nets: A subclass of FIFO netsTheoretical Computer Science, 1985
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Automates a fileTheoretical Computer Science, 1980