Petri nets: an introduction
Information and Computation
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Specification of abstract data types
Specification of abstract data types
ACM Computing Surveys (CSUR)
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
PEP - More than a Petri Net Tool
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Time Processes for Time Petri-Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
| Hi-index | 0.00 |
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.