Results 1  10
of
14
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.
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 27 (3 self)
 Add to MetaCart
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
Testing Semantics for Probabilistic LOTOS
, 1995
"... In this paper we present a probabilistic extension of LOTOS which is upward compatible with LOTOS. We present testing semantics for the reactive and generative models described in [vGSST90]. While there is a certain lose of the meaning of probabilities in the reactive model, testing with probabilist ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
In this paper we present a probabilistic extension of LOTOS which is upward compatible with LOTOS. We present testing semantics for the reactive and generative models described in [vGSST90]. While there is a certain lose of the meaning of probabilities in the reactive model, testing with probabilistic tests proves to be too strong, because it does not relate behavior expressions which we expect to be equivalent. This is why we introduce the limited generative model, where tests are not allowed to have explicit probabilities. We give a fully abstract characterization for the reactive model, while we give alternative characterizations (based on a set of essential tests) for the generative and limited generative models. We also present some algebraic laws for each of the models, including some laws which establish the difference between the three models.
A Comparison of Additivity Axioms in Timed Transition Systems
, 1993
"... This paper discusses some axioms from the literature which have been used to define properties of timed transition systems. The additivity axiom proposed by (amongst others) Wang, and Nicollin and Sifakis is compared with the trajectory axiom of Lynch and Vaandrager. Some conditions for an additive ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
This paper discusses some axioms from the literature which have been used to define properties of timed transition systems. The additivity axiom proposed by (amongst others) Wang, and Nicollin and Sifakis is compared with the trajectory axiom of Lynch and Vaandrager. Some conditions for an additive transition system to be trajectoried are discussed. These are proved sufficient by using some simple terminology from category theory to show how this problem about timed transition systems can be turned into an equivalent problem about monotone functions on partially ordered sets. We also discuss trajectory (bi)simulation, which is a variant of HoStuart's path bisimulation, and use similar techniques to discuss when (bi)simulation is equivalent to trajectory (bi)simulation.
The Verus Language: Representing Time Efficiently with BDDs
 ELSEVIER SCIENCE
, 2001
"... There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the verification of industrial systems. One reason for this is that formal methods are still difficult to apply efficien ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the verification of industrial systems. One reason for this is that formal methods are still difficult to apply efficiently. Another reason is that current verification algorithms are still not efficient enough to handle many complex systems. This work addresses the problem by presenting a language designed especially to simplify writing timecritical programs. It is an imperative language with a syntax similar to C. Special constructs are provided to allow the straightforward expression of timing properties. The familiar syntax makes it easier for nonexperts to use the tool. The special constructs make it possible to model the timing characteristics of the system naturally and accurately. A symbolic representation using BDDs, model checking and quantitative algorithms are used to check system timing properties.
On Specifying RealTime Systems in a CausalityBased Setting
, 1996
"... . Event structures are a prominent noninterleaving model for concurrency. Realtime event structures associate a set of time instants to events, modelling absolute time constraints, and to causal dependencies, modelling relative delays between causally dependent events. We introduce this novel tempo ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
. Event structures are a prominent noninterleaving model for concurrency. Realtime event structures associate a set of time instants to events, modelling absolute time constraints, and to causal dependencies, modelling relative delays between causally dependent events. We introduce this novel temporal model and show how it can be used to provide a denotational semantics to a realtime variant of a process algebra akin to LOTOS. This formalism includes a timedaction prefix which constrains the occurrence time of actions, a timeout and watchdog (i.e., timed interrupt) operator. An eventbased operational semantics for this formalism is presented that is shown to be consistent with the denotational semantics. As an example we use an infinite buffer with time constraints on the message latency and the rates of accepting and producing data. 1 Introduction Timed extensions of interleaving models for concurrency have been investigated thoroughly in the last decade. Although there are many...
An Axiomatization for Regular Processes in Timed Branching Bisimulation
 Fundamenta Informaticae
, 1998
"... ion The previous section treated BPA ffir with recursion modulo timed strong bisimulation. In this section the alphabet is extended with a special constant ø , to obtain BPA ffiø r with recursion, and process terms are considered modulo rooted timed branching bisimulation. In the sequel, a and ff w ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
ion The previous section treated BPA ffir with recursion modulo timed strong bisimulation. In this section the alphabet is extended with a special constant ø , to obtain BPA ffiø r with recursion, and process terms are considered modulo rooted timed branching bisimulation. In the sequel, a and ff will represent elements from A [ føg and A [ fffi; øg, respectively. 3.1 Time Shift In order to define timed branching bisimulation, the syntax is extended with the time shift operator (r)p, which takes a rational number r and a process term p. The process term (r)p denotes the behaviour of p that is shifted r units in time. Its ultimate delay is defined by U((r)p) = maxfU(p) + r; 0g The transition rules and axioms for the time shift are given in Table 4. Using axioms TS14, this operator can be eliminated from all process terms. 3.2 Timed Branching Bisimulation The operational semantics consists of the transition rules in Table 1 and Table 2 and Table 4. The definition of timed strong...
Partial Order Models for Quantitative Extensions of LOTOS
, 1997
"... Event structures are a prominent model for noninterleaving concurrency. The use of event structures for providing a compositional noninterleaving semantics to LOTOS without data is studied. In particular, several quantitative extensions of event structures are proposed that incorporate notions lik ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Event structures are a prominent model for noninterleaving concurrency. The use of event structures for providing a compositional noninterleaving semantics to LOTOS without data is studied. In particular, several quantitative extensions of event structures are proposed that incorporate notions like timeboth of deterministic and stochastic natureand probability. The suitability of these models for giving a noninterleaving semantics to a timed, stochastic and probabilistic extension of LOTOS is investigated. Consistency between the event structure semantics and an (eventbased) operational semantics is addressed for the different quantitative variants of LOTOS and is worked out for the timed case in more detail. These consistency results facilitate the coherent use of an interleaving and a noninterleaving semantic view in a single design trajectory and provide a justification for the event structure semantics. As a running example an infinite buffer is used in which gradually t...
An Experiment with the LOTOS Formal Description Technique on the Flight Warning Computer of Airbus 330/340 Aircrafts
, 1993
"... This paper presents the main results of a twoyear study concerning the introduction of formal methods in the life cycle of avionics software. This study was done in the framework of the EUREKA European project AIMS (Aerospace Intelligent Management and development environment for embedded System ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper presents the main results of a twoyear study concerning the introduction of formal methods in the life cycle of avionics software. This study was done in the framework of the EUREKA European project AIMS (Aerospace Intelligent Management and development environment for embedded Systems). The ISO language Lotos was used to describe a significant subset of the Flight Warning Computer of Airbus 330/340 aircrafts, which is a typical representative of Embedded Computer Systems. Six Lotos descriptions were developed, (using both the abstract data types and the process algebra features of Lotos) which are probably among the largest algebraic specifications written today. The Caesar/Ald' ebaran toolset for Lotos was used to support the description and analysis process. The Lotos descriptions were automatically translated into executable prototypes, and then validated by means of simulation and testing. The paper presents the techniques used and the results obtained. It e...