Resources in process algebra

dc.contributor.authorLee, Insup
dc.contributor.authorSokolsky, Oleg
dc.contributor.authorPhilippou, Anna
dc.contributor.authorSokolsky, Oleg
dc.date2023-05-17T00:37:42.000
dc.date.accessioned2023-05-22T12:47:39Z
dc.date.available2023-05-22T12:47:39Z
dc.date.issued2007-01-07
dc.date.submitted2007-05-21T11:01:55-07:00
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.
dc.description.commentsPostprint version. Published in <em>Journal of Logic and Algebraic Programming</em>, Volume 72, Issue 1, May 2007, pages 98-122.<br> Publisher URL: http://dx.doi.org/10.1016/j.jlap.2007.02.005
dc.identifier.urihttps://repository.upenn.edu/handle/20.500.14332/6378
dc.legacy.articleid1358
dc.legacy.fulltexturlhttps://repository.upenn.edu/cgi/viewcontent.cgi?article=1358&amp;context=cis_papers&amp;unstamped=1
dc.source.issue337
dc.source.journalDepartmental Papers (CIS)
dc.source.peerreviewedtrue
dc.source.statuspublished
dc.subject.otherProcess algebra
dc.subject.otherreal-time systems
dc.subject.otherschedulability analysis
dc.subject.otherresource modeling
dc.titleResources in process algebra
dc.typeArticle
digcom.contributor.authorisAuthorOfPublication|email:lee@cis.upenn.edu|institution:University of Pennsylvania|Lee, Insup
digcom.contributor.authorPhilippou, Anna
digcom.contributor.authorisAuthorOfPublication|email:sokolsky@cis.upenn.edu|institution:University of Pennsylvania|Sokolsky, Oleg
digcom.identifiercis_papers/337
digcom.identifier.contextkey307454
digcom.identifier.submissionpathcis_papers/337
digcom.typearticle
dspace.entity.typePublication
relation.isAuthorOfPublication45a9eed5-3211-4c36-b40d-6394302dfdce
relation.isAuthorOfPublication35e1b18e-15fe-4438-be3b-84593f70a40a
relation.isAuthorOfPublication.latestForDiscovery45a9eed5-3211-4c36-b40d-6394302dfdce
upenn.schoolDepartmentCenterDepartmental Papers (CIS)
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
jlap_res.pdf
Size:
339.84 KB
Format:
Adobe Portable Document Format
Collection