A.S. Klusener, Models and axioms for a fragment of real time process algebra, Ph.D. thesis, Eindhoven University of Technology, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....can perform an # transition to # for any n N (cf. 15] Clearly, the TSS for this process algebra is in bounded nondeterminism format and bounded. However, the transition rules for recursion disallow a strict stratification. 5. 3 Timed deadlock Deadlock in real time Basic Process Algebra [20], denoted by #[r] has an infinite ultimate delay of r . This can be expressed by transition rules #[r] #[s] for 0 s r, where s ranges over the real numbers. Then #[r] is infinitely branching for r , which is due to the fact that its transition rules are not bounded. Other ....

A.S. Klusener. Models and Axioms for a Fragment of Real Time Process Algebra. PhD thesis, Eindhoven University of Technology, 1993.

....of branching bisimulation equivalence from [9] in the case without timing. We believe that we have a plausible motivation for this coarser equivalence. In any case, we have shown that the axioms based on this equivalence permit thorough performance analysis in the case of the PAR protocol. In [11], the PAR protocol is described and analyzed using a version of process algebra with continuous absolute timing. The description originates from an earlier description in [1] In the case of the analysis in [11] handwavings are needed to come as far as in the case of our analysis. Other protocols ....

....equivalence permit thorough performance analysis in the case of the PAR protocol. In [11] the PAR protocol is described and analyzed using a version of process algebra with continuous absolute timing. The description originates from an earlier description in [1] In the case of the analysis in [11], handwavings are needed to come as far as in the case of our analysis. Other protocols that are described and analyzed in versions of process algebra with timing include the ABP (Alternating Bit Protocol) and the CABP (Concurrent Alternating Bit Protocol) both in [10] and Fischer s mutual ....

A.S. Klusener. Models and Axioms for a Fragment of Real Time Process Algebra. PhD thesis, Department of Computing Science, Eindhoven University of Technology, Eindhoven, 1993.

....this problem in this paper. In the untimed setting, bisimulation equivalences have been reasonably successful as notions of implementation between transition systems [BW90, Mil89] Consequently, bisimulation equivalences have also been proposed as implementation relations for the timed setting [BB91, Klu93, MT90, NS94, Yi90]. However, we do not believe that bisimulations will turn out to be very useful as implementation relations in the timed case. The problem is that they do not allow one to abstract in specifications from the often very complex timing behaviour of implementations (see Chapter 10 of [Klu93] for an ....

....NS94, Yi90] However, we do not believe that bisimulations will turn out to be very useful as implementation relations in the timed case. The problem is that they do not allow one to abstract in specifications from the often very complex timing behaviour of implementations (see Chapter 10 of [Klu93] for an example) Since we believe that timed trace inclusion does form a good notion of implementation, we are interested in identifying operations on timed automata for which the timed trace inclusion relation is substitutive. This substitutivity is a prerequisite for the compositional ....

[Article contains additional citation context not shown here]

A.S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Department of Mathematics and Computing Science, Technical University of Eindhoven, December 1993.

....address this problem in this paper. In the untimed setting, bisimulation equivalences have been reasonably successful as notions of implementation between transition systems [6, 34] Consequently, bisimulation equivalences have also been proposed as implementation relations for the timed setting [4, 23, 35, 38, 47]. However, we do not believe that bisimulations will turn out to be very useful as implementation relations in the timed case. The problem is that they do not allow one to abstract in specifications from the often very complex timing behavior of implementations (see Chapter 10 of [23] for an ....

....23, 35, 38, 47] However, we do not believe that bisimulations will turn out to be very useful as implementation relations in the timed case. The problem is that they do not allow one to abstract in specifications from the often very complex timing behavior of implementations (see Chapter 10 of [23] for an example) Since we believe that timed trace inclusion does form a good notion of implementation, we are interested in identifying operations on timed automata for which the timed trace inclusion relation is substitutive. This substitutivity is a prerequisite for the compositional ....

A.S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Department of Mathematics and Computing Science, Technical University of Eindhoven, December 1993.

....assuming discrete time instead of dense time model, or their equivalent timed automata from [1] Experimental Results. We have tested the implementation on various models known in the literature like Train Gate Controller, Seitz Circuit [15] Parallel Acknowledgment with Retransmission Protocol [14, 12] , Bounded Retransmission Protocol [7, 5, 4] We give the results of Fischer s mutual exclusion protocol, which has become a standard benchmark for tools that implement timing. The version of the protocol that was verified is a translation of the same model written in Promela with real (dense) ....

