Abstract
An automaton with concurrency relations A is a labeled transition system with a collection of binary relations indicating when two events in a given state of the automaton can happen independently from each other. The concurrency relations induce a natural equivalence relation for finite computation sequences. We investigate two graphtheoretic representations of the equivalence classes of computation sequences and obtain that under suitable assumptions on A they are isomorphic. Furthermore, the graphs are shown to carry a monoid operation reflecting precisely the composition of computations. This generalizes fundamental graph-theoretical representation results due to Mazurkiewicz in trace theory.
Research supported by the German Research Foundation (DFG)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aalbersberg, I.J. and G. Rozenberg: Theory of traces. Theor. Comp. Science 60 (1988), 1–82.
Bednarczyk, M.: Categories of asynchronous systems. Ph.D. thesis, University of Sussex, 1987.
Boudol, G. and I. Castellani: A non-interleaving semantics for CCS based on proved transitions. Fundam. Inform. 11 (1988), 433–452.
Börger, E. and D. Rosenzweig: Occam: Specification and compiler correctness. Part I: Simple mathematical interpreters. To appear.
Bracho, F. and M. Droste: From domains to automata with concurrency. In: 20th ICALP, LNCS 700, Springer, 1993, pp. 669–681.
Bracho, F. and M. Droste: Labelled domains and automata with concurrency. Theor. Comp. Science, in press.
Bracho, F., M. Droste and D. Kuske: Representation of computations in concurrent automata by dependence orders. Internal report of TU Dresden, MATH-AL-3-1994.
Birkhoff, G.: Lattice Theory. AMS, Providence, 1973.
Diekert, V.: Combinatorics on Traces. LNCS 454, Springer, 1990.
Droste, M.: Concurrency, automata and domains. In: 17th ICALP, LNCS 443, Springer, 1990, pp. 195–208.
Droste, M.: Concurrent automata and domains. Intern. J. of Found. of Comp. Science 3 (1992), 389–418.
Droste, M.: A Kleene theorem for recognizable languages over concurrency monoids. In: 21st ICALP, LNCS 820, Springer 1994, pp. 388–399. (Full version to appear in Theor. Comp. Science)
Droste, M.: Aperiodic languages over concurrency monoids. To appear.
Droste, M. and R.M. Shortt: Petri nets and automata with concurrency relations — an adjunction. In: Semantics of Programming Languages and Model Theory (M. Droste, Y. Gurevich, eds.), Gordon and Breach Science Publ., OPA (Amsterdam), 1993, 69–87.
Guaiana, G., A. Restivo and S. Salemi: Star-free trace languages. Theor. Comp. Science 97 (1992), 301–311.
Katz, S. and D. Peled: Defining conditional independence using collapses. In: Semantics for Concurrency (M.Z. Kwiatowska, M.W. Shields, R.M. Thomas, eds.), Proc. of the Int. BCS-FACS Workshop at Leicester, 1990, Springer, 262–280.
Kuske, D.: Modelle nebenläufiger Prozesse — Monoide, Residuensysteme und Automaten. Dissertation, Universität GHS Essen, 1994.
Kuske, D.: Nondeterministic automata with concurrency relations. Colloquium on Trees in Algebra and Programming, LNCS 787, Springer, 1994, 202–217.
Levy, J.J.: Réductions correctes et optimales dans le λ-calcul. Ph.D. Thesis, Université Paris VII, 1978.
Mazurkiewicz, A.: Concurrent program schemes and their interpretation. DAIMI Report PB-78, Aarhus University, Aarhus, 1977.
Mazurkiewicz, A.: Trace theory. In: Advanced Course on Petri Nets, LNCS 188, Springer, 1985, pp. 279–324.
Nielsen, M., G. Rosenberg and P.S. Thiagarajan: Elementary transition systems. Theor. Comp. Science 96 (1992), 3–33.
Ochmanski, E.: Regular behaviour of concurrent systems, Bull. Europ. Assoc. for Theoretical Computer Science 27 (1985), 56–67.
Panangaden, P., V. Shanbhogue and E.W. Stark: Stability and sequentiability in dataflow networks. In: 17th ICALP, LNCS 443, Springer, 1990, pp. 308–321.
Stark, E.W.: Connections between a concrete and an abstract model of concurrent systems. In: Proceedings of the 5th Conf. on the Mathematical Foundations of Programming Semantics, LNCS 389, Springer, 1989, pp. 52–74.
Winskel, G.: Event structures. In: Petri Nets: Applications and Relationships to Other Models of Concurrency (W. Brauer, W. Reisig, G. Rozenberg, eds.), LNCS 255, Springer, 1987, pp. 325–392.
Winskel, G. and M. Nielsen: Models for concurrency. In: Handbook of Logic in Computer Science (S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, eds.), to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bracho, F., Droste, M., Kuske, D. (1995). Dependence orders for computations of concurrent automata. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_97
Download citation
DOI: https://doi.org/10.1007/3-540-59042-0_97
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59042-2
Online ISBN: 978-3-540-49175-0
eBook Packages: Springer Book Archive