کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9657847 | 690111 | 2005 | 43 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A translation of TPALp into a class of timed-probabilistic Petri nets
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A translation of TPALp into a class of timed-probabilistic Petri nets A translation of TPALp into a class of timed-probabilistic Petri nets](/preview/png/9657847.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 338, Issues 1â3, 10 June 2005, Pages 350-392
Journal: Theoretical Computer Science - Volume 338, Issues 1â3, 10 June 2005, Pages 350-392
نویسندگان
Antonio Bueno, ValentÃn Valero, Fernando Cuartero,