University of Limerick Institutional Repository

Prioritized slotted-Circus

DSpace Repository

Show simple item record Gancarski, Pawel Butterfield, Andrew 2011-02-02T13:47:18Z 2011-02-02T13:47:18Z 2010
dc.description peer-reviewed en_US
dc.description.abstract This paper describes an extension adding priority to slotted-Circus, a generic framework for reasoning about discretely timed and/or synchronously clocked systems. The semantics of prioritised external choice is given using the Unifying Theories of Programming framework (UTP). The resulting language is similar to Prioritized Timed CSP, but its semantics is not based on trace ordering, and neither does it use the notion of acceptances (e.g. PCSP). Instead, the semantics is based on the notion of refusal sets already widely used in theories of CSP, Circus and slotted-Circus. We introduce priority as a lightweight extension of slotted-Circus, which can be easily adapted to define a similar extension of Timed CSP. We also discuss why priority can most easily be added to specific history models, and the fact that requiring the clock to tick after every communication event results in a more tractable theory. ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing Pages 91-105 DOI: en_US
dc.language.iso eng en_US
dc.publisher Springer-Verlag en_US
dc.relation.ispartofseries ICTAC'10 Proceedings of the 7th International Colloquium Conference on Theoretical Aspects of Computing;6255,2010/ pp. 91-105
dc.subject clocked systems en_US
dc.title Prioritized slotted-Circus en_US
dc.type Conference item en_US
dc.type.supercollection all_ul_research en_US
dc.type.supercollection ul_published_reviewed en_US
dc.type.restriction none en
dc.contributor.sponsor SFI
dc.relation.projectid 07-RFP-CMSF-186

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ULIR


My Account