N. Lynch and F. Vaandrager. Forward and backward simulations -- Part II: Timing-based systems. Information and Computation, 128(1):1--25, July 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....research questions. I O Automata. Input Output automata are a semantic model for reactive, distributed systems together with a tailored refinement concept. The model has been originally proposed by Lynch and Tuttle [LT87] subsequent developments are mainly due to Lynch and Vaandrager [LV95, LV96, Lyn96, GSSL93, RV96, LSVW96] The method has already 1.1 Motivation 3 been successfully applied to the verification of several non trivial case studies, ranging from communication protocols [SLL93] and automated transit systems [DL97] to database applications [LMWF94] Apart from I O automata ....

....within Isabelle in the chapters 8 10. In the sequel a concise introduction to the theory of Input Output (I O) automata is given. The model has been originally developed by Lynch and Tuttle [LT87, LT89] subsequent extensions profited mainly from contributions by Lynch and Vaandrager [LV95, LV96, Lyn96, GSSL93, RV96] The presentation in this chapter follows [Lyn96] rather closely. In addition, strong fairness is considered as in [RV96] and backward simulations and the completeness result for simulations are taken from [LV95] Furthermore, general liveness is considered, which has been ....

[Article contains additional citation context not shown here]

N.A. Lynch and F. Vaandrager. Forward and backward simulations -- part II: Timing-based systems. Information and Computation, 128(1):1--25, 1996.

....approaches exist by which this property could be established, the best choice depending upon the application at hand. A few examples are finite state machine equivalence inequivalence, applications of type theory to the calculus [8] and the concept of implementation from I O automata theory [22, 23]. 1.3 Outline We will begin in Section 2 by defining a set of theoretical formalisms which describe communication networks, linear compositions of processes, and meaningful reductions upon an infinite test space. Section 3 expounds upon four examples which put our framework to use. In the ....

Nancy Lynch and Frits Vaandrager. Forward and backward simulation -- part II: Timing-based systems. Information and Computation, 121(2):214--233, September 1995.

....approaches exist by which this property could be established, the best choice depending upon the application at hand. A few examples are finite state machine equivalence inequivalence, applications of type theory to the calculus [8] and the concept of implementation from I O automata theory [22, 23]. 1.3 Outline We will begin in Section 2 by defining a set of theoretical formalisms which describe communication networks, linear compositions of processes, and meaningful reductions upon an infinite test space. Section 3 expounds upon four examples which put our framework to use. In the ....

Nancy Lynch and Frits Vaandrager. Forward and backward simulation -- part II: Timing-based systems. Information and Computation, 121(2):214--233, September 1995.

No context found.

Nancy Lynch and Frits Vaandrager. Forward and backward simulations -- Part II: Timingbased systems. Technical Memo MIT/LCS/TM-487, Laboratory for Computer Science, Massachusetts Institute Technology, Cambridge, MA, April 1993.

No context found.

Nancy Lynch and Frits Vaandrager. Forward and Backward Simulations --- Part II: Timing-Based Systems. Information and Computation, 128(1):1--25, July 1996. Preliminary version appeared as Ref. 13.

No context found.

Nancy Lynch and Frits Vaandrager. Forward and Backward Simulations --- Part II: Timing-Based Systems. Technical Memo MIT/LCS/TM-487.c, Labora- tory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts, April 1995.

No context found.

N.A. Lynch and F.W. Vaandrager. Forward and backward simulations --- Part II: Timing-based systems. Information and Computation, 128(1):1--25, July 1996.

No context found.

N.A. Lynch and F.W. Vaandrager. Forward and backward simulations -- part II: Timing-based systems. Technical Report MIT/LCS/TM-487, Laboratory for Computer Science, MIT, Cambridge, MA, September 1993.

No context found.

Nancy Lynch and Frits Vaandrager. Forward and backward simulations -- Part II: Timing-based systems. Information and Computation, 121(2):214--233, September 1995.

No context found.

Nancy Lynch and Frits Vaandrager. Forward and backward simulations | Part II: Timing-based systems. Information and Computation, 128(1):1-25, July 1996. 114

No context found.

N.A. Lynch and F.W. Vaandrager. Forward and backward simulations --- Part II: Timing-based systems. Information and Computation, 128(1):1--25, July 1996.

No context found.

Nancy A. Lynch and Frits Vaandrager, "Forward and Backward Simulations --- Part II: Timing-Based Systems," Technical Memo MIT/LCS/TM-487.c, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts, Apr. 1995.

No context found.

Nancy A. Lynch and Frits Vaandrager, "Forward and Backward Simulations --- Part II: Timing-Based Systems," Information and Computation, vol. 128, no. 1, pp. 1--25, July 1996, Preliminary version appeared as Ref. 31.

....about the system and precisely define the problem. We then prove that it is impossible for any protocol to solve the problem. 1.3 Formal methods We use invariant assertion and simulation (refinement) techniques to verify TCP and T TCP. We use the formalization of simulations developed in [24, 26] by Lynch and Vaandrager. These methods are used for proving trace inclusion relationships between concurrent We do not verify this. 14 systems. The methodology is developed in the context of very simple and general automaton models for both untimed [24] and timed [26] systems. For timed ....

