Abstract
Automata with concurrency relations are labelled transition systems with a collection of state-dependent binary independence relations for the actions. We show how to associate with each Petri net (place/transition net) such an automaton having the same dynamic behaviour. We characterize the automata arising in this way, and with suitable notions of morphisms for Petri nets and for automata with concurrency relations we extend this correspondence to a coreflection between the associated categories. As a consequence, we derive that these categories have products and conditional coproducts.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Droste, M.: Concurrent automata and domains, Intern. J. Found. Comp. Science 3 (1992), 389–418.
Katz, S. and Peled, D.: Defining conditional independence using collapses, Theor. Comp. Science 101 (1992), 337–359.
Godefroid, P. and Pirottin, D.: Refining dependencies improves partial-order verification methods, In: Proceedings of the 5th Conference on Computer Aided Verification, Lecture Notes in Computer Science Vol. 697, Springer, 1993, pp. 438–449.
Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems, Lecture Notes in Computer Science Vol. 1032, Springer, 1996.
Peled, D.: Ten years of partial order reduction, In: Proceedings of the 10th Conference on Computer Aided Verification, Lecture Notes in Computer Science Vol. 1427, Springer, 1998, pp. 17–28.
Bednarczyk, G.: Categories of Asynchronous Systems. Ph.D. Thesis, University of Sussex, 1987.
Shields, M. W.: Concurrent machines, Comp. J. 28 (1985), 449–465.
Stark, E. W.: Connections between a concrete and an abstract model of concurrent systems, In: Proceedings of the 5th Conference on the Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science Vol. 442, Springer, 1989, pp. 53–79.
Mazurkiewicz, A.: Trace theory, In: Advanced Course on Petri Nets, Lecture Notes in Computer Science, Springer, 1986, pp. 279–324.
Ehrenfeucht, A. and Rosenberg, G.: Partial 2-structures, Acta Inform. 27 (1990), 315–342 and 343-368.
Nielsen,M., Rosenberg, G. and Thiagarajan, P. S.: Elementary transition systems, Theor. Comp. Science 96 (1992), 3–33.
Badouel, E. and Darondeau, P.: Trace nets and process automata, Acta Inform. 32 (1995), 647–679.
Winskel, G. and Nielsen, M.: Models for concurrency, In: Handbook of Logic in Computer Science Vol. 4, S. Abramsky, D. M. Gabbay, T. S. E. Maibaum (eds), Oxford University Press, 1995.
Mukund, M.: Petri nets and step transition systems, Int. J. Found. Comp. Science 3 (1992), 443–478.
Droste, M. and Shortt, R. M.: 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, 1993, pp. 69–87.
Badouel, E. and Darondeau, P.: Theory of regions, In: Third Advanced Course on Petri Nets, Dagstuhl Castle, Lecture Notes in Computer Science Vol. 1279, Springer, 1998, pp. 529–586.
Droste, M.: Recognizable languages in concurrency monoids, Theor. Comp. Science 150 (1995), 77–109.
Droste, M.: Aperiodic languages over concurrency monoids, Inform. Comp. 126 (1996), 105–113.
Bracho, F., Droste, M. and Kuske, D.: Representation of computations in concurrent automata by dependence orders, Theor. Comp. Science 174 (1997), 67–96.
Droste, M. and Kuske, D.: On logical definability of languages in concurrency monoids, In: CSL '95, Lecture Notes in Comp. Science 1092, Springer, 1996, pp. 233–251.
Droste, M. and Shortt, R. M.: From Petri nets to automata with concurrency, Technical Report MATH-AL-9, Dresden, 1995.
Reisig, W.: Petri-Netze, Springer, 1986.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Droste, M., Shortt, R.M. From Petri Nets to Automata with Concurrency. Applied Categorical Structures 10, 173–191 (2002). https://doi.org/10.1023/A:1014305610452
Issue Date:
DOI: https://doi.org/10.1023/A:1014305610452