Monitoring distributed controllers: When an efficient LTL algorithm on sequences is needed to model-check traces

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

Volumn 4085 LNCS, Issue , 2006, Pages 557-572

  Genon, Alexandre ^a   Massart, Thierry ^a   Meuter, Cédric ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Global properties; Model checking of traces; Monitor; Testing of asynchronous distributed systems

Indexed keywords

CODES (SYMBOLS); COMPUTER SIMULATION; CONCURRENT ENGINEERING; DISTRIBUTED COMPUTER SYSTEMS; TESTING;

GLOBAL PROPERTIES; MODEL CHECKING OF TRACES; TESTING OF ASYNCHRONOUS DISTRIBUTED SYSTEMS;

LEARNING ALGORITHMS;

EID: 33749373867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11813040_37     Document Type: Conference Paper

References (36)

1. [APP95] Rajeev Alur, Doron Peled, and Wojciech Penczek. Model checking of causality properties. In Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (LICS'95), pages 90-100, San Diego, California, 1995.
2. [Bry92] Randal E. Bryant. Symbolic boolean manipulation with ordered binarydecision diagrams. ACM Corn-put. Surv., 24(3):293-318, 1992.
3. [CCG+02] Alessandro Cimatti, Edmund M. Clarke, Enrico Giunchiglia, Fausto Giunchiglia, Marco Pistore, Marco Roveri, Roberte Sebastiani, and Armando Tacchella. Nusmv 2: An opensource tool for symbolic model checking. In CAV, pages 359-364, 2002.
4. [CDF95] Bernadette Charron-Bost, Carole Delporte-Gallet, and Hugues Fauconnier. Local and temporal predicates in distributed systems. ACM Trans. Program. Lang. Syst., 17(1), 1995.
5. [CG98] Craig M. Chase and Vijay K. Garg. Detection of global predicates: Techniques and their limitations. Distributed Computing, 11 (4): 191-201, 1998.
6. [CGP99] E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999.
7. [CL85] K. Mani Chandy and Leslie Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst., 3(1):63-75, 1985.
8. [DG02] Volker Diekert and Paul Gastin. LTL is expressively complete for Mazurkiewicz traces. Journal of Computer and System Sciences, 64(2):396-418, March 2002.
9. [DGMM05] Brani De Wachter, Alexandre Genon, Thierry Massart, and Cédric Meuter. The formal design of distributed controllers with dsl and spin. Formal Aspects of Computing, 17(2):177-200, 2005. (24 pages).
10. [DMM04] Bram De Wachter, Thierry Massart, and Cédric Meuter, dsl : An environment with automatic code distribution for industrial control systems. In Lecture Notes in Computer Sciences, volume 3144, pages 132-145. Springer, 2004. (14 pages).
11. [DRV04] Giorgio Delzanno, Jean-François Raskin, and Laurent Van Begin. Covering sharing trees: a compact data structure for parameterized verification. STTT, 5(2-3):268-297, 2004.
12. [ERV96] Javier Esparza, Stefan Römer, and Walter Vogler. An improvement of mcmillan's unfolding algorithm. In TACAS, pages 87-106, 1996.
13. [Gan02] Pierre Ganty. Algorithmes et structures de données efficaces pour la manipulation de contraintes sur les intervalles. Master's thesis, Université Libre de Bruxelles, 2002.
14. [GM01] Vijay K. Garg and Neeraj Mittal. On slicing a distributed computation. In ICDCS, pages 322-329, 2001.
15. [GMM06] Alexandre Genon, Thierry Massart, and Cédric Meuter. Monitoring distributed controllers : When an efficient Itl algorithm on sequences is needed to model-check traces. Technical Report 2006-59, CFV - Université Libre de Bruxelles, 2006.
16. [God96] P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem, volume 1032 of Lecture Notes in Computer Science. Springer, 1996.
17. [GW94] Vijay K. Garg and Brian Waldecker. Detection of weak unstable predicates in distributed programs. IEEE Trans. Parallel Distrib. Syst., 5(3):299-307, 1994.
18. [GW96] Vijay K. Garg and Brian Waldecker. Detection of strong unstable predicates in distributed programs. IEEE Trans. Parallel Distrib. Syst., 7(12):1323-1333, 1996.
19. [Hol97] Gerard J. Holzmann. The model checker spin. IEEE Trans. Software Eng., 23(5):279-295, 1997.
20. [Lam78] Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558-565, 1978.
21. [LMC01] M. Leuschel, T. Massart, and A. Currie. How to make fdr spin : Ltl model checking of csp by refinement. In Lecture Notes in Computer Sciences, volume 2021, pages 99-118. Springer, 2001. (20 pages).
22. [Lyn96] Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1996.
23. [Mat89] Friedemann Mattern. Virtual time and global states of distributed systems. In Cosnard M. et al., editor, Proc. Workshop on Parallel and Distributed Algorithms, pages 215-226, North-Holland / Elsevier, 1989.
24. [Maz86] Antoni W. Mazurkiewicz. Trace theory. In Advances in Petri Nets, pages 279-324, 1986.
25. [McM92a] K. L. McMillan. Symbolic model checking: an approach to the state explosion problem. Carnegie Mellon University, 1992.
26. [McM92b] K.L. McMillan. The smv system. Technical Report CMU-CS-92-131, Carnegie Mellon University, 1992.
27. [McM95] Kenneth L. McMillan. A technique of state space search based on unfolding. Formal Methods in System Design, 6(1):45-65, 1995.
28. [MG01] Neeraj Mittal and Vijay K. Garg. Computation slicing: Techniques and theory. In DISC, pages 78-92, 2001.
29. [MG05] Neeraj Mittal and Vijay K. Garg. Techniques and applications of computation slicing. Distributed Computing, 17(3):251-277, 2005.
30. [SG03] Alper Sen and Vijay K. Garg. Detecting temporal logic predicates in distributed programs using computation slicing. In OPODIS, pages 171-183, 2003.
31. [SRA04] Koushik Sen, Grigore Rosu, and Gul Agha. Online efficient predictive safety analysis of multithreaded programs. In TACAS, pages 123-138, 2004.
32. [SVAR04] K. Sen, A. Vardhan, G. Agha, and G. Rosu. Efficient decentralized monitoring of safety in distributed systems. In Proceedings of 26th International Conference on Software Engineering (ICSE'04), Edinburgh, UK, pages 418-427. IEEE, May 2004.
33. [Thi94] P. S. Thiagarajan. A trace based extension of linear time temporal logic. In Samson Abramsky, editor, Proceedings of the Ninth Annual IEEE Symp. on Logic in Computer Science, LICS 1994, pages 438-447. IEEE Computer Society Press, July 1994.
34. [TW02] P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for mazurkiewicz traces. Inf. Comput., 179(2):230-249, 2002.
35. [Val93] Antti Valmari. On-the-fly verification with stubborn sets. In CA V, pages 397-408, 1993.
36. [VW86] M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st Symp. on Logic in Computer Science, pages 332-344, Cambridge, June 1986.