Rewriting logic and Elan: Prototyping tools for Petri nets with time.

*(English)*Zbl 0986.68091
Colom, JosĂ©-Manuel (ed.) et al., Applications and theory of Petri nets 2001. 22nd international conference, ICATPN 2001, Newcastle upon Tyne, GB, June 25-29, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2075, 363-381 (2001).

Summary: 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 rapidly prototyping and analysing Petri nets with time. We link these algebraic tools to the existing Petri net tool PEP which we use to provide a user-friendly front end to our framework. 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 time Petri nets in which transitions are associated with a time interval within which they can fire. The flexibility of our approach is illustrated by modelling a range of semantic alternatives for time Petri nets taken from the literature.

For the entire collection see [Zbl 0967.00078].

For the entire collection see [Zbl 0967.00078].

##### MSC:

68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |