N. Lynch and R. Segala. A Comparison of Simulation Techniques and Algebraic Techniques for Verifying Concurrent Systems. Journal of Formal Aspects of Computing Science, 7(3):231-265, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Composition and Refinement of Discrete Real-Time Systems - Ostroff (1998) (4 citations) (Correct)
....machines for multilevel specifications. The automata based tool COSPAN has recently been extended to deal with real time [3] COSPAN supports top down development through successive refinements and homomorphic reduction [15] Timed automata [30] see also the input output automata described in [29]) have visible actions, a time passage action (analogous to our clock tick) and a special internal action. Dense upper bounds can be imposed between actions, but not lower time bounds. A refinement from one timed automaton to another is a time preserving function similar to the classical notion of ....
Lynch, N. and R. Segala. "A Comparison of Simulation Techniques and Algebraic Techniques for Verifying Concurrent Systems." Formal Aspects of Computing, 7(3): 231-265, 1995.
Fair Simulation - Henzinger, Kupferman, Rajamani (1998) (18 citations) (Correct)
....is evidence that most practical specifications fairly simulate their implementations. In particular, since fair simulation is implied by 8 simulation, the fair simulation condition can be used as an efficient check to verify distributed protocols that have been verified using 8 simulation [Lam83, LS93, Lyn96] ffl In the degenerate case of vacuous fairness constraints, fair simulation coincides with simulation. In the degenerate case of deterministic systems, fair simulation coincides with fair trace containment. ....
N.A. Lynch, R. Segala. A Comparison of Simulation Techniques and Algebraic Techniques for Verifying Concurrent Systems. Technical Report MIT/LCS/TM-499, Massachusetts Institute Technology, 1993.
Fair Simulation - Henzinger, Kupferman, Rajamani (1997) (18 citations) (Correct)
....is evidence that most practical specifications fairly simulate their implementations. In particular, since fair simulation is implied by 8 simulation, the fair simulation condition can be used as an efficient check to verify distributed protocols that have been verified using 8 simulation [Lam83, LS93, Lyn96] ffl In the degenerate case of vacuous fairness constraints, fair simulation coincides with simulation. In the degenerate case of deterministic systems, fair simulation coincides with fair trace containment. We note that in process algebra, several other preorders and equivalences on ....
N.A. Lynch, R. Segala. A Comparison of Simulation Techniques and Algebraic Techniques for Verifying Concurrent Systems. Technical Report MIT/LCS/TM-499, Massachusetts Institute Technology, 1993.
Fair Simulation - Henzinger, Kupferman, Rajamani (1997) (18 citations) (Correct)
....is evidence that most practical specifications fairly simulate their implementations. In particular, since fair simulation is implied by 8 simulation, the fair simulation condition can be used as an efficient check to verify distributed protocols that have been verified using 8 simulation [Lam83, LS93, Lyn96] In the degenerate case of vacuous fairness constraints, fair simulation coincides with simulation. In the degenerate case of deterministic systems, fair simulation coincides with fair trace containment. We note that in process algebra, several other preorders and equivalences on ....
N.A. Lynch and R. Segala. A comparison of simulation techniques and algebraic techniques for verifying concurrent systems. Technical Report MIT/LCS/TM-499, Laboratory for Computer Science, MIT, 1993.
The Essence of Coin Lemmas - Segala (1998) (2 citations) Self-citation (Segala) (Correct)
....of stochastic process takes place in each computation and that some specific results of the stochastic process that is taking place lead to success. Unfortunately, the process of mapping a stochastic process onto the computations of an algorithm has turned out to be very hard and prone to errors [9, 1]. Coin lemmas are one of the tools that allow us to map stochastic processes onto probabilistic executions, possibly without running into traps. In this paper we discuss the main idea behind coin lemmas and we propose several coin lemmas of increasing complexity and generality. We also compare our ....
N.A. Lynch and R. Segala. A comparison of simulation techniques and algebraic techniques for verifying concurrent systems. In Proceedings of the Second North American Process Algebra Workshop, Cornell University, NY, 1993. An extended version appears as technical memo MIT/LCS/TM-499.
An Algebraic Approach to Fault Tolerant Distributed Computing - Fuzzati (2004) (Correct)
No context found.
N. Lynch and R. Segala. A Comparison of Simulation Techniques and Algebraic Techniques for Verifying Concurrent Systems. Journal of Formal Aspects of Computing Science, 7(3):231-265, 1995.
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