Completeness in Discrete-Time Process Algebra (1995)
| Citations: | 5 - 3 self |
BibTeX
@TECHREPORT{Reniers95completenessin,
author = {Michel Reniers and Jan Joris Vereijken},
title = {Completeness in Discrete-Time Process Algebra},
institution = {},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We prove soundness and completeness for some ACP-style concrete, relative-time, discrete-time process algebras. We treat non-delayable actions, delayable actions, and immediate deadlock. Basic process algebras are examined extensively, and also some concurrent process algebras are considered. We conclude with ACP drt , which combines all described features in one theory. 1991 Mathematics Subject Classification: 68Q10, 68Q22, 68Q55. 1991 CR Categories: D.1.3, D.3.1, F.1.2, F.3.2. Keywords: ACP, process algebra, discrete time, relative time, elimination, soundness, completeness, BPA, BPA # , BPA - drt --#, BPA - drt --ID, BPA drt --ID, BPA - drt , BPA drt , PA - drt --ID, ACP - drt --ID, PA drt , ACP drt , RSP(USD). Note: The investigations of the first author were supported by Philips Research Laboratories Eindhoven, The Netherlands. The investigations of the second author were supported by the Netherlands Computer Science Research Foundation (SION) with financial support from the N...
