Journal of the ACM Bibliography
Daniel Brand and Pitro Zafiropulo. On
communicating finite-state machines. Journal of the ACM,
30(2):323-342, April 1983.
[BibTeX entry]
Selected papers that cite this one
- Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable
channels. Information and Computation, 127(2):91-101,
15 June 1996.
- Parosh Aziz Abdulla and Bengt Jonsson. Undecidable verification problems
for programs with unreliable channels. Information and
Computation, 130(1):71-90, 10 October 1996.
- Gérard Cécé, Alain Finkel, and S. Purushothaman
Iyer. Unreliable channels
are easier to verify than perfect channels. Information and
Computation, 124(1):20-31, 10 January 1996.
- Anatoli N. Chebotarev and Marina K. Morokhovets. Resolution-based
approach to computability analysis of interacting automata.
Theoretical Computer Science, 194(1-2):183-205, 10 March
1998.
- Alain Finkel and Pierre McKenzie. Verifying identical
communicating processes is undecidable. Theoretical Computer
Science, 174(1-2):217-230, 15 March 1997.
Shortcuts: