Liang Chen. An interleaving model for real-time systems. In A. Nerode and M. Taitslin, editors, Proc. of 2nd Int'l Symp. on Logical Foundations of Computer Science (LFCS'92), volume 620 of Lecture Notes in Computer Science, pages 81--92. Springer-Verlag, July 1992. 67  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... systems has been described in [Hil87, Cle90, Kor91, CC92, Pol92] and implemented in at least two tools [GLZ89, CPS89] During the last few years a number of real time process algebras has been introduced in order to handle quantitative aspects of processes [DS89, Wan90, NRSV90, BB89, Che91] In addition a number of time sensitive and time abstracting (bi)simulation equivalences and preorders has been introduced and studied [Wan90, LW90, GL92, DS89] Due to the use of the non negative reals as time domain, even the simplest processes describe infinite states systems. Thus, ....

Liang Chen. An interleaving model for real--time systems. Technical report, LFCS, University of Edinburgh, Scotland, 1991. Preliminary version.

....Extended Abstract Real time models are used to model time dependent physical problems. The common approach is to restrict action occurrences to closed, more precisely to left closed intervals. Contrary to this, timed automata [AD94] and some process algebras (for example [Che92, Dan91]) allow actions to occur in open intervals in order to increase their expressive power. Another important property of timed process algebras is the maximal progress assumption, i.e. an action must occur at the instant at which all participants are ready. This assumption thus guarantees that time ....

....after an internal action. Introducing the process algebra Open Timed CCS we illustrate how a process algebra that meets both properties, the maximal progress assumption and action occurrences in open intervals, can be constructed. Open Timed CCS is based on the real time process algebra of [Che92], and therefore based on CCS. The transition rules of Open Timed CCS which deal with time passing in action prefix terms are presented in Table 1. The time additivity [NS92] for real time steps) and the time determinism [NS92] properties are satisfied by Open Timed CCS. 0 e 0 ff OE 0 e ....

L. Chen. An interleaving model for real--time systems. LNCS, 620:81--92, 1992.

....Real time models are used to model time dependent physical problems. The common approach is to restrict action occurrences to closed, more precisely to left closed intervals [RR88, Sch00, MT90, Wan90, Mur92, FZ94, CL96, LL97] Contrary to this, timed automata [AD94] and some process algebras [BB91, Klu91, Dan91, Che92, Jef92] allow actions to occur in open intervals in order to increase their expressive power. Another important property of timed process algebras is the maximal progress assumption, i.e. an action must occur at the instant at which all participants are ready. This assumption thus guarantees that time ....

....CCS. Section 4 establishes the concepts of bisimulation equivalences. A possibility to model priorities in Open Timed CCS is introduced in Section 5. A conclusion is given in Section 6. 2 Process Algebra In this section we define Open Timed CCS. We keep close to the syntax and semantics of Chen [Che92]. 2.1 Syntax Let Gamma be a set of action names, not containing . Elements of Gamma are denoted by a; b. Define the set of co names as Gamma : fa j a 2 Gamma g. Then the set : Gamma [ Gamma is the set of atomic actions. Further, define the set b : fc j c 2 g of marked atomic ....

[Article contains additional citation context not shown here]

L. Chen. An interleaving model for real--time systems. LNCS, 620:81--92, 1992.

....binary relations is possible, but this trick does not contribute to comprehensibility. In many applications of TSSs, it is in addition necessary to have support for many sortedness or variable binding operators. Many sortedness is found, for example, in process algebras with timing (see e.g. 4] [11] and [30] Examples of variable binding operators are the integration operator R of real time ACP [4] and the recursion operator of CSP [25] and CCS [28] Using transition rules to cope with many sortedness is unpractical and obscures the fact that it is a static matter. Variable binding ....

L. Chen. An interleaving model for real-time systems. In A. Nerode and M. Taitslin, editors, Symposium on Logical Foundations of Computer Science, pages 81-92. LNCS 620, Springer-Verlag, 1992.

....Verification, validation and testing; LOTOS; A TSLTS; Symbolic bisimulation 1 INTRODUCTION Verification of timed bisimulation equivalence for timed processes is generally difficult because of state explosion. There are some proposals to solve this problem(Holmer et al. 1991; Cer ans 1992; Chen 1992; Alur et al. 1994) But they all have some restrictions in describing time constraints of actions. On the other hand, for data passing processes, a verification method of bisimulation equivalence is proposed(Hennessy and Lin 1995) This method has some advantages: 1) Its verification cost does ....

