Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Communicating sequential processes
Communicating sequential processes
An operational semantics for occam
International Journal of Parallel Programming
Priorities in process algebras
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
The semantics of priority and fairness in OCCAM
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
A formal definition of priority in CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information and Computation
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Towards a Time Model for Circus
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Denotational Semantics for occam
Seminar on Concurrency, Carnegie-Mellon University
prialt in Handel-C: an operational semantics
International Journal on Software Tools for Technology Transfer (STTT) - Special section on formal methods for industrial critical systems
Modeling Heterogeneous Real-time Components in BIP
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
Priority and abstraction in process algebra
Information and Computation
Formal Aspects of Computing
The Denotational Semantics of slotted-Circus
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Slotted-circus: a UTP-family of reactive theories
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
| Hi-index | 0.00 |
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.