Abstract
We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk’s forward-stable asynchronous systems describe the same class of regular event structures. This connection subsumes a previous study by Schmitt which relates Stark’s trace automata to asynchronous systems. This work relies on Zielonka’s theorem and some unrecognized result due to Arnold.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnold, A.: An extension of the notion of traces and asynchronous automata. RAIRO, Theoretical Informatics and Applications 25, 355–393 (1991) (Gauthiers-Villars)
Bednarczyk, M.A.: Categories of Asynchronous Systems. PhD thesis in Computer Science University of Sussex (1988)
Bracho, F., Droste, M., Kuske, D.: Representations of computations in concurrent automata by dependence orders. Theoretical Computer Science 174, 67–96 (1997)
Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)
Droste, M.: Concurrency, automata and domains. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 195–208. Springer, Heidelberg (1990)
Duboc, C.: Mixed product and asynchronous automata. Theoretical Computer Science 48, 183–199 (1986)
Husson J.-Fr.: Modelisation de la causalit´e par des relations d’independances. PhD thesis (Universit´e Paul Sabatier de Toulouse (1996)
Kuske, D.: Nondeterministic automata with concurrency relations and domains. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 202–217. Springer, Heidelberg (1994)
Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 279–324. Springer, Heidelberg (1987)
Mukund, M.: From global specifications to distributed implementations. In: Synthesis and Control of Discrete Event Systems, pp. 19–34. Kluwer, Dordrecht (2002)
Nielsen, M., Thiagarajan, P.S.: Regular event structures and finite petri nets: The conflict-free case. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol. 2360, pp. 335–351. Springer, Heidelberg (2002)
Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains I. Theoretical Computer Science 13, 86–108 (1980)
Sassone, V., Nielsen, M., Winskel, G.: Deterministic Behavioural Models for Concurrency (Extended Abstract). In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 682–692. Springer, Heidelberg (1993)
Schmitt, V.: Stable trace automata vs. full trace automata. Theoretical Computer Science 200, 45–100 (1998)
Stark, E.W.: Connections between a Concrete and an Abstract Model of Concurrent Systems. In: Schmidt, D.A., Main, M.G., Melton, A.C., Mislove, M.W. (eds.) MFPS 1989. LNCS, vol. 442, pp. 53–79. Springer, Heidelberg (1990)
Ştefănescu, A., Esparza, J., Muscholl, A.: Synthesis of distributed algorithms using asynchronous automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 20–34. Springer, Heidelberg (2003)
Szpilrajn, E.: Sur l’extension de l’ordre partiel. Fund. Math. 16, 386–389 (1930)
Thiagarajan, P.S.: Regular event structures and finite petri nets: A conjecture. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 244–256. Springer, Heidelberg (2002)
Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)
Zielonka, W.: Notes on finite asynchronous automata. RAIRO, Theoretical Informatics and Applications 21, 99–135 (Gauthiers-Villars 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
Morin, R. (2005). Concurrent Automata vs. Asynchronous Systems. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_59
Download citation
DOI: https://doi.org/10.1007/11549345_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28702-5
Online ISBN: 978-3-540-31867-5
eBook Packages: Computer ScienceComputer Science (R0)