Decidability of the termination problem for completely specified protocols
- 1 March 1994
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 7 (3) , 129-135
- https://doi.org/10.1007/bf02277857
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The construction of self-synchronizing finite state protocolsDistributed Computing, 1987
- A generalization of the procedure of karp and miller to well structured transition systemsLecture Notes in Computer Science, 1987
- Boundedness, empty channel detection, and synchronization for communicating finite automataTheoretical Computer Science, 1986
- Synthesis of two-party error-recoverable protocolsPublished by Association for Computing Machinery (ACM) ,1986
- A discipline for constructing multiphase communication protocolsACM Transactions on Computer Systems, 1985
- Protocol Verification via ProjectionsIEEE Transactions on Software Engineering, 1984
- Synthesis of Communicating Finite-State Machines with Guaranteed ProgressIEEE Transactions on Communications, 1984
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Towards Analyzing and Synthesizing ProtocolsIEEE Transactions on Communications, 1980
- Ordering by Divisibility in Abstract AlgebrasProceedings of the London Mathematical Society, 1952