.... 1 ) d t 1 = x] t 2 ; a[true] t 3 ; e(d t 3 ) d t 3 4] t 4 ; b[d t 3 3] t 5 ; c[d t 3 2] Figure 1 Example of TSLTS assignment for parameter variables in DV ar(s) The execution of an action is considered instantaneous, since we take interleaving semantics to express concurrency(Wang 1991; Chen 1992). The state s may have multiple outgoing action transitions. In that case, one of executable action transitions is nondeterministically chosen and then executed. Example 1 We show an example of a TSLTS in Fig. 1. In Fig. 1, for convenience, the names s 1 ; s 2 ; are assigned for states and ....

[Article contains additional citation context not shown here]

Chen, L. (1992). An interleaving model for real-time systems. In Proc. of 2nd Int'l Symp.

....between n and n 1, may also occur at any other time between n and n 1. Note that the real time transition systems of [3] are more complicated than necessary and a simpler kind of transition systems is used in [15] They are also closely related to the transition systems underlying Timed CCS [12] and the timed transition systems proposed in [21] The discrete time case is considered suitable for formalisms aimed at programming. It permits to consider systems at a more abstract level than the continuous time case, a level where time is measured with finite precision. Often this level does ....

L. Chen. An interleaving model for real-time systems. In A. Nerode and M. Taitslin, editors, Symposium on Logical Foundations of Computer Science, pages 81--92. LNCS 620, Springer-Verlag, 1992.

....with are image finite: only finitely many results are possible from any state through any particular (delay or action) transition. As well as the transition systems mentioned above, these include a number of algebras using the reals as the underlying time domain: the three versions of Timed CCS [MoT90, Wan91, Che91], Timed ACP [BaB91] APA [Jef91] and a different version of timed LOTOS [QAF89] These are all additive, so it follows that they are trajectoried. Timed CSP [Sch92] and PARTY [Ho 92] are not image finite; they both allow infinite choice. However, they are both forward and backward deterministic ....

Liang Chen, An interleaving model for real-time systems, report ECS-LFCS-91-184, University of Edinburgh, 1991.

....they cannot represent the actual time between events, only the ordering in time of these events. Trying to build on their success, and to provide the basis for a formal method for real time systems, many timed process algebras have been developed, including extensions to existing algebras [5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16] for reviews see [17, 18] In section 2 we argue that, while useful, timed process algebras cannot as easily be used as broad spectrum languages (in the way that CCS and Z [19] can be) and that a different approach needs to be taken. The focus of the rest of the paper is then made clear in ....

L Chen. An interleaving model for real-time systems. Technical Report ECS-LFCS-91-184, Edinburgh University, November 1991.

....parallelism have proved more controversial and it is only recently that some consensus about the main approaches has been reached. Surveying the literature has suggested process algebras as one of the leading contenders [8, 12] Many approaches to extending process algebras with actual time values [3, 1, 2, 6, 13, 16, 10] or with time and probabilities [5] have also been discussed. We use a selection from these approaches with some new techniques to obtain a process algebra which may be used to describe discrete event simulations. So we take a relatively high level language that has a formal semantics of ....

....present the intended meaning. The language is based on the timed CCS of [15] with some features of the temporal CCS of [9] though their calculus does not generalise directly to real number time and they have more power in that they have a weak operator that we do not. It ends up very close to [2] except we have only two options for the upper limit to the time of execution of an action. Our impatient prefixing is equivalent to Chen s ffj 0 0 while our idling prefixing is equivalent to his ff(s)j 1 0 . Our language is defined so that CCS is a sub calculus in the sense that the ....

[Article contains additional citation context not shown here]

Liang Chen. An interleaving model for real-time systems. Technical Report ECSLFCS -91-184, LFCS, University of Edinburgh, November 1991.

....using untimed CSP. The main drawback to Timed CSP, and other process algebraic techniques, is that the verification techniques tend not be algorithmic, and thus process algebras tend to have little tool support, although this is changing [17] Other process algebras were introduced in [52] and [14]. Another drawback these process algebras is that defining the effects of timing constraints, including deadlines, is often done by identifying certain behaviors as non computations of the process because they fail to meet the timing constraints. This practice can sometimes complicate the ....

Liang Chen. An interleaving model for real-time systems. Technical Report ECSLFCS -91-184, University of Edinburgh, 1991.

