Toggle Main Menu Toggle Search

Open Access padlockePrints

Algebraic Prototyping Tools for Petri Nets with Time

Lookup NU author(s): Dr Jason Steggles

Downloads


Abstract

Rewriting logic (RL) is an extension of standard algebraic specification techniques which uses rewrite rules to model the dynamic behaviour of a system. In this paper we consider using RL and the associated support tool Elan as an environment for specifying, rapidly prototyping and analysing Petri nets with time. Our flexible approach allows the wide range of possible time extensions presented in the literature to be investigated and thus overcomes one of the major drawbacks of the current hardwired tools. We demonstrate our ideas by considering two different time extensions: time Petri nets in which transitions are associated with a firing interval and timed Petri nets in which a firing delay is associated with transitions. In each case we demonstrate the flexibility of our approach by examining a range of semantic choices detailed in the literature.


Publication metadata

Author(s): Steggles LJ

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2002

Pages: 28

Source Publication Date: 25-02-2002

Report Number: 722

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/722.pdf


Share