Abstract
Thereachability, deadlok detection andunboundedness detection problems are considered for the class ofcyclic one-type message networks of communicating finite state machines. We show that all the three problems are effectively solvable by (a) constructing canonical execution event sequences which belong to a context-free language, and (b) showing that the reachability sets are semilinear. Our algorithms have polynomial complexity in terms of size of a global structure of a network, called theshuffle-product. The relationships between general Petri nets and the class of communicating finite state machines considered here are also explored.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brand, D., Zafiropulo, P.: On communicating finite-state machines. JACM30(2), 323–342 (1983)
Cunha, P.R., Maibaum, T.: A synchronization calculus for message oriented programming. In Proceedings of II International Conference on Distributed Computing Systems. April 1981, pp. 433–445
Gouda, M., Gurari, E., Lai, T.-H., Rosier, L.E.: On deadlock detection in systems of communicating finite state machines. Comput. Artif. Intell.6(3), 209–228 (1987)
Hopcroft, J., Ullman, J.: Introduction to automata theory, languages and computation. Reading: Addison-Wesley 1979
Huynh, D.: The complexity of semi-linear sets. Elekron. Informationsverarb. Kybernet.18, 291–338 (1982)
Huynh, D.: The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems. STOC17, 405–412 (1985)
Landweber, L., Robertson, E.: Properties of conflict-free and persistant Petri nets. JACM25(3), 352–364 (1978)
Lipton, R.: The reachability problem requires exponential space. Research Report 62, Department of Computer Science, Yale University, January 1976
Pachl, J.: Reachability problems for CFSMs. Research Report CS-82-12, University of Waterloo, 1982
Peng, W., Purushothaman, S.: Data flow analysis of communicating finite state machines. ACM TOPLAS, July 1991
Räuchle, T., Toueg, S.: Exposure to deadlock for communicating processes is hard to detect. Inf. Process. Lett.21, 63–68 (1985)
Reisig, W.: Petri nets: An introduction. Berlin Heidelberg New York Springer 1982
Yu, Y.T., Gouda, M.G.: Deadlock detection for a class of communicating finite-state machines. IEEE Trans. Commun. COM-30(12), 2514–2518 (1982)
Yu, Y.T., Gouda, M.G.: Unboundedness detection for a class of communicating finite state machines. Inf. Process. Lett.17, 235–240 (1983)
Author information
Authors and Affiliations
Additional information
Supported in part by NSF CCR-9004121
Rights and permissions
About this article
Cite this article
Peng, W., Purushothaman, S. Analysis of a class of communicating finite state machines. Acta Informatica 29, 499–522 (1992). https://doi.org/10.1007/BF01185558
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01185558