....developed in [24, 26] by Lynch and Vaandrager. These methods are used for proving trace inclusion relationships between concurrent We do not verify this. 14 systems. The methodology is developed in the context of very simple and general automaton models for both untimed [24] and timed [26] systems. For timed systems we use a formulation of the automaton model called General Timed Automata (GTA) presented in [21] For the impossibility result, we also use a special case of the GTA model called clock GTA [29] which is used to model systems with local clocks. While the simple timed ....

[Article contains additional citation context not shown here]

Nancy Lynch and Frits Vaandrager. Forward and backward simulations --- Part II: Timing-based systems. Information and Computation, 128(1):1--25, July 1996. Also,

No context found.

Nancy Lynch and Frits Vaandrager. Forward and backward simulations --- Part II: Timing-based systems. Technical Memo MIT/LCS/TM-487.c, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, April 1995.

....to SRM due to the elimination of the additional recovery latency incurred due to probabilistic suppression. 4. Design and Analysis Approach In contrast to traditional protocol design techniques, we use a rigorous design approach that is based on the timed I O automaton specification model [4] and the associated correctness and performance reasoning techniques. The first step in this approach is to precisely specify the highlevel reliable multicast service. These abstract specifications constitute the metric for showing that a reliable multicast protocol is correct. The next step ....

N. A. Lynch and F. Vaandrager. Forward and Backward Simulations --- Part II: Timing-Based Systems. Information and Computation, 128(1):1--25, July 1996.

....MIT, LCS, Cambridge, MA 02139, USA, lynch theory.lcs.mit.edu CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands, fritsv cwi.nl Keywords: Real time; process algebra; action transducers; timed automata; timed trace inclusion; congruence properties Abstract. The timed automaton model of [LV92, LV93] is a general model for timing based systems. A notion of timed action transducer is here defined as an automata theoretic way of representing operations on timed automata. It is shown that two timed trace inclusion relations are substitutive with respect to operations that can be described by ....

....to operations that can be described by timed action transducers. Examples are given of operations that can be described in this way, and a preliminary proposal is given for an appropriate language of operators for describing timing based systems. 1. Introduction The timed automaton model of [LV92, LV93] is a general model for timing based systems. It is intended as a basis for formal reasoning about such systems, in particular, for verification of their correctness and for analysis of their complexity. In [LV92, LV93] we develop a full range of simulation proof methods for timed automata; ....

[Article contains additional citation context not shown here]

N.A. Lynch and F.W. Vaandrager. Forward and backward simulations -- part II: Timing-based systems. Report CS-R9314, CWI, Amsterdam, March 1993. Also, MIT/LCS/TM-487.b, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA. Submitted.

....to support a variety of verification techniques, including simulation methods, compositional reasoning, algebraic methods, and temporal logic methods. A successful technique for the verification of safety properties and some special liveness properties is based on the simulation method of [AL91a, LV91, LV93, LV95, Jon91], applied to the Input Output automaton model of [LT87] and to its generalization to the timed case [MMT91] I O automata are state machines with a labeled transition relation where the labels, also called actions , model communication. A key feature of I O automata is the explicit distinction ....

....GSSL94] we used the term environment freedom. Due to the close connection between environment freedom in our untimed model and receptiveness in other existing models, we have uniformed our terminology to the existing literature. others, our models support the simulation based proof method of [AL91a, LV91, LV93, LV95, Jon91]. In [GSSL93] we show how the simulation based proof method can be used to handle liveness by means of an Execution Correspondence Theorem, which extracts from a simulation relation more information than just trace inclusion. Our models have already been used in [SLL93b, SLL93a] to verify a ....

[Article contains additional citation context not shown here]

Nancy Lynch and Frits Vaandrager. Forward and backward simulations -- Part II: Timingbased systems. Information and Computation, 121(2):214--233, September 1995.

No context found.

N. Lynch and F. Vaandrager. Forward and backward simulations -- Part II: Timing-based systems. Information and Computation, 128(1):1--25, July 1996.

No context found.

Lynch, N., Vaandrager, F.: Forward and backward simulations---part ii: Timingbased systems. Information and Computation 128 (1996) 1--25

No context found.

Nancy Lynch and Frits Vaandrager, Forward and backward simulations -- part II: Timing-based systems, Information and Computation 128(1) (1996), 1--25.

No context found.

Nancy Lynch and Frits Vaandrager, Forward and backward simulations -- part II: Timing-based systems, Information and Computation 128(1) (1996), 1--25.

No context found.

Nancy Lynch and Frits Vaandrager, Forward and backward simulations -- part II: Timing-based systems, Information and Computation 128(1) (1996), 1--25.

No context found.

N. Lynch and F. Vaandrager. Forward and backward simulations { Part II: Timing-based systems. Information and Computation, 128(1):1-25, 1996.

No context found.

N. Lynch and F. Vaandrager. Forward and backward simulations -- Part II: Timing-based systems. Information and Computation, 128(1):1--25, July 1996.

First 50 documents  Next 50

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