Abstract
We consider two generalizations of the duality between transition systems and Petri nets. In the first, transitions are replaced by paths, that is partial functions from a fixed set Δ to states. This allows to model continuous and/or hybrid systems when Δ represents durations. In the second generalization actions are considered to have a structure given by an algebra. This allows to model, for instance, sequential and parallel composition of ordinary actions. In each case the question of the existence of a Galois connection is considered in the framework of ordered sets and in the categorical setting.
Supported by programme CATALYSIS within CNRS/PAN cooperation framework.
Partially supported by State Committee for Scientific Research grant 8T11C03716
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Badouel, E., Splitting of Actions, Higher-Dimensional Automata and Net Synthesis. Inria-RR 3013 (1996)
Badouel, E., Darondeau, P. Dualities between Nets and Automata Induced by Schizophrenic Objects. Proc. Sixth Int. Conf. on CTCS, LNCS 953 (1995) 24–43
Badouel, E., Darondeau, P. Theory of Regions. Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, Reisig and Rozenberg eds., LNCS 1491 (1998) 529–586
David, R., Alla, H. Continuous Petri Nets. Proc. Eighth European Workshop on Applications and Theory of Petri Nets, Zaragoza (1987) 275–294
David, R., Alla, H., Modeling of Hybrid Systems Using Continuous and Hybrid Petri Nets. Proc. PNPM’97 (1997) 47–58
Davey, B.A., Priestley, H.A., Introduction to Lattices and Order, Cambridge University Press (1990).
Droste, M., Shortt, R.M., Petri Nets and Automata with Concurrency Relations-an Adjunction. Semantics of Programming Languages and Model Theory, Droste and Gurevitch eds. (1993) 69–87
Droste, M., Shortt, R.M., Continuous Petri Nets and Transition Systems. (in this volume)
Ehrenfeucht, A., Rozenberg, G., Partial 2-structures; Part I: Basic Notions and the Representation Problem;n Part II: State Spaces of Concurrent Systems. Acta Informatica, 27, 315–342 & 343–368 (1990)
Feuzeu, T., Synthèse de réseaux de Petri purs à partir de produits synchrones d’automates. Mémoire de fin d’’études, ENSP-Yaoundé (2000)
Isbell, J. R.. General Functorial Semantics, I. American Journal of Mathematics, vol. 94, pp.: 535–596, 1972.
Johnstone, P.T., Stone spaces. Cambridge University Press (1982).
Juhas, G., Reasoning about Algebraic Generalisation of Petri Nets. Proc. ATPN’99, LNCS 1639 (1999) 324–343
Meseguer, J., Montanari, U., Petri Nets are Monoids. Information and Computation, 88–2 (1990) 105–155
Mukund, M., Petri Nets and Step Transition Systems. IJFCS, 3–4 (1992) 443–478
Porst, H.E., Tholen, W., Concrete Dualities. Category Theory at Work, Herrlich and Porst eds., Heldermann-Verlag (1991) 11–136
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Badouel, E., Bednarczyk, M.A., Darondeau, P. (2001). Generalized Automata and Their Net Representations. In: Ehrig, H., Padberg, J., Juhás, G., Rozenberg, G. (eds) Unifying Petri Nets. Lecture Notes in Computer Science, vol 2128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45541-8_10
Download citation
DOI: https://doi.org/10.1007/3-540-45541-8_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43067-4
Online ISBN: 978-3-540-45541-7
eBook Packages: Springer Book Archive