Klusener, A. S., Models and Axioms for a Fragment of Real Time Process Algebra, Ph. D. Thesis, Eindhoven University of Technology, 1993

....address this problem in this paper. In the untimed setting, bisimulation equivalences have been reasonably successful as notions of implementation between transition systems [6, 34] Consequently, bisimulation equivalences have also been proposed as implementation relations for the timed setting [4, 23, 35, 38, 46]. However, we do not believe that bisimulations will turn out to be very useful as implementation relations in the timed case. The problem is that they do not allow one to abstract in specifications from the often very complex timing behavior of implementations (see Chapter 10 of [23] for an ....

....23, 35, 38, 46] However, we do not believe that bisimulations will turn out to be very useful as implementation relations in the timed case. The problem is that they do not allow one to abstract in specifications from the often very complex timing behavior of implementations (see Chapter 10 of [23] for an example) Since we believe that timed trace inclusion does form a good notion of implementation, we are interested in identifying operations on timed automata for which the timed trace inclusion relation is substitutive. This substitutivity is a prerequisite for the compositional ....

A.S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Department of Mathematics and Computing Science, Technical University of Eindhoven, December 1993.

....conditions and # summands. Throughout this paper we worked without abstraction. It is conceivable that in a setting with abstraction the bottle filling system and the railroad gate controller could be simplified even further. However, despite impressive work in continuous time process algebra [11], the question of how abstraction can be combined with time has not been clarified satisfactorily yet. ....

A.S. Klusener. Models and axioms for a fragment of real time process algebra. Ph.D. Thesis. Eindhoven University of Technology, 1993.