....only finitely many results are possible from any state through any particular (delay or References 18 action) transition. As well as the transition systems mentioned above, these include a number of algebras using the reals as the underlying time domain: the three versions of Timed CCS [MoT90, Wan91, Che91], Timed ACP [BaB91] APA [Jef91] and a different version of timed lotos [QAF89] These are all additive, so it follows that they are trajectoried. Timed CSP [Sch92] and party [Ho 92] are not image finite; they both allow infinite choice. However, they are both forward and backward deterministic ....

Liang Chen, An interleaving model for real-time systems, report ECS-LFCS-91-184, University of Edinburgh, 1991.

....real time versions of ACP presented in [6] unlike those presented in [2] and [3] do not exclude the possibility of two or more actions to be performed consecutively at the same point in time. That is, they include urgent actions, similar to ATP [19] and the different versions of CCS with timing [11, 18, 21]. This feature seems to be essential to obtain simple and natural embeddings of discrete time versions as well as useful in practice when describing and analyzing systems in which actions occur that are entirely independent. This is, for example, the case for actions that happen at different ....

L. Chen. An interleaving model for real-time systems. In A. Nerode and M. Taitslin, editors, Symposium on Logical Foundations of Computer Science, pages 81--92. LNCS 620, Springer-Verlag, 1992.

....binary relations is possible, but this trick does not contribute to comprehensibility. In many applications of TSSs, it is in addition necessary to have support for manysortedness or variable binding operators. Many sortedness is found, for example, in process algebras with timing (see e.g. 4] [8] and [25] Examples of variable binding operators are the integration operator R of real time ACP [4] and the recursion operator of CSP [21] and CCS [23] Using transition rules to cope with manysortedness is unpractical and obscures the fact that it is a static matter. Variable binding ....

L. Chen. An interleaving model for real-time systems. In A. Nerode and M. Taitslin, editors, Symposium on Logical Foundations of Computer Science, pages 81-92. LNCS 620, Springer-Verlag, 1992.

....(t) P represents an idling for t time units; and P #Q is a time sensitive choice operator. The choice is made not only by an action but also by idling when either P or Q. By combining (t) P and #, the calculus can restrict actions which are already executable. Further, Timed CCS by Chen in [14] introduces a special action prefix, written as # t 2 t 1 .P . CCSiT (CCS with interval Time) by Daniels in [17] have a action prefix, written as # [t 1 ,t 2 ) P . Both these operators represent a process which can perform action # from t 1 to t 2 units of time. The both examples correspond to ....

....relations such as bisimulation equivalence [58] trace equivalence [11] failure equivalence [11] and testing equivalence [21] but they cannot distinguish between the timings of processes. Several researchers have explored time extensions of the strong bisimulation [51] for example see [27, 14, 17, 26, 54, 57, 64, 75, 79]. The extended bisimulations equate two processes if they cannot be distinguished from each other in their temporal properties as well as their behavioral one. Most of them are di#cult to have the concept of observation, because their timed semantics often disable internal actions to be ignored ....

L. Chen. An Interleaving Model for Real-Time Systems. Technical Report Technical report ECS-LFCS-91-184, University of Edinburgh, 1991.

....to develop it. Different from the real time versions of [2] and [4] this version does not exclude the possibility of two or more actions to be performed consecutively at the same point in time. That is, it includes urgent actions, similar to ATP [37] and the different versions of CCS with timing [19, 35, 44]. This is useful in practice when describing and analyzing systems in which actions occur that are entirely independent. This is, for example, the case for actions that happen at different locations in a distributed system. In [2] and [4] the main idea was that it is difficult to imagine that ....

....see e.g. 12] 14] and [17] We did not give explicit consideration to other algebraic concurrency theories that deal with time dependent behaviour. In general, they have urgent actions and relative timing. This is, for example, the case with ATP [37] the different versions of CCS with timing [19, 35, 44] and TIC [39] TIC is rooted in LOTOS [46] We claim, on the basis of the connections described in [6] that there are indeed close connections between these theories and the versions of ACP with relative timing presented in this chapter, i.e. ACP srt and ACP drt . We also claim that there ....

L. Chen. An interleaving model for real-time systems. In A. Nerode and M. Taitslin, editors, Symposium on Logical Foundations of Computer Science, pages 81--92. LNCS 620, Springer-Verlag, 1992.

