For the most recent entries see the Petri Nets Newsletter.

An Algebra of Petri Nets with Arc-Based Time Restrictions.

Niaouris, Apostolos

In: Zhiming Liu, Keijiro Araki (Eds.): Lecture Notes in Computer Science, Vol. 3407: Theoretical Aspects of Computing - ICTAC 2004: First International Colloquium, Guiyang, China, September 20-24, 2004, pages 447-462. Springer-Verlag, 2005.

Abstract: In this paper we present two algebras, one based on term re-writing and the other on Petri nets, aimed at the specification and analysis of concurrent systems with timing information. The former is based on process expressions (at-expressions) and employs a set of SOS rules providing their operational semantics. The latter is based on a class of Petri nets with time restrictions associated with their arcs, called at-boxes, and the corresponding transition firing rule. We relate the two algebras through a compositionally defined mapping which for a given at-expression returns an at-box with behaviourally equivalent transition system. The resulting model, called the Arc Time Petri Box Calculus (atPBC), extends the existing approach of the Petri Box Calculus (PBC).

Keywords: Net-based algebraic calculi; arc based time Petri nets; process algebras; box algebra; SOS semantics.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography