In: Proceedings of the 11th International Conference on Application and Theory of Petri Nets, 1990, Paris, France, pages 471-490. 1990.
Also in: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 524; Advances in Petri Nets 1991, pages 1-28. Berlin, Germany: Springer-Verlag, 1991.
Abstract: Synchronized Elementary Net Systems are a model for systems consisting of events, conditions and subjected to generalized timing constraints. The constraints are quantified and are relative to some ``reference events'' such as clock ticks, meters, (multiform time). The partial ordering of event occurrences can be altered by ``timing'' constraints which induce additional precedences. This paper provides algoritms which compute delays beweeen event occurrences., The ``dioid'' algebraic structure is the underlying mathematical model. Applications of delays to some reachability problems are given.
Keywords: delays (in) synchronized elementary net systems; multiform time; timing constraint; dioid (algebraic structure); reachability problem.