Show simple item record

dc.contributor.authorPhilippou, Annaen
dc.contributor.authorCleaveland, R.en
dc.contributor.authorLee, I.en
dc.contributor.authorSmolka, S.en
dc.contributor.authorSokolsky, O.en
dc.contributor.editorSangiorgi D.en
dc.contributor.editorde Simone R.en
dc.creatorPhilippou, Annaen
dc.creatorCleaveland, R.en
dc.creatorLee, I.en
dc.creatorSmolka, S.en
dc.creatorSokolsky, O.en
dc.date.accessioned2019-11-13T10:41:59Z
dc.date.available2019-11-13T10:41:59Z
dc.date.issued1998
dc.identifier.issn0302-9743
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/54838
dc.description.abstractPACSR, 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. © 1998, Springer Verlag. All rights reserved.en
dc.source9th International Conference on Concurrency Theory, CONCUR 1998en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84945974249&partnerID=40&md5=12407495098617a553d7ce4155982e42
dc.subjectAlgebraen
dc.subjectReal time systemsen
dc.subjectSpecificationsen
dc.subjectModel checkingen
dc.subjectInteractive computer systemsen
dc.subjectProbability of failureen
dc.subjectProbabilistic analysisen
dc.subjectHennessy-Milner Logicsen
dc.subjectModel checking algorithmen
dc.subjectProbabilistic constraintsen
dc.subjectProbabilistic extensionen
dc.subjectProbabilistic varianten
dc.subjectReal-time process algebraen
dc.titleProbabilistic resource failure in real-time process algebraen
dc.typeinfo:eu-repo/semantics/article
dc.description.volume1466
dc.description.startingpage389
dc.description.endingpage404
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeArticleen
dc.description.notes<p>Sponsors:en
dc.description.notesConference code: 143949en
dc.description.notesCited By :10</p>en
dc.source.abbreviationLect. Notes Comput. Sci.en


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record