Abstract
We consider models of distributed systems where processes communicate by means of point-to-point (unbounded) channels. The processes have a finite set of control states whose dynamics is given by a finite state automaton. They may sometimes have auxiliary storage like stacks. They may sometimes have variables storing values from an unbounded data domain. The channels may have access policies, like first-in first-out (queue). The channel may be assumed to be reliable or unreliable (lossy channel). The channels may be allowed to transmit only messages coming from a finite set, or may be allowed to transmit elements from an infinite set. The processes and the channels may be arranged in particular topologies, for example like a tree or a star. We view a topology as a node and edge labelled directed graph, where nodes represent the processes, and the directed edges represents the channels between them. The node labels describe the features of each process, and the edge label represents the assumptions on the channel. We consider local control state reachability on a single process. That is, given a distributed system over a topology, and a specific control state of a specific process, is it possible to ever reach a configuration where the specific process is in the specific control state. This problem is in general undecidable. We present a quick survey of the decidability status of this problem across different topologies.
Supported by DST Inspire.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abdulla, P.A., Aiswarya, C., Atig, M.F.: Data communicating processes with unreliable channels. In: Proceedings of LICS 2016, pp. 166–175. ACM (2016)
Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. 127(2), 91–101 (1996)
Aiswarya, C., Gastin, P., Narayan Kumar, K.: Verifying communicating multi-pushdown systems via split-width. In: Cassez, F., Raskin, J.-F. (eds.) ATVA 2014. LNCS, vol. 8837, pp. 1–17. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11936-6_1
Atig, M.F., Bouajjani, A., Touili, T.: On the reachability analysis of acyclic networks of pushdown systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 356–371. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85361-9_29
Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983)
Cardoza, E., Lipton, R., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups (preliminary report). In: Proceedings of STOC, pp. 50–54. ACM (1976)
Cécé, G., Finkel, A., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Inf. Comput. 124(1), 20–31 (1996)
Chambart, P.: Du Problème de sous-mot de Post et de la complexité des canaux non fiables. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France (2011). http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/chambart-these11.pdf
Chambart, P., Schnoebelen, P.: Mixing lossy and perfect fifo channels. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 340–355. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85361-9_28
Cyriac, A.: Verification of communicating recursive programs via split-width. Ph.D. thesis, Laboratoire Spécification et Vérification, ENS Cachan, France (2014). http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/cyriac-phd14.pdf
Cyriac, A., Gastin, P., Kumar, K.N.: MSO decidability of multi-pushdown systems via split-width. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 547–561. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32940-1_38
Karp, R.M., Miller, R.E.: Parallel program schemata: a mathematical model for parallel computation. In: 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), pp. 55–61 (1967)
La Torre, S., Madhusudan, P., Parlato, G.: Context-bounded analysis of concurrent queue systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 299–314. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78800-3_21
Lazić, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 301–320. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73094-1_19
Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: Ball, Th., Sagiv, M. (eds.) POPL 2011, pp. 283–294. ACM (2011)
Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoret. Comput. Sci. 6(2), 223–231 (1978)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Aiswarya, C. (2021). On Network Topologies and the Decidability of Reachability Problem. In: Georgiou, C., Majumdar, R. (eds) Networked Systems. NETYS 2020. Lecture Notes in Computer Science(), vol 12129. Springer, Cham. https://doi.org/10.1007/978-3-030-67087-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-67087-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-67086-3
Online ISBN: 978-3-030-67087-0
eBook Packages: Computer ScienceComputer Science (R0)