Results 1  10
of
11
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 172 (26 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 for hybrid systems
 Theoretical Computer Science
, 2003
"... Abstract. We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, Chap. 4, 2002] and the process algebra with propositional signals from Baeten and ..."
Abstract

Cited by 41 (4 self)
 Add to MetaCart
(Show Context)
Abstract. We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, Chap. 4, 2002] and the process algebra with propositional signals from Baeten and
Discrete Time Process Algebra and the Semantics of SDL
 CWI REPORT SENR9809, CENTRE FOR MATHEMATICS AND COMPUTER SCIENCE
, 1998
"... ..."
Truth of duration calculus formulae in timed frames”,
 United Nations University, International Institute for Software Technology,
, 1996
"... Abstract. Duration calculus is a logical formalism designed for expressing and refining realtime requirements for systems. Timed frames are essentially transition systems meant for modeling the timedependent behaviour of programs. We investigate the interpretation of duration calculus formulae in ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
Abstract. Duration calculus is a logical formalism designed for expressing and refining realtime requirements for systems. Timed frames are essentially transition systems meant for modeling the timedependent behaviour of programs. We investigate the interpretation of duration calculus formulae in timed frames. We elaborate this topic from different angles and show that they agree with each other. The resulting interpretation is expected to make it generally easier to establish semantic links between duration calculus and formalisms aimed at programming. Such semantic links are prerequisites for a solid underpinning of approaches to system development that cover requirement capture through coding using both duration calculus and some formalism(s) aimed at programming.
A Logic for Signal Inserted Timed Frames
, 1996
"... We propose a firstorder predicate logic TFL of timed frames extended with signals. This logic combines a simple syntax with a high expressivity; it can distinguish frames that are not the same as sets of transitions and states. We show how Dicky logic and CTL can be embedded into TFL. 1 Introductio ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We propose a firstorder predicate logic TFL of timed frames extended with signals. This logic combines a simple syntax with a high expressivity; it can distinguish frames that are not the same as sets of transitions and states. We show how Dicky logic and CTL can be embedded into TFL. 1 Introduction In recent years, a multitude of process algebras have evolved. Bergstra and Ponse [9, 10] proposed to study basic properties of such process algebras on the level of frames, which are labelled, directed graphs. Essentially, frames are transition systems without explicit start and termination nodes. Frames can be converted into processes by means of process extraction, which means that two states are singled out, which represent the start state and the successful termination state respectively. Thus, the algebra of frames constitutes a common platform for the study of basic properties of process algebras. Most process algebras have been extended with special features, in order to enhance t...
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 ...
A Logic for Signal Inserted Timed Frames
"... We propose a rstorder predicate logic TFL of timed frames extended with signals. This logic combines a simple syntax with a high expressivity� it can distinguish frames that are not the same as sets of transitions and states. We showhowDicky logic and CTL can be embedded in TFL. 1 ..."
Abstract
 Add to MetaCart
(Show Context)
We propose a rstorder predicate logic TFL of timed frames extended with signals. This logic combines a simple syntax with a high expressivity� it can distinguish frames that are not the same as sets of transitions and states. We showhowDicky logic and CTL can be embedded in TFL. 1
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 algeb ..."
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...
Truth of Duration Calculus Formulae in Timed Frames
 Fundamenta Informaticae
, 1998
"... Duration calculus is a logical formalism designed for expressing and refining realtime requirements for systems. Timed frames are essentially transition systems meant for modeling the timedependent behaviour of programs. We investigate the interpretation of duration calculus formulae in timed fram ..."
Abstract
 Add to MetaCart
(Show Context)
Duration calculus is a logical formalism designed for expressing and refining realtime requirements for systems. Timed frames are essentially transition systems meant for modeling the timedependent behaviour of programs. We investigate the interpretation of duration calculus formulae in timed frames. We elaborate this topic from di#erent angles and show that they agree with each other. The resulting interpretation is expected to make it generally easier to establish semantic links between duration calculus and formalisms aimed at programming. Such semantic links are prerequisites for a solid underpinning of approaches to system development that cover requirement capture through coding using both duration calculus and some formalism(s) aimed at programming. 1991 Mathematics Subject Classification: 68Q55, 68Q60 1991 Computing Reviews Classification System: D.2.1, D.2.4, D.3.1, F.3.1, F.3.2 Keywords and Phrases: duration calculus, realtime requirements, timed frames, timedependent b...
Process Algebraic Underpinning of Communication and Timing in SDL
, 1996
"... A process algebra semantics of 'SDL was given in a previous paper. All behavioural aspects of SDL are covered by 'SDL, including the time related ones. Here process creation and delaying channels are left out from 'SDL to concentrate on the process algebraic underpinning of SDL's ..."
Abstract
 Add to MetaCart
A process algebra semantics of 'SDL was given in a previous paper. All behavioural aspects of SDL are covered by 'SDL, including the time related ones. Here process creation and delaying channels are left out from 'SDL to concentrate on the process algebraic underpinning of SDL's most distinctive features, viz. its communication and timing mechanisms. 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 N...