Translating TPAL Specifications into Timed-Arc Petri Nets

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.

[1]  A. W. Roscoe,et al.  Metric Spaces as Models for Real-Time Concurrency , 1987, MFPS.

[2]  David de Frutos-Escrig,et al.  On non-decidability of reachability for timed-arc Petri nets , 1999, PNPM.

[3]  Tommaso Bolognesi,et al.  From timed Petri nets to timed LOTOS , 1990, PSTV.

[4]  Philip Meir Merlin,et al.  A study of the recoverability of computing systems. , 1974 .

[5]  Andrea Maggiolo-Schettini,et al.  Time-Based Expressivity of Time Petri Nets for System Specification , 1999, Theor. Comput. Sci..

[6]  David de Frutos-Escrig,et al.  Decidability of the strict reachability problem for TPN's with rational and real durations , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

[7]  Joseph Sifakis,et al.  Use of Petri nets for performance evaluation , 1977, Acta Cybern..

[8]  David de Frutos-Escrig,et al.  Decidability of Properties of Timed-Arc Petri Nets , 2000, ICATPN.

[9]  Valentín Valero Ruiz,et al.  Automatic translation of a timed process algebra into dynamic state graphs , 2001, Proceedings Eighth Asia-Pacific Software Engineering Conference.

[10]  Wolfgang Reisig,et al.  Application and Theory of Petri Nets , 1982, Informatik-Fachberichte.

[11]  Ursula Goltz.  On Representing CCS Programs by Finite Petri Nets , 1988, MFCS.

[12]  Grzegorz Rozenberg.  Advances in Petri Nets 1992 , 1992, Lecture Notes in Computer Science.

[13]  Raymond R. Devillers,et al.  The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

[14]  Marco Ajmone Marsan,et al.  On Petri Nets with Stochastic Timing , 1985, PNPM.

[15]  Dirk Taubner,et al.  Finite Representations of CCS and TCSP Programs by Automata and Petri Nets , 1989, Lecture Notes in Computer Science.

[16]  Hans-Michael Hanisch.  Analysis of Place/Transition Nets with Timed Arcs and its Application to Batch Process Control , 1993, Application and Theory of Petri Nets.

[17]  Wil M. P. van der Aalst.  Interval Timed Coloured Petri Nets and their Analysis , 1993, Application and Theory of Petri Nets.

[18]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[19]  Parosh Aziz Abdulla,et al.  Timed Petri Nets and BQOs , 2001, ICATPN.

[20]  Yi Wang.  A calculus of real time systems , 1991 .

[21]  Frank S. Beckman.  Mathematical foundations of programming , 1980 .