A translation of TPALp into a class of timed-probabilistic Petri nets

TPALp is an algebraic language for the description of concurrent systems with capabilities to express timed and probabilistic behaviours, as well as urgent interactions. In this paper we present the main features of the language, its operational semantics, and a translation of TPALp terms into a particular class of timed-probabilistic Petri nets. The language includes a probabilistic choice operator, a timed prefix operator, and an urgent prefix operator, as well as some other operators that we may find in classical process algebras. An important feature of the language is that urgency is considered at any instant by executing as many urgent actions as possible, with the goal of complying in a great extent with the urgent actions indicated in the user specifications.

[1]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[2]  Rance Cleaveland,et al.  A Theory of Testing for Soft Real-Time Processes , 1996, SEKE.

[3]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

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

[5]  Jos C. M. Baeten,et al.  Process Algebra with Timing: Real Time and Discrete Time , 1999, Handbook of Process Algebra.

[6]  C. Gregorio-Rodríguez,et al.  Specifying and Verifying the Alternating Bit Protocol with Probabilistic-Timed LOTOS ∗ , 1996 .

[7]  Manuel Núñez,et al.  Algebraic theory of probabilistic processes , 2003, J. Log. Algebraic Methods Program..

[8]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

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

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

[11]  Suzana Andova,et al.  Time and Probability in Process Algebra , 2000, AMAST.

[12]  Mario Bravetti,et al.  Discrete time generative-reactive probabilistic processes with different advancing speeds , 2003, Theor. Comput. Sci..

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

[14]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

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

[16]  Kim G. Larsen,et al.  Bisimulation through probabilistic testing (preliminary report) , 1989, POPL '89.

[17]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..

[18]  H. S. ALLEN.  Time and Probability , 1938, Nature.

[19]  Ernst-Rüdiger Olderog,et al.  Nets, terms and formulas , 1991 .

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

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

[22]  David de Frutos-Escrig,et al.  TIC: A Timed Calculus for LOTOS , 1989, Formal Techniques for (Networked and) Distributed Systems.

[23]  Hans A. Hansson,et al.  Modeling Timeouts and Unreliable Media with a Timed Probabilistic Calculus , 1991, FORTE.

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

[25]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[26]  E.-R. Olderog,et al.  Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science) , 2005 .

[27]  Jos C. M. Baeten,et al.  Process Algebra with Timing , 2002, Monographs in Theoretical Computer Science. An EATCS Series.

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

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

[30]  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.

[31]  Valentín Valero Ruiz,et al.  TPAL: a timed-probabilistic model for concurrent processes , 1997, Proceedings of Joint 4th International Computer Science Conference and 4th Asia Pacific Software Engineering Conference.