@inproceedings{e174cc2020c44060a3c62e12bd9cd3c2,
title = "Probabilistic resource failure in real-time process algebra",
abstract = "PACSR, a probabilistic extension of the real-time process algebra ACSR, is presented. The extension is built upon a novel treatment of the notion of a resource. In ACSR, resources are used to model contention in accessing physical devices. Here, resources are invested with the ability to fail and are associated with a probability of failure. The resulting formalism allows one to perform probabilistic analysis of real-time system specifications in the presence of resource failures. A probabilistic variant of Hennessy-Milner logic with until is presented. The logic features an until operator which is parameterized by both a probabilistic constraint and a regular expression over observable actions. This style of parameterization allows the application of probabilistic constraints to complex execution fragments. A model-checking algorithm for the proposed logic is also given. Finally, PACSR and the logic are illustrated with a telecommunications example.",
author = "Anna Philippou and Rance Cleaveland and Insup Lee and Scott Smolka and Oleg Sokolsky",
note = "Publisher Copyright: {\textcopyright} 1998, Springer Verlag. All rights reserved.; 9th International Conference on Concurrency Theory, CONCUR 1998 ; Conference date: 08-09-1998 Through 11-09-1998",
year = "1998",
doi = "10.1007/bfb0055637",
language = "English",
isbn = "9783540648963",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "389--404",
editor = "Davide Sangiorgi and \{de Simone\}, Robert",
booktitle = "CONCUR 1998 Concurrency Theory - 9th International Conference, Proceedings",
}