A process algebra of communicating shared resources with dense time and priorities
Open Access
- 1 December 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 189 (1-2) , 179-219
- https://doi.org/10.1016/s0304-3975(96)00229-0
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Automata for modeling real-time systemsPublished by Springer Nature ,2005
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- Structural operational semantics for weak bisimulationsTheoretical Computer Science, 1995
- A really temporal logicJournal of the ACM, 1994
- Forward and backward simulations for timing-based systemsPublished by Springer Nature ,1992
- Real time process algebraFormal Aspects of Computing, 1991
- A complete axiomatisation for observational congruence of finite-state behavioursInformation and Computation, 1989
- Algebra of communicating processes with abstractionTheoretical Computer Science, 1985
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Communicating sequential processesCommunications of the ACM, 1978