(Enter summary)
Abstract: This thesis presents a methodology based on simulations and invariants for proving timing
properties of real-time, distributed systems. This methodology is used to prove tight time
bounds for two systems, a leader election protocol for a ring of processes, and Fischer's
timing-based mutual exclusion algorithm. A framework for verifying these proofs using the
Larch tools is also developed, and the proof for Fischer's algorithm is checked within this
framework.
Many formal methods have been... (Update)
Context of citations to this paper: More
.... timed I O automaton model has focused on compositional properties [19] implementation relations [20] and semi automated proof checking [21] with less emphasis on syntactic forms, temporal logics, and fully automatic analysis. Just as timed I O automata have been extended to...
.... only safety properties, although the same methods can be used to handle liveness properties, formulated as time bounds (see, e.g. [22, 23]) 10 This section contains a specification of the problem of achieving private communication among the members of a finite collection...
Cited by: More
I/O Automaton Models and Proofs for Shared-Key Communication.. - Nancy Lynch Mit
(Correct)
Verifiable Code Generation from Abstract I/O Automata Models for.. - Tauber (2001)
(Correct)
Correctness of Vehicle Control Systems: A Case Study - Weinberg (1996)
(Correct)
Active bibliography (related documents): More All
0.9: Simulation Techniques For Proving Properties Of Real-Time Systems - Lynch (1993)
(Correct)
0.6: Verifying Timing Properties of Concurrent Algorithms - Victor Luchangco Ekrem (1995)
(Correct)
0.5: Action Transducers and Timed Automata - Lynch, Vaandrager (1992)
(Correct)
Similar documents based on text: More All
0.7: Time Optimal Self-Stabilizing Spanning Tree Algorithms - Aggarwal (1993)
(Correct)
0.6: Identifying and Merging Related Bibliographic Records - Hylton (1996)
(Correct)
0.5: Phonological Parsing for Bi-directional.. - Meng (1995)
(Correct)
Related documents from co-citation: More All
15: Specifying and using a partitionable group communication service
- Fekete, Lynch et al. - 1997
13: Forward and backward simulations -- Part II: Timing-based systems
- Lynch, Vaandrager
11: The generalized railroad crossing: A case study in formal verification of real-t..
- Heitmeyer, Lynch - 1994
BibTeX entry: (Update)
Victor Luchangco. Using simulation techniques to prove timing properties. Master's thesis, Massachusetts Institute of Technology, June 1995. http://citeseer.ist.psu.edu/luchangco95using.html More
@misc{ luchangco95using,
author = "V. Luchangco",
title = "Using simulation techniques to prove timing properties",
text = "Victor Luchangco. Using simulation techniques to prove timing properties.
Master's thesis, Massachusetts Institute of Technology, June 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/luchangco95using.html" }
Citations (may not include all citations):
716
Parallel Program Design: A Foundation (context) - Chandy, Misra - 1988
447
Prentice Hall International (context) - Milner, Concurrency et al. - 1989
397
Design and synthesis of synchronization skeletons using bran.. (context) - Clarke, Emerson - 1981
299
Model-checking for realtime systems (context) - Alur, Courcoubetis et al. - 1990
293
Hierarchical correctness proofs for distributed algorithms
- Lynch, Tuttle - 1987
268
Larch: Languages and Tools for Formal Specification (context) - Guttag, Horning - 1993
231
Information Processing Letters (context) - Alpern, Schneider - 1985
230
Fault-tolerant broadcasts and related problems (context) - Hadzilacos, Toueg - 1993
223
Assigning meanings to programs (context) - Floyd - 1967
199
An introduction to input/output automata (context) - Lynch, Tuttle - 1989
184
Automata for modeling real-time systems (context) - Alur, Dill - 1990
172
A really temporal logic
- Alur, Henzinger - 1989
148
A fast mutual exclusion algorithm
- Lamport - 1987
147
Real-time logics: Complexity and expressiveness
- Alur, Henzinger - 1990
142
Solution of a problem in concurrent programming control (context) - Dijkstra - 1965
134
A distributed algorithm for minimum-weight spanning trees (context) - Gallager, Humblet et al. - 1983
129
An overview and synthesis on timed process algebras (context) - Nicollin, Sifakis - 1991
118
Temporal Logic for Real-Time Systems (context) - Ostroff - 1989
107
A new solution of Dijkstra's concurrent programming problem (context) - Lamport - 1974
98
Forward and backward simulations--- Part II: Timing-based sy..
- Lynch, Vaandrager
97
Strong and weak virtual synchrony in Horus (context) - Friedman, van Renesse - 1995
95
Forward and backward simulations--- Part I: Untimed systems
- Lynch, Vaandrager
92
Reasoning about time in higher-level language software
- Shaw - 1989
90
Time constrained automata
- Merritt, Modugno et al. - 1991
90
Modeling and Verification of Randomized Distributed RealTime.. (context) - Segala - 1995
80
an interleaving model for real time systems (context) - Wang, time - 1991
69
Using mappings to prove timing properties
- Lynch, Attiya - 1992
62
DEC Systems Research Center (context) - Lamport, logic et al. - 1991
58
Explicit clock temporal logic (context) - Harel, Lichtenstein et al. - 1990
54
Distributed computing: Models and methods (context) - Lamport, Lynch - 1990
51
Mechanical verification of concurrent systems with TLA
- Engberg, Grnning et al. - 1992
47
Optimal synchronous capacity allocation for hard real-time c..
- Chen, Agrawal et al. - 1992
45
IEEE Transactions on Software Engineering (context) - Lam, Shankar et al. - 1984
43
An improved algorithm for decentralized extrema-finding in c.. (context) - Chang, Roberts - 1979
41
Scheduling sporadic tasks with shared resources in hard-real..
- Jeffay - 1992
40
Real-time programming and asynchronous message passing (context) - Koymans, Vytopil et al. - 1983
40
Automatic verification of realtime communicating systems by ..
- Wang, Pettersson et al. - 1994
36
The existence of refinement mappings (context) - Abadi, Lamport - 1991
35
Verification of real-time systems using PVS
- Shankar - 1993
35
Temporal proof methodologies for timed transition systems
- Henzinger, Manna et al. - 1994
33
Economical solutions for the critical section problem in a d.. (context) - Peterson, Fischer - 1977
32
The non-blocking write protocol nbw: A solution to a real-ti.. (context) - Kopetz, Reisinge - 1993
31
Proving real-time properties of programs with temporal logic (context) - Bernstein, Harter - 1981
31
DEC Systems Research Center (context) - Garland, Guttag et al. - 1991
26
Simulation techniques for proving properties of real-time sy..
- Lynch - 1993
25
Timing-based mutual exclusion
- Lynch, Shavit - 1992
24
An old-fashioned recipe for real time
- Abadi, Lamport - 1992
24
Research on automatic verification of finitestate concurrent.. (context) - Clarke, Grumberg - 1987
24
What good are models and what models are good (context) - Schneider - 1993
21
Bounds on shared memory for mutual exclusion
- Burns, Lynch - 1993
18
Implementing sequentially consistent shared objects using br..
- Fekete, Kaashoek et al. - 1995
17
Verifying timing properties of concurrent algorithms
- Luchangco, Soylemez et al. - 1994
17
Verification and specification of concurrent programs
- Lamport - 1993
16
Uniform actions in asynchronous distributed systems
- Malki, Birman et al. - 1994
15
Time-dependent distributed systems: Proving safety (context) - Shankar, Lam - 1987
15
A bandwidth allocation scheme for time constrained message t..
- Mukherjee, Saha et al. - 1993
15
Timing requirements for time-driven systems using augmented .. (context) - Coolahan, Roussopoulus - 1983
15
Performance effects of information sharing in a distributed .. (context) - Zhou - 1992
11
Design and performance of Horus: A lightweight group communi..
- van Renesse, Hickey et al. - 1994
10
Massachusetts Institute of Technology (context) - Lynch, Patt-Shamir et al. - 1993
10
An introduction to timed CSP (context) - Davies, Schneider - 1989
10
IEEE Transactions on Software Engineering (context) - Haase, of - 1981
8
Formal verification of timed properties for randomized distr.. (context) - Pogosyants, Segala - 1995
7
towards a formal approach (context) - LeLann - 1977
5
Formal verification of data type refinement (context) - Nipkow - 1989
5
Automatic verification of the timing properties of MMT autom.. (context) - Soylemez - 1994
3
A simple assertional proof system for real-time systems (context) - Shankar - 1992
3
Principles for computer system design (context) - Lampson - 1993
3
Incorporating specialized theories into a general purpose th.. (context) - Pogosyants - 1995
2
Temporal verification and simulation and refinement (context) - Kesten, Manna et al. - 1993
2
Bounded concurrent time-stamping made simple (context) - Gawlick - 1992
2
Correctness of communication protocols: A case study (context) - Sgaard-Andersen, Lynch et al. - 1993
1
mail to Leslie Lamport (context) - Fischer, Where et al. - 1985
1
Correctness of at-most-once message delivery protocols (context) - Sgaard-Andersen, Lynch et al. - 1993
1
Assertional verification of a timer based protocol (context) - Tel - 1988
1
A latticestructured proof technique applied to a minimum spa.. (context) - Welch, Lamport et al. - 1988
1
A hundred impossiblility proofs for distributed computing (context) - Lynch - 1989
The graph only includes citing articles where the year of publication is known.
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