....to develop it. Di erent from the real time versions of [2] and [4] this version does not exclude the possibility of two or more actions to be performed consecutively at the same point in time. That is, it includes urgent actions, similar to ATP [37] and the di erent versions of CCS with timing [19, 35, 44]. This is useful in practice when describing and analyzing systems in which actions occur that are entirely independent. This is, for example, the case for actions that happen at di erent locations in a distributed system. In [2] and [4] the main idea was that it is dicult to imagine that actions ....

....see e.g. 12] 14] and [17] We did not give explicit consideration to other algebraic concurrency theories that deal with time dependent behaviour. In general, they have urgent actions and relative timing. This is, for example, the case with ATP [37] the di erent versions of CCS with timing [19, 35, 44] and TIC [39] TIC is rooted in LOTOS [46] We claim, on the basis of the connections described in [6] that there are indeed close connections between these theories and the versions of ACP with relative timing presented in this chapter, i.e. ACP srt and ACP drt . We also claim that there is ....

L. Chen. An interleaving model for real-time systems. In A. Nerode and M. Taitslin, editors, Symposium on Logical Foundations of Computer Science, pages 81-92. LNCS 620, Springer-Verlag, 1992.

....time between n and n 1, may also occur at any other time between n and n 1. Note that the real time transition systems of [3] are more complicated than necessary and a simpler kind of transition systems is used in [15] They are also closely related to the transition systems underlying Timed CCS [12] and the timed transition systems proposed in [21] The discrete time case is considered suitable for formalisms aimed at programming. It permits to consider systems at a more abstract level than the continuous time case, a level where time is measured with finite precision. Often this level does ....

Chen, L.: "An interleaving model for real-time systems". In A. Nerode and M. Taitslin (eds.), Symposium on Logical Foundations of Computer Science, LNCS 620, SpringerVerlag, 1992, 81--92.

....to develop it. Di erent from the real time versions of [1] and [3] this version does not exclude the possibility of two or more actions to be performed consecutively at the same point in time. That is, it includes urgent actions, similar to ATP [30] and the di erent versions of CCS with timing [16, 28, 35]. This is useful in practice when describing and analyzing systems in which actions occur that are entirely independent. This is, for example, the case for actions that happen at di erent locations in a distributed system. In [1] and [3] the main idea was that it is dicult to imagine that actions ....

....see e.g. 10] 12] and [14] We did not give explicit consideration to other algebraic concurrency theories that deal with time dependent behaviour. In general, they have urgent actions and relative timing. This is, for example, the case with ATP [30] the di erent versions of CCS with timing [16, 28, 35] and TIC [32] TIC is rooted in LOTOS [37] We claim, on the basis of the connections described in [5] that there are indeed close connections between these theories and the versions of ACP with relative timing presented in this paper, i.e. ACP srt and ACP drt . We also claim that there is a ....

L. Chen. An interleaving model for real-time systems. In A. Nerode and M. Taitslin, editors, Symposium on Logical Foundations of Computer Science, pages 81-92. LNCS 620, Springer-Verlag, 1992.

....real time versions of ACP presented in [6] unlike those presented in [2] and [3] do not exclude the possibility of two or more actions to be performed consecutively at the same point in time. That is, they include urgent actions, similar to ATP [19] and the di erent versions of CCS with timing [11, 18, 21]. This feature seems to be essential to obtain simple and natural embeddings of discrete time versions as well as useful in practice when describing and analyzing systems in which actions occur that are entirely independent. This is, for example, the case for actions that happen at di erent ....

L. Chen. An interleaving model for real-time systems. In A. Nerode and M. Taitslin, editors, Symposium on Logical Foundations of Computer Science, pages 81-92. LNCS 620, Springer-Verlag, 1992.

....time; t) P represents an idling for t time units; and P 8Q is a time sensitive choice operator. The choice is made not only by an action but also by idling when either P or Q. By combining (t) P and 8, the calculus can restrict actions which are already executable. Further, Timed CCS by Chen in [14] introduces a special action prefix, written as ff t 2 t 1 :P . CCSiT (CCS with interval Time) by Daniels in [17] have a action prefix, written as ff [t 1 ; t 2 ) P . Both these operators represent a process which can perform action ff from t 1 to t 2 units of time. The both examples correspond ....

....relations such as bisimulation equivalence [58] trace equivalence [11] failure equivalence [11] and testing equivalence [21] but they cannot distinguish between the timings of processes. Several researchers have explored time extensions of the strong bisimulation [51] for example see [27, 14, 17, 26, 54, 57, 64, 75, 79]. The extended bisimulations equate two processes if they cannot be distinguished from each other in their temporal properties as well as their behavioral one. Most of them are difficult to have the concept of observation, because their timed semantics often disable internal actions to be ignored ....

