Abstract
Inside Synchrony Theory, this paper deals with a computation of structural synchronic invariants. It is based on the state equation of the place/transition (P/T) net and on Linear Programming theory. The approach is conceptually very simple, general and computationally very efficient. It is said to be a general approach in the sense that instead of single transitions, subsets of transitions are directly taken into account. Computationally it is very efficient because the linear programming problem is known to be of polynomial complexity. Two transition subsets are in a given synchronic relation if the corresponding synchronic invariant is bounded; for all conflict-resolution strategies, synchronic relations characterize the existence or non-existence of firing dependences. As a by-product of the proposed approach, a full algebraic characterization of structural synchronic relations (i.e. independent of the initial marking) is obtained.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
BERTHELOT G., ROUCAIROL G., VALK R.: Reductions of nets and parallel programs. In Net theory and Applications (Brauer W. ed.). LNCS 84, Springer-Verlag, pp 275–290.
BEST E., FERNANDEZ C.: Notations and Terminology on Petri Net Theory. Newsletter 20, May 1985, pp. 1–15.
CHVATAL V.: Linear Programming. W.H. Freeman an Company, New York.
DANTZIG G.B.: Linear Programming and extensions. Princeton University Press.
GENRICH H.J., LAUTENBACH K.: Synchronisationsgraphen. Acta Informatica vol.2, pp. 143–161.
GOLTZ U.: Synchronic Distance. In Petri Nets: Central Models and Their Properties. Advances in Petri Nets 1986, Proc. of an Advanced Course, Bad Honnef, September 1986. (G. Goos and J. Hartmanis ed.). LNCS 254, Springer Verlag, pp 338–358.
KARMARKAR N.: A new polynomial time algorithm for linear programming. Combinatorica, 4 (1984), pp 373–395.
LAUTENBACH K.: Liveness in Petri Nets, Internal report ISF 75-02.1, GMD, St. Augustin.
MARTINEZ J., SILVA M.: A simple and fast algorithm to obtain all invariants of a generalized Petri net. Applications and Theory of Petri Nets (C. Girault, W. Reisig, eds.). Informatik Fachberichte 52, Springer-Verlag.
MEMMI G., ROUCAIROL G.: Linear Algebra in Net Theory. In Net theory and Applications (Brauer W. ed.). LNCS 84, Springer-Verlag, pp 213–223.
PETRI C.A.: Interpretations of Net Theory. ISF — Report 75-07, GMD, St Augustin.
SAKAROVITCH M.: Optimisation Combinatoire. Méthodes Mathématiques et Algorithmiques. Hermann, Paris.
SILVA M.: Simpification des reseaux de Petri par elimination des places implicites. Digital Processes, vol. no 6, pp 245–256.
SILVA M.: Petri nets in automation and computer engineering. Ed. AC, Madrid (in Spanish). (English translation of a second edition to be published in 1988).
SILVA M.: Towards a Synchrony Theory for P/T Nets. Concurrency and nets, (K. Voss, H. Genrich, G. Rozenberg, eds.). Springer Verlag, Berlin. pp 435–460.
SUZUKI I., KASAMI T.: Three measures for synchronic dependence in Petri nets. Acta Informatica 19 (pp. 325–338).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Silva, M., Colom, J.M. (1988). On the computation of structural synchronic invariants in P/T nets. In: Rozenberg, G. (eds) Advances in Petri Nets 1988. APN 1987. Lecture Notes in Computer Science, vol 340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50580-6_39
Download citation
DOI: https://doi.org/10.1007/3-540-50580-6_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50580-8
Online ISBN: 978-3-540-46059-6
eBook Packages: Springer Book Archive