Abstract
This talk is an informal presentation of ideas put forward by Badouel, Bernardinello, Caillaud and me for solving various types of P/T-net synthesis problems, with hints at the potential role of net synthesis in distributed software and distributed control. The ideas are theirs as much as mine. The lead is to start from Ehrenfeucht and Rozenberg’s axiomatic characterization of behaviours of elementary nets, based on regions, to adapt the characterization to P/T-nets in line with Mukund’s extended regions with integer values, and to profit from algebraic properties of graphs and languages for converting decision problems about regions to linear algebra.
This is a preview of subscription content, log in via an institution to check access.
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
Chernikova, N.V.: Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities. U.S.S.R. Computational Math. and Math. Physics 5 no.2 (1965) 228–233
Arnold, A., Nivat, M.: Comportements de processus. Les mathématiques de l’informatique, colloque AFCET (1982) 35–68
Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures; part I: Basic Notions and the Representation Problem. Acta Informatica 27 (1990) 315–342
Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures; part II: State Spaces of Concurrent Systems. Acta Informatica 27 (1990) 343–368
Mukund, M.: Petri Nets and Step Transition Systems. Int. Journal of Found. of Comp. Science 3 no.4 (1992) 443–478
Rudie, K., Wonham, W.M.: Think Globally, Act Locally: Decentralized Supervisory Control. IEEE Trans. on Automatic Control 37 no.11 (1992) 1692–1707
Droste, M., Shortt, R.M.: Petri Nets and Automata with Concurrency Relations-an Adjunction. Semantics of Programming Languages and Model Theory, M. Droste and Y. Gurevich eds (1993) 69–87
Badouel, E., Bernardinello, L., Darondeau, Ph.: Polynomial algorithms for the synthesis of bounded nets. Proc. CAAP, LNCS 915 (1995) 364–378
Jancar, P., Moeller, F.: Checking Regular Properties of Petri Nets, Proc. Concur, LNCS 962 (1995) 348–362
Badouel, E., Darondeau, Ph.: Dualities between nets and automata induced by schizophrenic objects. Proc. CTCS, LNCS 953 (1995) 24–43
Desel, J., Reisig, W.: The Synthesis Problem of Petri Nets. Acta Informatica 33 (1996) 297–315
Badouel, E., Darondeau, Ph.: Theory of regions. Lectures on Petri Nets I: Basic Models, LNCS 1491 (1998) 529–586
Bernardinello, L.: Propriétés algébriques et combinatoires des régions dans les graphes et leur application à la synthèse de réseaux. Thèse, Univ. Rennes (1998)
Darondeau, Ph.: Deriving Unbounded Petri Nets from Formal Languages. Proc. Concur, LNCS 1466 (1998) 533–548
Badouel, E.: Automates réversibles et réseaux de Petri, dualité et représentation: le problème de synthèse. Document d’habilitation 31, Irisa (1999) available from http://www.irisa.fr/EXTERNE/bibli/habilitations.html
Caillaud, B.: Bounded Petri-net Synthesis Techniques and their Applications to the Distribution of Reactive Automata. JESA 9–10 no.33 (to appear)
Darondeau, Ph.: On the Petri Net Realization of Context-Free Graphs. (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Darondeau, P. (2000). Region Based Synthesis of P/T-Nets and Its Potential Applications. In: Nielsen, M., Simpson, D. (eds) Application and Theory of Petri Nets 2000. ICATPN 2000. Lecture Notes in Computer Science, vol 1825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44988-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-44988-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67693-5
Online ISBN: 978-3-540-44988-1
eBook Packages: Springer Book Archive