Browse by author
Lookup NU author(s): Professor Maciej KoutnyORCiD
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
This paper presents two related algebras which can be used to specify and analyse concurrent systems with explicit timing information. The first algebra is based on process expressions, called t-expressions, and a system of SOS rules providing their operational semantics. The second algebra is based on a class of time Petri nets, called ct-boxes, and their transition firing rule. The two algebras are related through a mapping which, for a t-expression, returns a corresponding ct-box with behaviourally equivalent transition system. The resulting model, called the Time Petri Box Calculus (tPBC), extends the existing approach of the Petri Box Calculus (PBC).
Author(s): Koutny M
Editor(s): Nielsen, M., Simpson, D.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Application and Theory of Petri Nets 2000: 21st International Conference, ICATPN 2000
Year of Conference: 2000
Pages: 303-322
ISSN: 9783540676935
Publisher: Springer-Verlag
URL: http://dx.doi.org/10.1007/3-540-44988-4
DOI: 10.1007/3-540-44988-4
Series Title: Lecture Notes in Computer Science