Toggle Main Menu Toggle Search

Open Access padlockePrints

An algebra of Petri nets with arc-based time restrictions

Lookup NU author(s): Dr Apostolos Niaouris

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


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).


Publication metadata

Author(s): Niaouris A

Editor(s): Liu, Z., Araki, K.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Theoretical Aspects of Computing: First International Colloquium (ICTAC)

Year of Conference: 2005

Pages: 447-462

ISSN: 0302-9743 (Print) 1611-3349 (Online)

Publisher: Springer

URL: http://dx.doi.org/10.1007/978-3-540-31862-0_32

DOI: 10.1007/978-3-540-31862-0_32

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783540253044


Share