Finite representations of CCS and TCSP programs by automata and Petri nets
Finite representations of CCS and TCSP programs by automata and Petri nets
Time-based expressivity of timed Petri nets for system specification
Theoretical Computer Science
On Representing CCS Programs by Finite Petri Nets
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Metric Spaces as Models for Real-Time Concurrency
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
From timed Petri nets to timed LOTOS
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
On Petri Nets with Stochastic Timing
International Workshop on Timed Petri Nets
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
Analysis of Place/Transition Nets with Timed Arcs and its Application to Batch Process Control
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Interval Timed Coloured Petri Nets and their Analysis
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
On Non-Decidability of Reachability for Timed-Arc Petri Nets
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Automatic Translation of a Timed Process Algebra into Dynamic State Graphs
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
Decidability of properties of timed-arc Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
TAPAAL 2.0: integrated development environment for timed-arc petri nets
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
It is well known that Petri nets are a very suitable model for the description and analysis of concurrent systems, and several timed extensions of PNs have been defined to specify the behaviour of systems including time restrictions. But some software designers still find it a little difficult to work directly with Petri nets, specially when dealing with large systems, and they prefer to work with a formalism closer to a programming language, such as algebraic specification languages. Our goal, then, in this paper is to present an automatic translation of specifications written in a (timed) algebraic language (TPAL) into a timed model of Petri nets (Timed-Arc Petri nets). In this task we try to exploit as far as possible the special characteristics of Timed-Arc Petri nets, more specifically the presence of dead tokens, which allows us to extend in some particular cases the classical translations.