Process-Algebraic Analysis of Timing and Schedulability Properties

Simple item page
dc.contributor.authorSokolsky, Oleg
dc.contributor.authorSokolsky, Oleg
dc.date2023-05-17T01:55:39.000
dc.date.accessioned2023-05-22T12:47:49Z
dc.date.available2023-05-22T12:47:49Z
dc.date.issued2006-09-19
dc.date.submitted2008-01-24T11:02:51-08:00
dc.description.abstractIn this chapter, we present an overview of how timing information can be embedded in process-algebraic frameworks. We concentrate on the case of discrete-time modeling. We begin by discussing design approaches that have been adopted in different formalisms to model time and time passage, and how the resulting mechanisms interact with one another and with standard untimed process-algebraic operators. We proceed to give an overview of ACSR, a timed process algebra developed for modeling and reasoning about timed, resource-constrained systems. In doing this, ACSR adopts the notion of a resource as a first-class entity, and it replaces maximal progress, employed by other timed process algebras, by the notion of resource-constrained progress. ACSR associates resource-usage with time passage, and implements appropriate semantic rules to ensure that progress in the system is enforced as far as possible while simultaneous usage of a resource by distinct processes is excluded. In addition, ACSR employs the notion of priorities to arbitrate access to resources by competing processes. Finally, we illustrate the use of ACSR for the schedulability analysis of a realistic real-time system problem.
dc.description.commentsReprinted from <em>Handbook of Real-Time and Embedded Systems</em>, edited by Insup Lee, Joseph Y-T Leung, and Sang Son (Boca Raton: Chapman and Hall/CRC, 2007).
dc.identifier.urihttps://repository.upenn.edu/handle/20.500.14332/6399
dc.legacy.articleid1382
dc.legacy.fulltexturlhttps://repository.upenn.edu/cgi/viewcontent.cgi?article=1382&amp;context=cis_papers&amp;unstamped=1
dc.source.issue357
dc.source.journalDepartmental Papers (CIS)
dc.source.peerreviewedtrue
dc.source.statuspublished
dc.titleProcess-Algebraic Analysis of Timing and Schedulability Properties
dc.typeBook Chapter
digcom.contributor.authorPhilippou, Anna
digcom.contributor.authorisAuthorOfPublication|email:sokolsky@cis.upenn.edu|institution:University of Pennsylvania|Sokolsky, Oleg
digcom.identifiercis_papers/357
digcom.identifier.contextkey417416
digcom.identifier.submissionpathcis_papers/357
digcom.typechapter
dspace.entity.typePublication
relation.isAuthorOfPublication35e1b18e-15fe-4438-be3b-84593f70a40a
relation.isAuthorOfPublication.latestForDiscovery35e1b18e-15fe-4438-be3b-84593f70a40a
upenn.schoolDepartmentCenterDepartmental Papers (CIS)
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
rtpa.pdf
Size:
291.75 KB
Format:
Adobe Portable Document Format
Download
Collection
Book Chapters