Results 1 
8 of
8
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 155 (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.
Process algebra with timing: real time and discrete time
 Smolka (Eds.), Handbook of Process Algebra
, 2001
"... We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint isanewrealtimeversion with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete time ve ..."
Abstract

Cited by 27 (10 self)
 Add to MetaCart
We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint isanewrealtimeversion with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete time versions of ACP being known as ACP dat and ACP drt. The principal version is an extension of ACP sat with integration and initial abstraction to allow for choices over an interval of time and relative timing to be expressed. Its main virtue is that it generalizes ACP without timing and most other versions of ACP with timing in a smooth and natural way. This is shown for the real time version with relative timing and the discrete time version with absolute timing.
Truth of Duration Calculus Formulae in Timed Frames
 Fundamenta Informaticae
, 1996
"... The truth of duration calculus formulae in timed frames is studied. This issue is relevant to the problem of verifying whether the implementation of a software system obeys certain realtime requirements expressed for it. Two approaches are presented and related: (1) extracting interpretations of st ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
The truth of duration calculus formulae in timed frames is studied. This issue is relevant to the problem of verifying whether the implementation of a software system obeys certain realtime requirements expressed for it. Two approaches are presented and related: (1) extracting interpretations of state variables from paths in frames, and (2) relating duration calculus formulae directly to paths in frames. The embedding of duration calculus into a classical firstorder logic for timed frames is considered as well. Kees Middelburg is a Senior Research Fellow at UNU/IIST. He is on a two year leave (19961997) from KPN Research and Utrecht University, the Netherlands, where he is a Senior Computer Scientist and a Professor of Applied Logic, respectively. His research interest is in formal techniques for the development of software for reactive and distributed systems, including related subjects such as semantics of specification languages and concurrency theory. Email: cam@iist.unu.edu...
Reniers. Timed process algebra (with a focus on explicit termination and relativetiming
 Proceedings of the International School on Formal Methods for the Design of RealTime Systems (SFMRTâ€™04), volume 3185 of Lecture Notes in Computer Science
, 2004
"... Abstract. We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other variants. We concentrate on relative timing, but the treatment of absolute timing is similar. We treat both discr ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other variants. We concentrate on relative timing, but the treatment of absolute timing is similar. We treat both discrete and dense timing. We build up the theory incrementally. The different algebras are interrelated by embeddings and conservative extensions. As an example, we consider the PAR communication protocol. 1
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...
Time and Probability in Process Algebra
 PROCEEDINGS OF AMAST 2000, VOLUME 1816 OF LNCS
, 2000
"... In the paper we present an ACPlike process algebra which can be used to model both probabilistic and time behaviour of parallel systems. This process algebra is obtained by extension of untimed probabilistic process algebra with constructors that allow the explicit specification of timing aspec ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In the paper we present an ACPlike process algebra which can be used to model both probabilistic and time behaviour of parallel systems. This process algebra is obtained by extension of untimed probabilistic process algebra with constructors that allow the explicit specification of timing aspects. In this paper we concentrate on giving axioms and deduction rules for these constructors. We give two probabilistic process algebras with discrete time. The first one only manipulates with processes that may be initialized within the current time slice or may delay a finite and fixed number of time slices. Later, we add processes whose execution can be postponed for an arbitrary number of time slices.
Timed Frame Models for Discrete Time Process Algebras
, 1997
"... A model for discrete time process algebra with relative timing is given by defining an interpretation of the constants and operators on timed frames. It is shown that the model which is obtained is isomorphic with a graph model for the same algebra. Jan Bergstra is a Professor of Programming and So ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A model for discrete time process algebra with relative timing is given by defining an interpretation of the constants and operators on timed frames. It is shown that the model which is obtained is isomorphic with a graph model for the same algebra. Jan Bergstra is a Professor of Programming and Software Engineering at the University of Amsterdam and a Professor of Applied Logic at Utrecht University, both in the Netherlands. His research interest is in mathematical aspects of software and system development, in particular in the design of algebras that can contribute to a better understanding of the relevant issues at a conceptual level. He is perhaps best known for his contributions to the field of process algebra. Email: janb@fwi.uva.nl Kees Middelburg is a Senior Research Fellow at UNU/IIST. He is on a two year leave (19961997) from KPN Research and Utrecht University, the Netherlands, where he is a Senior Computer Scientist and a Professor of Applied Logic, respectively. His ...
Timed Frame Models for Discrete Time Process Algebras
, 1997
"... A model for discrete time process algebra with relative timing is given by defining an interpretation of the constants and operators on timed frames. It is shown that the model which is obtained is isomorphic with a graph model for the same algebra. Keywords & Phrases: discrete time, frame algebra, ..."
Abstract
 Add to MetaCart
A model for discrete time process algebra with relative timing is given by defining an interpretation of the constants and operators on timed frames. It is shown that the model which is obtained is isomorphic with a graph model for the same algebra. Keywords & Phrases: discrete time, frame algebra, process algebra, relative timing, timed frames. Jan Bergstra is a Professor of Programming and Software Engineering at the University of Amsterdam and a Professor of Applied Logic at Utrecht University, both in the Netherlands. His research interest is in mathematical aspects of software and system development, in particular in the design of algebras that can contribute to a better understanding of the relevant issues at a conceptual level. He is perhaps best known for his contributions to the field of process algebra. Email: janb@fwi.uva.nl Kees Middelburg is a Senior Research Fellow at UNU/IIST. He is on a two year leave (19961997) from KPN Research and Utrecht University, the Netherl...