Model checking the time to reach agreement

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

Volumn 3829 LNCS, Issue , 2005, Pages 98-111

  Hendriks, Martijn ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FINITE AUTOMATA; MATHEMATICAL MODELS;

DISTRIBUTED SYSTEMS; MODEL CHECKERS; PROBLEMATIC SUBCLASS; TIMED SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33745476121     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11603009_9     Document Type: Conference Paper

References (24)

1. Lynch, N.A., Tuttle, M.R.: An introduction to Input/Output automata. CWI-Quarterly 2 (1989) 219-246
2. Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: PODC'87. (1987) 137-151 A full version is available as MIT Technical Report MIT/LCS/TR-387.
3. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers (1996)
4. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press (2000)
5. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126 (1994) 183-235
6. Kaynar, D.K., Lynch, N.A., Segala, R., Vaandrager, F.W.: A framework for modelling timed systems with restricted hybrid automata. In: RTSS'03, IEEE Computer Society Press (2003) 166-177 A full version is available as MIT Technical Report MIT/LCS/TR-917.
7. Tanenbaum, A.S.: Computer Networks. Prentice-Hall (1996)
8. Chkliaev, D., Hooman, J., de Vink, E.: Verification and improvement of the sliding window protocol. In: TACAS'03. Number 2619 in LNCS, Springer-Verlag (2003) 113-127
9. Bodlaender, M., Guidi, J., Heerink, L.: Enhancing discovery with liveness. In: CCNC'04, IEEE Computer Society Press (2004)
10. Katoen, J.P., Bohnenkamp, H., Klaren, R., Hermanns, H.: Embedded software analysis with MOTOR. In: SFM'04. Number 3185 in LNCS, Springer-Verlag (2004) 268-293
11. Bohnenkamp, H., Gorter, J., Guidi, J., Katoen, J.P.: Are you still there? A lightweigth algorithm to monitor node absence in self-configuring networks. In: Proceedings of DSN 2005. (2005)
12. Cheshire, S., Aboba, B., Guttman, E.: Dynamic configuration of IPv4 linklocal addresses (2004) http://www.ietf.org/internet-drafts/draft-ietf- zeroconf-ipv4-linklocal-17.txt.
13. Zhang, M., Vaandrager, F.: Analysis of a protocol for dynamic configuration of IPv4 link local addresses using Uppaal. Technical report, NIII, Radboud University Nijmegen (2005) To appear.
14. Attiya, H., Dwork, C., Lynch, N.A., Stockmeyer, L.: Bounds on the time to reach agreement in the presence of timing uncertainty. Journal of the ACM 41 (1994) 122-152
15. Lamport, L.: Real-time model checking is really simple. In Borrione, D., Paul, W., eds.: CHARME 2005. LNCS, Springer (2005) To appear.
16. Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: SFM'04. Volume 3185 of LNCS., Springer (2004) 200-236
17. Bengtsson, J., Yi, W.: Timed automata: Semantics, algorithms and tools. In Desel, J., Reisig, W., Rozenberg, G., eds.: Lectures on Concurrency and Petri Nets: Advances in Petri Nets. Number 3098 in LNCS, Springer-Verlag (2004) 87-124
18. Alur, R., Courcoubetis, C., Dill, D.L.: Model checking in dense real time. Information and Computation 104 (1993) 2-34
19. Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Automatic Verification Methods for Finite State Systems. Number 407 in LNCS, Springer-Verlag (1989) 197-212
20. Hendriks, M., Behrmann, G., Larsen, K.G., Niebert, P., Vaandrager, F.W.: Adding symmetry reduction to Uppaal. In: FORMATS'03. Number 2791 in LNCS, Springer-Verlag (2004) 46-59
21. Behrmann, G., Bouyer, P., Larsen, K.G., Pelańek, R.: Lower and upper bounds in zone based abstractions of timed automata. In: TACAS'04. Number 2988 in LNCS, Springer-Verlag (2004) 312-326
22. Christensen, A., Kristensen, L.M., Mailund, T.: A sweep-line method for state space exploration. In: TACAS'01. Number 2031 in LNCS, Springer-Verlag (2001) 450-464
23. Behrmann, G., Hune, T., Vaandrager, F.W.: Distributed timed model checking how the search order matters. In: CAV'00. Number 1855 in LNCS, Springer-Verlag (2000) 216-231
24. Behrmann, G.: Distributed reachability analysis in timed automata. Software Tools for Technology Transfer 7 (2005) 19-30