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 par...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2005-06, Vol.338 (1-3), p.350-392
Main Authors: BUENO, Antonio, VALERO, Valentin, CUARTERO, Fernando
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Language theory and syntactical analysis
Software
Software engineering
Theoretical computing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2005.02.009