Show simple item record

dc.contributor.authorLee, I.en
dc.contributor.authorPhilippou, Annaen
dc.contributor.authorSokolsky, O.en
dc.creatorLee, I.en
dc.creatorPhilippou, Annaen
dc.creatorSokolsky, O.en
dc.date.accessioned2019-11-13T10:40:56Z
dc.date.available2019-11-13T10:40:56Z
dc.date.issued2007
dc.identifier.issn1567-8326
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/54370
dc.description.abstractThe Algebra of Communicating Shared Resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the timing behavior of a real-time system depends not only on delays due to process synchronization, but also on the availability of shared resources. Thus, ACSR employs resources as a basic primitive and it represents a real-time system as a collection of concurrent processes which may communicate with each other by means of instantaneous events and compete for the usage of shared resources. Resources are used to model physical devices such as processors, memory modules, communication links, or any other reusable resource of limited capacity. Additionally, they provide a convenient abstraction mechanism for capturing a variety of aspects of system behavior. In this paper we give an overview of ACSR and its probabilistic extension, PACSR, where resources can fail with associated failure probabilities. We present associated analysis techniques for performing qualitative analysis (such as schedulability analysis) and quantitative analysis (such as resource utilization analysis) of process-algebraic descriptions. We also discuss mappings between probabilistic and non-probabilistic models, which allow us to use analysis techniques from one algebra on models from the other. © 2007 Elsevier Inc. All rights reserved.en
dc.sourceJournal of Logic and Algebraic Programmingen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-34248573296&doi=10.1016%2fj.jlap.2007.02.005&partnerID=40&md5=f6a71cae533094f27a3e100d89f924b0
dc.subjectAlgebraen
dc.subjectReal time systemsen
dc.subjectProbabilistic logicsen
dc.subjectSynchronizationen
dc.subjectTelecommunication linksen
dc.subjectReal-time systemsen
dc.subjectData storage equipmenten
dc.subjectProgram processorsen
dc.subjectAlgebra of Communicating Shared Resources (ACSR)en
dc.subjectMemory modulesen
dc.subjectProcess algebraen
dc.subjectResource modelingen
dc.subjectSchedulability analysisen
dc.titleResources in process algebraen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1016/j.jlap.2007.02.005
dc.description.volume72
dc.description.issue1
dc.description.startingpage98
dc.description.endingpage122
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeArticleen
dc.source.abbreviationJ.Logic.Algebraic Program.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