Results 1 
3 of
3
Discrete Time Process Algebra with Silent Step
, 2000
"... The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather than weak bisimulation semantics [11, 20]. The version using relative timing is discussed extensively, versions using absolu ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather than weak bisimulation semantics [11, 20]. The version using relative timing is discussed extensively, versions using absolute and parametric timing are presented in brief. A term model and a graph model are presented and soundness and completeness results are given. The time free theories BPA # and BPA # # are embedded in the discrete time theories. Examples of the use of the relative time theory are given by means of some calculations on communicating buffers. Note: Partial support received from ESPRIT Basic Research Action 7166, CONCUR2. This paper supersedes [4]. 1 Introduction Process algebra was introduced by Milner in the form of CCS [19]. The original design of CCS and of subsequent versions of process algebra such as ACP [10] and TCSP [14] involves no explicit notion of time. Time is present in the int...
Discrete Time Process Algebra and the Semantics of SDL
 CWI REPORT SENR9809, CENTRE FOR MATHEMATICS AND COMPUTER SCIENCE
, 1998
"... ..."
DiscreteTime Process Algebra with Empty Process
 Dat is dus heel interessant
, 1997
"... We introduce an ACPstyle discretetime process algebra with relative timing, that features the empty process. Extensions to this algebra are described, and ample attention is paid to the considerations and problems that arise when introducing the empty process. We prove time determinacy, soundness, ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We introduce an ACPstyle discretetime process algebra with relative timing, that features the empty process. Extensions to this algebra are described, and ample attention is paid to the considerations and problems that arise when introducing the empty process. We prove time determinacy, soundness, completeness, and the axioms of standard concurrency. 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 timing, empty process, time determinacy, soundness, completeness, axioms of standard concurrency, #,BPA  drt ID, BPA  drt,# ID, PA  drt,# ID, ACP  drt,# ID, BPA drt,# ID, PA drt,# ID, ACP drt,# ID, RSP(DEP). Note: The investigations of the second author were supported by the Netherlands Computer Science Research Foundation (SION) with financial support from the Netherlands Organization for Scientific Research (NWO). 3 Contents 1Introduction 5 1.1 Mo...