Results 1 
4 of
4
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.
Discretetime Process Algebra and the Semantics of SDL
, 1997
"... We present an extension of discrete relative time process algebra where recursion, propositional signals, a counting process creation operator and the state operator are combined. A semantics of ' \Gamma SDL, a small subset of SDL that is closely connected with full SDL, is proposed which des ..."
Abstract
 Add to MetaCart
We present an extension of discrete relative time process algebra where recursion, propositional signals, a counting process creation operator and the state operator are combined. A semantics of ' \Gamma SDL, a small subset of SDL that is closely connected with full SDL, is proposed which describes the meaning of ' \Gamma SDL constructs using this extension of discrete relative time process algebra. This semantics allows for the generation of finitely branching transition systems for ' \Gamma SDL specifications. 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 algeb...
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
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...