....are primarily interested in ACP (Algebra of Communicating Processes, see for example [3] and its derivatives, such as abstract CRL (micro Common Representation Language, see for example [7] serious efforts were made. In [1] the first axiomatisations of real time process algebra appeared and in [9] and [4] different versions were proposed. 9] is a state of the art work for real time process algebra, with many semantic results. In the realm of discrete time process algebra new developments started via [2] More recently [10] appeared. It contains various semantic results for discrete time ....

....Processes, see for example [3] and its derivatives, such as abstract CRL (micro Common Representation Language, see for example [7] serious efforts were made. In [1] the first axiomatisations of real time process algebra appeared and in [9] and [4] different versions were proposed. [9] is a state of the art work for real time process algebra, with many semantic results. In the realm of discrete time process algebra new developments started via [2] More recently [10] appeared. It contains various semantic results for discrete time process algebras without abstraction. It may ....

A.S. Klusener. Models and axioms for a fragment of real time process algebra. Ph.D. Thesis. Technical University Eindhoven, 1993.

....on time aspects, using two timed ACP theories. First, we do a verification in a setting of discrete time, using the theory ACP dt devised by Baeten and Bergstra [BB92a] Secondly, a verification is done in a setting of dense time, using the theory ACP ur . This theory was devised by Klusener [Klu93], and is closely related to ACP # , the standard real time extension of ACP by Baeten and Bergstra [BB91] 2 The whole point of this exercise lies in the following two questions. First, How well suited are the current timed extensions of ACP to verify real life systems , and secondly, With ....

.... almost completely general case where 0 a a # d d # 2a (this is only a very minor restriction of the general case, but it reduces the state space significantly) We will use (a subset of) the real time process algebra ACP ur ( ACP with urgent actions and relative time ) as described in [Klu93]. 10 4.1 A short note on ACP ur Again, we briefly describe the essential extensions that ACP ur has to model time. To begin with, every action is postfixed with a non negative real number between square brackets. One could have, for example, a[3] meaning the process that performs the action a ....

[Article contains additional citation context not shown here]

A.S. Klusener. Models and Axioms for a Fragment of Real Time Process Algebra. PhD thesis, Eindhoven University of Technology, Computing Science Department, 1993.

....In case of a continuous time domain, our definition corresponds to the notion of timed # Supported by the Netherlands Organisation for Scientific Research (NWO) under contract SION 612 61 002. 2 M.B. van der Zwaag branching bisimilarity in the setting of real time ACP with urgent actions [17]. The intuition is always that # actions are silent inert if they do not lose possible behaviors. In timed CRL, actions may be executed at the same time consecutively. As a consequence, the notion of timed branching bisimilarity is quite di#erent from the one in real time ACP [16, 6] where this ....

A. S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Eindhoven University of Technology, 1993.

....are primarily interested in ACP (Algebra of Communicating Processes, see for example [4] and its derivatives, such as (untimed) CRL (micro Common Representation Language, see for example [8] serious efforts were made. In [2] the first axiomatisations of real time process algebra appeared and in [11] and [5] different versions were proposed. 11] is a state of the art work for realtime process algebra, with many semantic results. In the realm of discrete time process algebra new developments started via [3] More recently [12] appeared. 1 A full version of this paper occurred as CWI ....

....Processes, see for example [4] and its derivatives, such as (untimed) CRL (micro Common Representation Language, see for example [8] serious efforts were made. In [2] the first axiomatisations of real time process algebra appeared and in [11] and [5] different versions were proposed. [11] is a state of the art work for realtime process algebra, with many semantic results. In the realm of discrete time process algebra new developments started via [3] More recently [12] appeared. 1 A full version of this paper occurred as CWI Technical Report SEN R9808. A common conclusion that ....

A.S. Klusener. Models and axioms for a fragment of real time process algebra. Ph.D. Thesis. Technical University Eindhoven, 1993.

....or weak bisimulation in a setting as expressive as timed CRL. There are numerous completeness results for weak bisimulations in timed settings with restricted expressivity (e.g. 8] The only attempt that we know where the expressiveness of the language comes close to that of CRL can be found in [21]. Here, an axiom for branching bisimulation is given, which is claimed to be sound and complete. Although we do not doubt soundness, the completeness claim has not been appropriately justified, and turns out not to be easily reconstructable. Timed process algebras have received a lot of attention, ....

....bisimulation. However, bisimulation cannot be defined in terms of actions only, e.g. the processes ##t and ##u are considered equivalent only if t = u. We introduce the delay relation U t (p) which expresses that p can at least idle until time t. It has the same purpose as the ultimate delay in [2, 3, 21]. Definition 3.4 The delay relation U ( # DT P is defined by the transition rules in Table 4. Completeness of Timed CRL 13 U t (a) U t (p) U t (p q) U t (p) U t ( P P # p ) U t (p) t # t # U t (p#t # ) U t (p) U t (t # #p) t # t # U t (t # #p) Table 4: Transition ....

Klusener, A. Models and Axioms for a Fragment of Real Time Process Algebra. PhD thesis, Eindhoven University of Technology, 1993.

....on time aspects, using two timed ACP theories. First, we do a verification in a setting of discrete time, using the theory ACP dt devised by Baeten and Bergstra [BB92a] Secondly, a verification is done in a setting of dense time,using the theory ACP ur . This theory was devised by Klusener [Klu93], and is closely related to ACP # , the standard real time extension of ACP by Baeten and Bergstra [BB91] 2 The whole point of this exercise lies in the following two questions. First, How well suited are the current timed extensions of ACP to verify real life systems , and secondly, With ....

.... for the almost completely general case where 0 a a # d d # 2a (this is only a very minor restriction of the general case, but it reduces the state space significantly) We will use (a subset of) the real time process algebra ACP ur ( ACP with urgent actions and relative time ) as described in [Klu93]. 10 4.1 A short note on ACP ur Again, we briefly describe the essential extensions that ACP ur hastomodeltime.Tobegin with, every action is postfixed with a non negative real number between square brackets. One could have, for example, a[3] meaning the process that performs the action a at ....

[Article contains additional citation context not shown here]

A.S. Klusener. Models and Axioms for a Fragment of Real Time Process Algebra. PhD thesis, Eindhoven University of Technology, Computing Science Department, 1993.

....of PA, after which we study the consistency between this interleaving and the non interleaving semantics. 38 6. 1 Timed transition systems The notions of timed transition system and timed bisimulation, a timed variant of Milner s and Park s strong bisimulation are defined as follows (see also [33,25]) Definition 41 (Timed transition system. A timed transition system is a quadruple (S; L; Gamma ; s 0 ) with ffl S, a non empty set of states ffl L Act Theta IR , a set of labels ffl Gamma S Theta L Theta S, a transition relation ffl s 0 2 S, the initial state. We will write ....

A.S. Klusener. Models and axioms for a fragment of real-time process algebra. PhD thesis, Eindhoven University of Technology, 1993.

....[20] the CCS like process algebras with timing of [26] 35] 36] and [44] are compared. For comprehensive overviews of existing algebraic concurrency theories that deal with time dependent behaviour, having their roots in ACP, CCS, CSP, LOTOS or others, the reader is referred to Chapter 12 of [30] and Chapter 8 of [42] These overviews include discussions of interesting connections with the versions of ACP with timing presented in earlier chapters of [30] and [42] respectively. ....

.... that deal with time dependent behaviour, having their roots in ACP, CCS, CSP, LOTOS or others, the reader is referred to Chapter 12 of [30] and Chapter 8 of [42] These overviews include discussions of interesting connections with the versions of ACP with timing presented in earlier chapters of [30] and [42] respectively. ....

A.S. Klusener. Models and Axioms for a Fragment of Real Time Process Algebra. PhD thesis, Eindhoven University of Technology, Department of Computing Science, 1993.

....[20] the CCS like process algebras with timing of [26] 35] 36] and [44] are compared. For comprehensive overviews of existing algebraic concurrency theories that deal with time dependent behaviour, having their roots in ACP, CCS, CSP, LOTOS or others, the reader is referred to Chapter 12 of [30] and Chapter 8 of [42] These overviews include discussions of interesting connections with the versions of ACP with timing presented in earlier chapters of [30] and [42] respectively. ....

.... that deal with time dependent behaviour, having their roots in ACP, CCS, CSP, LOTOS or others, the reader is referred to Chapter 12 of [30] and Chapter 8 of [42] These overviews include discussions of interesting connections with the versions of ACP with timing presented in earlier chapters of [30] and [42] respectively. ....

A.S. Klusener. Models and Axioms for a Fragment of Real Time Process Algebra. PhD thesis, Eindhoven University of Technology, Department of Computing Science, 1993.

....A term deduction system is called pure if all its rules are pure. 2 Note that arbitrary many premises are allowed in the set of hypotheses of a deduction rule. This generality is useful, for instance, in real time process algebras where it is very natural to have continuously many premises (see [MT90, Yi90, Klu93]. 1 The idea behind t:R is that there is no term s such that tRs. We chose this notation among others like :tR, Rt, or : tR) since it seems to be the most accurate one. Example 2.2 As a running example, we present the operational semantics of the process algebra with parallel composition PA ....

A.S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, December 1993.

....time instead of relative time, and it has a notion of integration different from the kind we were familiar with. CRL features data, but is untimed, so we added prefixed integration and relative time and named this extension ae CRL . The theory on which these additions are based can be found in [Klu93], which is based on [BB91] We would like to stress here that as far as we know our attempt to specify such a large domain in ae CRL has no precedence and brings about all the obvious experimental hazards one can think of. Our specification of a traffic regulation system is based upon the work of ....

....an action at some time given by a condition, typically a time interval. A silent step (or internal step) denoted by the greek letter , is the abstraction from internal behaviour. Communications are renamed to s. 3 In this document actions are implicitly urgent actions as described in [Klu93], e.g. a[0] means that a must be executed immediately by which we allow consecutive actions at the same point in time. The square brackets explicitly determines the relative time setting. An alternative would be absolute time denoted by a(t) 4.2 Examples of Process Algebra Semantics ffl a[2] ....

A.S. Klusener, Models and axioms for a fragment of real time process algebra. Ph.D thesis, Technical University of Eindhoven, December 1993.

....to study the formal verification of such systems. In the last years, several formal techniques have been developed to specify and verify real time systems. For instance, many well known process algebras have been extended with features to manipulate time [Dav92, Yi90, MT90, NS94, BB91, Klu91, Klu93, BB95, BL92, LL94] But the apparently most successful approaches are timed and hybrid automata [AD94, NSY92, HNSY94, ACH 95] The formal relation between these two models has been studied in some cases [NSY92, NSY93, Fok94, DOY94] Languages that fully represent timed automata have also been ....

....an action a at time d. Intuitively, U d (s) together with axiom Until, means that a system can idle in a state s at least d units of times. Axiom Delay state that every time that an action may occur in a state s at time d, the system must be idling at that time. Predicate U was introduced in [Klu93] Here, we formalised its behaviour in a relative time setting by adding the axioms Until and Delay. Definition 2.2 (Timed bisimulation) Let L i = S i ; A Theta IR 0 ; s i 0 ; Gamma i ; U i ) i 2 f1; 2g, be two TTS. A timed bisimulation is a relation R S 1 Theta S 2 with s 1 0 ....

