Abstract
A method for the computation of (a regular expression for) the language of a safe net is presented. This method is based on net reductions as introduced by Berthelot, and it uses the net's trace language to rebuild the possible interleavings which can get lost during the reduction process. A set of reduction rules preserving the net language is proposed, i. e. in each reduction step, information about the net language is memorized. The result is a regular expression that may be used to decide properties of the net as e. g. mutual exclusion of transitions or possible markings of places.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
IJsbrand Jan Aalbersberg, Grzegorz Rozenberg: Theory of Traces; TCS 60, 1–82, 1988
Gérard Berthelot: Checking Properties of Nets Using Transformations; LNCS 222, 19–40, Springer 1986
Gérard Berthelot: Transformations and Decompositions of Nets; LNCS 254, 359–376, Springer 1987
Eike Best, César Fernández: Notations and Terminology on Petri Net Theory; Arbeitspapiere der GMD 195, Januar 1986
Eike Best, Hans Fleischhack, Hrsg.: Zwischenbericht des Projekts PEP; Hildesheimer Informatikberichte, Institut für Informatik, Universität Hildesheim 1995
Wilfried Brauer: Automatentheorie; Teubner 1984
Jörg Desel: Reduction and Design of Well-behaved Concurrent Systems; CONCUR '90, LNCS 458, 166–181, Springer 1990
Javier Esparza, Manuel Silva: Top-Down Synthesis of Live and Bounded Free Choice Nets; 11th International Conference on Application and Theory of Petri Nets, Paris 1990
Javier Esparza: Reduction and Synthesis of Live and Bounded Free Choice Petri Nets; Hildesheimer Informatikberichte, Institut für Informatik, Universität Hildesheim 1991
Anja Gronewold: Sprachanalyse durch Reduktion von Petri-Netzen; Diploma Thesis, Universität Oldenburg 1993
Anja Gronewold: Language Preserving Reductions of Free-Choice Nets; Paris 1995 (in progress)
Anja Gronewold, Hans Fleischhack: Language Preserving Reductions of Safe Petri-Nets; Berichte aus dem Fachbereich Informatik, Universität Oldenburg 1995
A. V. Kovalyov: On Complete Reducibility of Some Classes of Petri Nets; 11th International Conference on Application and Theory of Petri Nets, Paris 1990
Matthias Jantzen: Language Theory of Petri Nets; LNCS 254, 397–434, Springer 1986
Antoni Mazurkiewicz: Trace Theory; LNCS 255, 279–324, Springer 1987
Antoni Mazurkiewicz: Basic Notions of Trace Theory; Research and Education in Concurrent Systems, REX School/Workshop 1988
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gronewold, A., Fleischhack, H. (1995). Computing Petri net languages by reductions. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_57
Download citation
DOI: https://doi.org/10.1007/3-540-60249-6_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60249-1
Online ISBN: 978-3-540-44770-2
eBook Packages: Springer Book Archive