Convergence verification: From shared memory to partially synchronous systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5215 LNCS, Issue , 2008, Pages 218-232

  Chandy, K Mani ^a   Mitra, Sayan ^a   Pilotto, Concetta ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE PROPERTIES; DISCRETE-TIME; FORMAL MODELING; I/O-AUTOMATON; INTERNATIONAL CONFERENCES; PATTERN FORMATIONS; SHARED MEMORIES; STATE SPACES; SYNCHRONOUS DISTRIBUTED SYSTEMS; SYNCHRONOUS SYSTEMS; TIMED SYSTEMS;

MOBILE AGENTS; MODEL CHECKING; STATE SPACE METHODS; TIME SHARING SYSTEMS;

REAL TIME SYSTEMS;

EID: 53049094638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85778-5_16     Document Type: Conference Paper

References (20)

1. Tempo toolset, version 0.2.2 beta (January 2008), http://www.veromodo. com/
2. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183-235 (1994)
3. Archer, M., Heitmeyer, C., Sims, S.: TAME: A PVS interface to simplify proofs for automata models. In: Proceedings of UITP 1998 (July 1998)
4. Archer, M., Lim, H., Lynch, N., Mitra, S., Umeno, S.: Specifying and proving properties of timed I/O automata using Tempo. Design Aut. for Emb. Sys (to appear, 2008)
5. Bengtsson, J., Larsen, K.G., Larsson, F., Pettersson, P., Yi, W.: UPPAAL in 1995. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 431-434. Springer, Heidelberg (1996)
6. Blondel, V., Hendrickx, J., Olshevsky, A., Tsitsiklis, J.: Convergence in multiagent coordination consensus and flocking. In: CDC-ECC, pp. 2996-3000 (2005)
7. Blondel, V., Hendrickx, J., Olshevsky, A., Tsitsiklis, J.: Formations of mobile agents with message loss and delay (preprint, 2007), http://www.ist. caltech.edu/?mitras/research/2008/asynchcoord.pdf
8. Chatterjee, S., Seneta, E.: Towards consensus: some convergence theorems on repeated averaging. J. Applied Probability 14(1), 89-97 (1977)
9. Clavaski, S., Chaves, M., Day, R., Nag, P., Williams, A., Zhang, W.: Vehicle networks: achieving regular formation. In: ACC (2003)
10. Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288-323 (1988)
11. Hendriks, M.: Model checking the time to reach agreement. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 98-111. Springer, Heidelberg (2005)
12. Kaynar, D., Lynch, N., Mitra, S., Garland, S.: TIOA Language. MIT Computer Science and Artificial Intelligence Laboratory, Cambridge (2005)
13. Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F.: The Theory of Timed I/O Automata. Synthesis Lectures on CS. Morgan Claypool (November 2005)
14. Lamport, L.: Real-time model checking is really simple. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 162-175. Springer, Heidelberg (2005)
15. Lim, H., Kaynar, D., Lynch, N., Mitra, S.: Translating timed I/O automata specifications for theorem proving in PVS. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 17-31. Springer, Heidelberg (2005)
16. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)
17. Mitra, S., Chandy, K.M.: A formalized theory for verifying stability and convergence of automata in pvs. In: TPHOLs 2008 (to appear, 2008)
18. Olfati-Saber, R., Fax, J., Murray, R.: Consensus and cooperation in networked multi-agent systems. Proc. of the IEEE 95(1), 215-233 (2007)
19. Owre, S., Rajan, S., Rushby, J., Shankar, N., Srivas, M.: PVS: Combining specification, proof checking, and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 411-414. Springer, Heidelberg (1996)
20. Tsitsiklis, J.N.: On the stability of asynchronous iterative processes. Theory of Computing Systems 20(1), 137-153 (1987)