[Article contains additional citation context not shown here]

A.S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, December 1993.

....Mallorca, Spain, May 1997. Supported by the NWO SION project 612 33 006. 1 Introduction In the last years, several formal techniques have been developed to specify and verify real time systems. For instance, many well known process algebras have been extended with features to manipulate time [11, 24, 25, 20, 21, 5, 17, 6, 8, 18]. But the apparently most successful approaches are timed and hybrid automata [3, 22, 15, 2] Both models have been related in [22, 23, 14, 26, 12] In [10] both approaches have been integrated and an algebra for timed automata has been introduced. The syntax extends Milner s CCS [19] with ....

....Notice that this kind of constraints are such that if they hold at time d, they hold at all d 0 d. Timed Transition Systems. A timed transition system is a labelled transition system that includes information about the time. We adopt the model of actions with time stamps following the style of [17] Definition 2.1 Let A be a set of actions. A timed transition system (TTS) is a structure L = Sigma; A Theta IR 0 ; oe 0 ; Gamma ; U) where ffl Sigma is a set of states, with the initial state oe 0 2 Sigma; ffl Gamma Sigma Theta (A Theta IR 0 ) Theta Sigma is the transition ....

A.S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, December 1993.

....also provide an effective method to translate from one model into the other. 1 Introduction In the last years, several formal techniques have been developed to specify and verify real time systems. For instance, many well known process algebras have been extended with features to manipulate time [8, 19, 16, 17, 4, 14, 5]. But the apparently most successful approaches are timed and hybrid automata [2, 12, 1] Both models have been related in [18, 11, 20, 9] In [7] both approaches have been integrated and an algebra for timed automata has been introduced. The syntax extends Milner s CCS [15] with operations to ....

