Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657847 | Theoretical Computer Science | 2005 | 43 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Antonio Bueno, ValentÃn Valero, Fernando Cuartero,