Results 1 - 10
of
11
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
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 starting-point 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 33 (11 self)
- Add to MetaCart
We present real time and discrete time versions of ACP with absolute timing and relative timing. The starting-point 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.
IF: An Intermediate Representation for SDL and its Applications
, 1999
"... this paper we present work of a project for the improvement of a specification and validation toolbox interconnecting Objectgeode[1] and different validation tools such as ..."
Abstract
-
Cited by 20 (4 self)
- Add to MetaCart
this paper we present work of a project for the improvement of a specification and validation toolbox interconnecting Objectgeode[1] and different validation tools such as
IF: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems
, 1999
"... . Formal Description Techniques (fdt), such as lotos or sdl are at the base of a technology for the specification and the validation of telecommunication systems. Due to the availability of commercial tools, these formalisms are now being widely used in the industrial community. Alternatively, a ..."
Abstract
-
Cited by 15 (4 self)
- Add to MetaCart
. Formal Description Techniques (fdt), such as lotos or sdl are at the base of a technology for the specification and the validation of telecommunication systems. Due to the availability of commercial tools, these formalisms are now being widely used in the industrial community. Alternatively, a number of quite efficient verification tools have been developed by the research community. But, most of these tools are based on simple adhoc formalisms and the gap between them and real fdt restricts their use at industrial scale. This context motivated the development of an intermediate representation called if which is presented in the paper. if has a simple syntactic structure, but allows to express in a convenient way most useful concepts needed for the specification of timed asynchronous systems. The benefits of using if are multiples. First, it is general enough to handle significant subsets of most fdt, and in particular a translation from sdl to if is already implemented. ...
Splitting bisimulations and retrospective conditions
- Information and Computation
"... Abstract. We investigate conditions in the setting of the algebraic theory about processes known as ACP. We present ACP c, an extension of ACP with guarded commands, and its main models, called its full splitting bisimilation models. The conditions used in the guarded commands are taken from a Boole ..."
Abstract
-
Cited by 9 (7 self)
- Add to MetaCart
(Show Context)
Abstract. We investigate conditions in the setting of the algebraic theory about processes known as ACP. We present ACP c, an extension of ACP with guarded commands, and its main models, called its full splitting bisimilation models. The conditions used in the guarded commands are taken from a Boolean algebra. We add two operators for condition evaluation to ACP c; and study their connection with alternative mechanisms found in other extensions of ACP with guarded commands, to wit state operators and signal emission. On purpose to incorporate the past in conditions, we add a retrospection operator on conditions to ACP c.
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 real-time requirements for systems. Timed frames are essentially transition systems meant for modeling the time-dependent 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 real-time requirements for systems. Timed frames are essentially transition systems meant for modeling the time-dependent 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.
Process Algebra with Conditionals in the Presence of Epsilon
"... Abstract. In a previous paper, we presented several extensions of ACP with conditional expressions, including one with a retrospection operator on conditions to allow for looking back on conditions under which preceding actions have been performed. In this paper, we add a constant for a process that ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. In a previous paper, we presented several extensions of ACP with conditional expressions, including one with a retrospection operator on conditions to allow for looking back on conditions under which preceding actions have been performed. In this paper, we add a constant for a process that is only capable of terminating successfully to those extensions of ACP, which can be very useful in applications. It happens that in all cases the addition of this constant is unproblematic.
Truth of Duration Calculus Formulae in Timed Frames
- Fundamenta Informaticae
, 1998
"... Duration calculus is a logical formalism designed for expressing and refining real-time requirements for systems. Timed frames are essentially transition systems meant for modeling the time-dependent 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 real-time requirements for systems. Timed frames are essentially transition systems meant for modeling the time-dependent 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, real-time requirements, timed frames, time-dependent b...
Operated by Universities Space Research Association
, 1999
"... under Contract NAS 1-97046 Available from the following: ..."
(Show Context)
unknown title
, 2004
"... 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, Berlin, 2002, Chapter 4), and the process algebra with propositional signals from Baeten and Bergstra (Theoret. C ..."
Abstract
- Add to MetaCart
(Show Context)
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, Berlin, 2002, Chapter 4), and the process algebra with propositional signals from Baeten and Bergstra (Theoret. Comput. Sci. 177 (1977) 381–405). The proposed process algebra makes it possible to deal with the behaviour of hybrid systems, i.e. systems in which the instantaneous state transitions caused by performing actions are alternated with continuous state evolutions. This process algebra has, in addition to equational axioms, rules to derive equations with the help of real analysis.