.... d) OE) j= v(OE) Notice that this kind of constraints are such that if they hold at time d, they hold at all d 0 d. A timed transition system is a labelled transition system that includes information about the time. We adopt the model of actions with time stamps following the style of [14] Definition 1. Let A be a set of actions . A timed transition system (TTS) is a structure L = Sigma ; A Theta IR 0 ; oe 0 ; Gamma ; U) where ffl Sigma is a set of states , with the initial state oe 0 2 Sigma ; ffl Gamma Sigma Theta (A Theta IR 0 ) Theta Sigma is the transition ....

A.S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Eindhoven University of Technology, 1993.

....Therefore, it becomes interesting to study the formal verification of such systems. In the last years, several formal techniques have been developed to specify and verify real time systems. For instance, many well known process algebras have been extended with features to manipulate time [11, 26, 22, 23, 5, 17, 6, 9, 18]. But the apparently most successful approaches are timed and hybrid automata [3, 24, 15, 2] The formal relation between these two models has been studied in some cases [24, 25, 14, 12] Languages that fully represent timed automata have also been studied [20, 27] In this paper, we introduce a ....

....an action a at time d. Intuitively, U d (s) together with axiom Until, means that a system can idle in a state s at least d units of times. Axiom Delay state that every time that an action may occur in a state s at time d, the system must be idling at that time. Predicate U was introduced in [17]. Here, we formalised its behaviour in a relative time setting by adding the axioms Until and Delay. Definition 2. Let L i = S i ; A Theta IR 0 ; s i 0 ; Gamma i ; U i ) i 2 f1; 2g, be two TTS. A timed bisimulation is a relation R S 1 Theta S 2 with s 1 0 Rs 2 0 satisfying, for ....

[Article contains additional citation context not shown here]

A.S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, December 1993.

....this problem in this paper. In the untimed setting, bisimulation equivalences have been reasonably successful as notions of implementation between transition systems [BW90, Mil89] Consequently, bisimulation equivalences have also been proposed as implementation relations for the timed setting [BB91, Klu93, MT90, NS94, Yi90]. However, we do not believe that bisimulations will turn out to be very useful as implementation relations in the timed case. The problem is that they do not allow one to abstract in specifications from the often very complex timing behaviour of implementations (see Chapter 10 of [Klu93] for an ....

....MT90, NS94, Yi90] However, we do not believe that bisimulations will turn out to be very useful as implementation relations in the timed case. The problem is that they do not allow one to abstract in specifications from the often very complex timing behaviour of implementations (see Chapter 10 of [Klu93] for an example) Since we believe that timed trace inclusion does form a good notion of implementation, we are interested in identifying operations on timed automata for which the timed trace inclusion relation is substitutive. This substitutivity is a prerequisite for the compositional ....

[Article contains additional citation context not shown here]

A.S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Department of Mathematics and Computing Science, Technical University of Eindhoven, December 1993.

No context found.

A.S. Klusener, Models and axioms for a fragment of real time process algebra, Ph.D. thesis, Eindhoven University of Technology, 1993.

No context found.

A.S. Klusener. Models and axioms for a fragment of real time process algebra. PhD. Thesis. Eindhoven University of Technology, 1993.

First 50 documents

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