Analysis of a class of communicating finite state machines
- 1 June 1992
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 29 (6-7) , 499-522
- https://doi.org/10.1007/bf01185558
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Data flow analysis of communicating finite state machinesACM Transactions on Programming Languages and Systems, 1991
- Exposure to deadlock for communicating processes is hard to detectInformation Processing Letters, 1985
- The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systemsPublished by Association for Computing Machinery (ACM) ,1985
- Unboundedness detection for a class of communicating finite-state machinesInformation Processing Letters, 1983
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Deadlock Detection for a Class of Communicating Finite State MachinesIEEE Transactions on Communications, 1982
- Properties of Conflict-Free and Persistent Petri NetsJournal of the ACM, 1978