1997 | ReviewPaper | Chapter
Testing semantics for a probabilistic-timed process algebra
Authors : Carlos Gregorio-Rodríguez, Luis Llana-Díaz, Manuel Núñez, Pedro Palao-Gostanza
Published in: Transformation-Based Reactive Systems Development
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper we present a probabilistic-timed process algebra, which tries to unify the best solutions of previous probabilistic and timed algebras. We provide an operational semantics for the new language (PTPA), and from this operational semantics we define a testing semantics based on the probability with which processes pass tests. Afterwards the induced testing equivalence is operationally characterized by probabilistic timed traces.