C.A. Middelburg. Truth of duration calculus formulae in timed frames. Research Report 82, United Nations University, International Institute for Software Technology, September 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....its behaviour as a whole. However, it may be inconvenient or even impossible to express a property that covers only one detail of the behaviour of a process using an equation. Therefore, we are also studying logics for reasoning about processes expressed using discrete time process algebra (see [8, 9, 16]) ....

C.A. Middelburg. Truth of duration calculus formulae in timed frames. Research Report 82, United Nations University, International Institute for Software Technology, September 1996.

.... real time requirements, timed frames, time dependent behaviour, verification Note: The work presented in this paper has been largely carried out while the author was at UNU IIST (United Nations University, International Institute for Software Technology) Note: This paper is a revised version of [23]. 1. Introduction Duration calculus [18, 36] is an interval temporal logic intended for expressing real time requirements for systems and refining these requirements to specifications for one or more computer hardware and software components. Formalisms aimed at programming should subsequently be ....

C.A. Middelburg. Truth of duration calculus formulae in timed frames. Research Report 82, United Nations University, International Institute for Software Technology, September 1996. References 22

.... Gamma SDL and to adapt an existing model checker to Gamma SDL and this logic and thus to automate the checking. In particular, the model checker MEC [2] seems suited for this purpose at least for small scale systems. A fragment of Duration Calculus may be considered as well, since in [21] validity for Duration Calculus formulas in timed frames is defined. The extension of discrete time process algebra with relative timing, used to describe the meaning of the language constructs of Gamma SDL, is fairly large and rather intricate. Theoretically interesting general properties, ....

C.A. Middelburg. Truth of duration calculus formulae in timed frames. Research Report 82, United Nations University, International Institute for Software Technology, September 1996.

....as a logic for SDL and to adapt an existing model checker to SDL and this logic and thus to automate the checking. In particular, the model checker MEC [3] seems suited for this purpose at least for small scale systems. A fragment of Duration Calculus may be considered as well, since in [23] validity for Duration Calculus formulas in timed frames is de ned. The extension of discrete time process algebra with relative timing, used to describe the meaning of the language constructs of SDL, is fairly large and rather intricate. Theoretically interesting general properties, such as ....

C.A. Middelburg. Truth of duration calculus formulae in timed frames. Fundamenta Informaticae, 36:235-263, 1998.

.... calculus, real time requirements, timed frames, time dependent behaviour, verification The work presented in this paper has been largely carried out while the author was at UNU IIST (United Nations University, International Institute for Software Technology) This paper is a revised version of [23]. y Address for correspondence: Computing Science Department, Eindhoven University of Technology, P.O. Box 531, 5600 MB Eindhoven, the Netherlands 236 C.A. Middelburg Truth of Duration Calculus Formulae in Timed Frames 1. Introduction Duration calculus [18, 36] is an interval temporal logic ....

Middelburg, C.A.: "Truth of duration calculus formulae in timed frames", Research Report 82, United Nations University, International Institute for Software Technology, 1996.

....its behaviour as a whole. However, it may be inconvenient or even impossible to express a property that covers only one detail of the behaviour of a process using an equation. Therefore, we are also studying logics for reasoning about processes expressed using discrete time process algebra (see [8, 9, 16]) ....

C.A. Middelburg. Truth of duration calculus formulae in timed frames. Research Report 82, United Nations University, International Institute for Software Technology, September 1996.

....[20] how basic properties of frames can be expressed in TFL. Finally, we show how the modal logics Dicky logic [16] and CTL [13] which both make the theoretical basis for a model checker, can be translated into TFL. Hence, we obtain fragments of TFL where model checking is feasible. Recently, in [21], it was noticed that the duration calculus [23] cannot be embedded into TFL; in that paper a fragment of the duration calculus has been determined which can be related to TFL. Acknowledgements. Dennis Dams and Marco Hollenberg provided useful comments. 2 Timed Frames Logic 2.1 Timed Frames ....

C.A. Middelburg. Truth of duration calculus formulae in timed frames. Technical Report 82, United Nations University, International Institute for Software Technology, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC