Abstract
The classical modelization of concurrent system behaviors is based on observing execution sequences of global states. This model is intuitively simple and enjoys a variety of mathematical tools, e.g. finite automata, helping verifying concurrent systems. On the other hand, parallel composition of local controllers are needed when dealing with the actual implementation of concurrent models. A well known tool for turning global observation into local controllers is Zielonka’s theorem, and its derivatives. We give here another algorithm, simpler and cheaper than Zielonka’s theorem, in the case where the events observed do not include communication but only local asynchronous actions. In a developer point of view, it means that she does not have to explicitly specify the messages needed, which will be added (if allowed) automatically by the implementation algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 797–808. Springer, Heidelberg (2001)
Bollig, B., Leucker, M.: Message-Passing Automata are expressively equivalent to EMSO Logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 146–160. Springer, Heidelberg (2004)
Baudru, N., Morin, R.: Safe implementability of regular message sequence chart specifications. In: SNPD 2003, pp. 210–217. ACIS (2003)
Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM 30(2), 323–342 (1983)
Caillaud, B., Darondeau, P., Hélouët, L., Lesventes, G.: HMSCs as partial specifications with PNs as completions. In: Modeling and Verification of Parallel Processes, 4th Summer School, MOVEP 2000, Nantes, France (2000)
Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)
Gastin, P., Lerman, B., Zeitoun, M.: Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 275–286. Springer, Heidelberg (2004)
Genest, B.: Compositional Message Sequence Charts (CMSCs) are better to Implement than MSCs. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 429–444. Springer, Heidelberg (2005)
Genest, B., Kuske, D., Muscholl, A.: A Kleene Theorem and Model Checking for a Class of Communicating Automata. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 30–48. Springer, Heidelberg (2004)
Gunter, E., Muscholl, A., Peled, D.: Compositional Message Sequence Charts. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 496–511. Springer, Heidelberg (2001); Journal version International Journal on Software Tools for Technology Transfer (STTT) 5(1), 78-89 (2003)
Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.: A Theory of Regular MSC Languages. To appear in Information and Computation, Available at http://www.comp.nus.edu.sg/~thiagu/public_papers/icregmsc.pdf
Kuske, D.: Regular sets of infinite message sequence charts. Information and Computation 187, 80–109 (2003)
Lohrey, M., Muscholl, A.: Bounded MSC communication. Information and Computation (189), 135–263 (2004)
Madhusudan, P., Meenakshi, B.: Beyond Message Sequence Graphs. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 256–267. Springer, Heidelberg (2001)
Madhusudan, P., Thiagarajan, P.S.: Distributed Controller Synthesis for Local Specifications. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 396–407. Springer, Heidelberg (2001)
Madhusudan, P., Thiagarajan, P.S.: A Decidable Class of Asynchronous Distributed Controllers. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 145–160. Springer, Heidelberg (2002)
Mohalik, S., Walukiewicz, I.: Distributed games. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 338–351. Springer, Heidelberg (2003)
Mukund, M., Narayan Kumar, K., Sohoni, M.: Synthesizing Distributed Finite-State Systems from MSCs. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 521–535. Springer, Heidelberg (2000)
Pnueli, A., Rosner, R.: Distributed Reactive Systems Are Hard to Synthesize. In: FOCS 1990, pp. 746–757 (1990)
Reif, J.H.: The Complexity of Two-player Games of Incomplete Information. J. Comp. Sys. Sci. 29, 274–301 (1984)
USB 1.1 specification, Available at http://www.usb.org/developers/docs/usbspec.zip
Zielonka, W.: Note on finite asynchronous automata, R.A.I.R.O. Informatique Théorique et Applications 21, 99–135 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Genest, B. (2005). On Implementation of Global Concurrent Systems with Local Asynchronous Controllers. In: Abadi, M., de Alfaro, L. (eds) CONCUR 2005 – Concurrency Theory. CONCUR 2005. Lecture Notes in Computer Science, vol 3653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539452_34
Download citation
DOI: https://doi.org/10.1007/11539452_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28309-6
Online ISBN: 978-3-540-31934-4
eBook Packages: Computer ScienceComputer Science (R0)