Results 1 
3 of
3
Termination in Timed Process Algebra
 Formal Aspects of Computing
, 2000
"... We investigate different forms of termination in timed process algebras. The integrated framework of discrete and dense time, relative and absolute time process algebras is extended with forms of successful and unsuccessful termination. The different algebras are interrelated by embeddings and conse ..."
Abstract

Cited by 161 (25 self)
 Add to MetaCart
We investigate different forms of termination in timed process algebras. The integrated framework of discrete and dense time, relative and absolute time process algebras is extended with forms of successful and unsuccessful termination. The different algebras are interrelated by embeddings and conservative extensions.
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...
Completeness in DiscreteTime Process Algebra
, 1995
"... We prove soundness and completeness for some ACPstyle concrete, relativetime, discretetime process algebras. We treat nondelayable actions, delayable actions, and immediate deadlock. Basic process algebras are examined extensively, and also some concurrent process algebras are considered. We con ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
We prove soundness and completeness for some ACPstyle concrete, relativetime, discretetime process algebras. We treat nondelayable 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...