Discrete time process algebra
- 1 March 1996
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 8 (2) , 188-208
- https://doi.org/10.1007/bf01214556
Abstract
The axiom system ACP of [BeK84a] was extended with real time features in [BaB91]. Here we proceed to define a discrete time extension of ACP, along the lines of ATP [NiS94]. We present versions based on relative timing and on absolute timing. Both approaches are integrated using parametric timing. The time free ACP theory is embedded in the discrete time theory.Keywords
This publication has 18 references indexed in Scilit:
- The discrete time toolbusPublished by Springer Nature ,1996
- A complete equational axiomatization for prefix iterationInformation Processing Letters, 1994
- On sequential composition, action prefixes and process prefixFormal Aspects of Computing, 1994
- Basic Process Algebra with Iteration: Completeness of its Equational AxiomsThe Computer Journal, 1994
- Process Algebra with Iteration and NestingThe Computer Journal, 1994
- Real space process algebraFormal Aspects of Computing, 1993
- Abstraction in real time process algebraPublished by Springer Nature ,1992
- Real time process algebraFormal Aspects of Computing, 1991
- Laws of programmingCommunications of the ACM, 1987
- CIRCAL and the representation of communication, concurrency, and timeACM Transactions on Programming Languages and Systems, 1985