L. Chen. An Interleaving Model for Real-Time Systems. Technical Report Technical report ECS-LFCS-91-184, University of Edinburgh, 1991.

....semantics of a timed process then is given as a transition system enriched by quantitative timing information such as the absolute duration of actions or their time of occurrence. This paper puts forward yet another process algebra; why bother Most of the salient approaches, such as [MT90, Wan90, Lia91, NS91a, Klu91, SDJ 91] primarily aim at describing completely the global real time behaviour of timed systems in a fairly realistic fashion. The means for abstracting from real time is restricted to the choice of the time domain; for instance, instead of working with real numbers one may ....

....are in general very difficult to implement due to uncontrollable fabrication parameters, operating conditions such as circuit temperature or external events. At best we can hope to implement delay intervals. A process algebra using delay intervals rather than exact time was proposed by Liang [Lia91] Such an algebra, however, suffers even more from being cluttered up with irrelevant timing information. Another process algebra with interval durations is CIPA [AM93a] A disadvantage of time intervals are the severe problems they cause for simulation, in particular where time is dense: It is ....

Chen Liang. An interleaving model for real-time systems. Technical Report ECS-LFCS-91-184, Laboratory for Foundations of Computer Science, University of Edinburgh, November 1991.

....bisimulation equivalence i.e. parallel composition can not in general be removed. This explains why axiomatization and decidability of various equivalences between real time processes based on dense time domains have proven notoriously hard problems. Recent work by Cer ans [ Cer92] Chen [Che91] and Fokkink and Klusener [FK91] offers the first examples of decidability and axiomatization for real time calculi based on dense time. In this paper we introduce a time abstracting (bisimulation) equivalence between real time processes, i.e. in comparing real time processes we shall ....

L. Chen. An Interleaving Model for Real--Time Systems. Technical report, LFCS, University of Edinburgh, Scotland, 1991.

....On the other side, whereas PMC concentrates on qualitative real time constraints, the standard pattern of introducing time into process algebras aims at a precise and complete description of a real time system s quantitative timing. Examples are Atp [21] Timed Csp [24] Bpaaeffi, and many others [22, 25, 20, 16, 15, 23]. These approaches use a global notion of time and describe the global real time behaviour of the system quite precisely by inserting explicit delays. This may be necessary in many safety critical applications, however, for real time systems such as the Vehicle Signal Analyzer, it is overly ....

....; P; which performs an infinite sequence of a actions separated by a sequence of b i actions, we might want to limit the time between any two a actions without specifying anything about the intermediate b i s. The usual formalisms typically require a fixed delay or an interval of delays (as in [16]) to be assigned to each b i , which means we are imposing unnecessary restrictions on them. In general, this will not be the most helpful solution as it might require almost clairvoyant skills: We must foresee the effects of our compiler and code optimization, have precise knowledge about the ....

Chen Liang. An interleaving model for real-time systems. Technical Report ECSLFCS -91-184, Laboratory for Foundations of Computer Science, University of Edinburgh, November 1991.

....by Milner for CCS. It derives from strong bisimulation equivalence by abstracting as much as possible from silent actions. A similarly standard approach to observation equivalence has been adopted for other CCS like timed process algebras such as TCCS by Moller and Tofts [MT92] Chen Liang [Lia91], or Yi Wang [Wan90] Of b s g id DTU these publications [MT92] contains an equational calculus for observational congruence, which is claimed to be complete for finite sequential processes. There is an alternative and slightly less abstract approach to abstracting from moves. This is the ....

Chen Liang. An interleaving model for real-time systems. Technical Report ECS-LFCS-91-184, Laboratory for Foundations of Computer Science, University of Edinburgh, November 1991.

.... many of the existing timed specification formalisms do allow in certain natural sense loose specifications of time information (it would be not that natural to determine at early system design stage exactly what are the time quantities between specific events going to be 2 ) at least [MF76, AD90, Che92, Dan92, CGL93] to be mentioned. The calculus CTR 3 presented in this paper is also designed to follow this tradition. Specifically, its aim is to provide a framework with mathematically precise and semantically justified notion of timed specification refinement (when one specification can be termed to be ....

L. Chen, An Interleaving Model for Real Time Systems, in Proceedings of LFCS'92, Lecture Notes in Computer Science No. 620, 1992.

....that connects two nodes. 5 Comparison to previous work The literature on the semantics dataflow networks with timed merge is nonexistent. Work in the theory of timed systems has centered on temporal logic ( 11, 18] and others) and algebraic operational models like CSP ( 32] and others) and CCS ([7, 21, 37] and others) with some work being done in automata theory ( 2, 12, 20] and others) By contrast, the literature on the semantics of networks with indeterminate operators would easily fill a large book ( 1, 3, 4, 5, 6, 14, 16, 15, 17, 24, 29, 26, 27, 28, 25, 30, 31, 34, 35] and many more) We ....

L. Chen. An interleaving model for real-time systems. In A. Nerode and M. Taitslin, editors, Logical Foundations of Computer Science: Proc. of the Second Int. Symp., Tver, Russia, pages 81--92. Springer-Verlag, LNCS 620, 1992.

....time domain. The march of time It is generally accepted that time should be able to pass for ever for any real system. Many algebras, such as those presented in (Hennessy and Regan, 1991) Wang Yi, 1991) Nicollin and Sifakis 1990) Moller and Tofts 1990) Baeten and Bergstra, 1991) and (Liang Chen, 1991) permit programs that may perform an infinite number of internal or visible events by a particular time, in effect preventing time from passing beyond that point. Further, in (Moller and Tofts 1990) and (Liang Chen, 1991) there are processes which neither perform any action nor proceed through ....

....and Sifakis 1990) Moller and Tofts 1990) Baeten and Bergstra, 1991) and (Liang Chen, 1991) permit programs that may perform an infinite number of internal or visible events by a particular time, in effect preventing time from passing beyond that point. Further, in (Moller and Tofts 1990) and (Liang Chen, 1991) there are processes which neither perform any action nor proceed through time. For these approaches, the passage of time seems rather weak compared with the execution of processes. It has been observed by Jeffrey that the advantage of allowing such time stopping processes in a language is that a ....

Liang Chen (1991), An interleaving model for real-time systems, report ECS-LFCS-91184, University of Edinburgh.

....difficult to implement due to the dependence on uncontrollable fabrication parameters, operating conditions such as circuit temperature, or external events. At best we can hope to implement delay intervals. A process algebra using delay intervals rather than exact time was proposed by Liang Chen [Che91]. Such an algebra, however, suffers even more from being cluttered up with irrelevant timing information. Time intervals also pose big problems for simulation aimed at timing validation, in particular where time is dense. In this report we propose a rather abstract approach to the specification ....

Liang Chen. An interleaving model for real-time systems. Technical Report ECS-LFCS-91-184, Laboratory for Foundations of Computer Science, University of Edinburgh, November 1991.

....bisimulation equivalence i.e. parallel composition can not in general be removed. This explains why axiomatization and decidability of various equivalences between real time processes based on dense time domains have proven notoriously hard problems. Recent work by Cer ans [ C92] Chen [Che91b] and Fokkink and Klusener [FK91] offers the first examples of decidability and axiomatization for real time calculi based on dense time. In this paper we introduce a time abstracting (bisimulation) equivalence between real time processes, i.e. in comparing real time processes we shall ....

Liang Chen. An interleaving model for real--time systems. Technical report, LFCS, University of Edinburgh, Scotland, 1991. Preliminary version.

No context found.

Liang Chen. An interleaving model for real-time systems. In A. Nerode and M. Taitslin, editors, Proc. of 2nd Int'l Symp. on Logical Foundations of Computer Science (LFCS'92), volume 620 of Lecture Notes in Computer Science, pages 81--92. Springer-Verlag, July 1992. 67

No context found.

L. Chen. An interleaving model for real-time systems. In Nerode and Taitslin

No context found.

L Chen. An interleaving model for real-time systems. Technical Report ECSLFCS -91-184, Edinburgh University, November 1991.

No context found.

L Chen. An interleaving model for real-time systems. Technical Report ECSLFCS -91-184, Edinburgh University, November 1991.

No context found.

L. Chen, An interleaving model for real-time systems, in: A. Nerode, M. Taitslin (Eds.), Symposium on Logical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 620, Springer, Berlin, 1992, pp. 81--92.

No context found.

Chen, L. (1992), An interleaving model for real-time systems, in "Proceedings, 2nd Symposium on Logical Foundations of Computer Science, Tver, Russia," (A. Nerode and M. Taitslin, Eds.), pp. 81--92, Lecture Notes in Computer Science, Vol. 620, Springer-Verlag, Berlin.

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