Model checking on trees with path equivalences

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

Volumn 4424 LNCS, Issue , 2007, Pages 664-678

  Alur, Rajeev ^a   Černý, Pavol ^a   Chaudhuri, Swarat ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); GAME THEORY; MATHEMATICAL MODELS; MODEL CHECKING; SPECIFICATIONS; TEMPORAL LOGIC; CALCULATIONS; FORESTRY;

BRANCHING-TIME; INFORMATION FLOW; PARTIAL INFORMATION GAMES; PATH EQUIVALENCES; BRANCHING TIME; INDISTINGUISHABILITY; INFORMATION FLOWS; MODEL CHECKING PROBLEM; OBSERVABLE BEHAVIOR; PARTIAL INFORMATION; PSPACE-COMPLETE; REACTIVE SYSTEM;

TREES (MATHEMATICS); MODEL CHECKING;

INFORMATION RETRIEVAL; MODELS; TREES; LOGIC; PROBLEM SOLVING; SYSTEMS;

EID: 37149023024     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_51     Document Type: Conference Paper

References (17)

1. R. Alur, P. Černý, and S. Zdancewic. Preserving secrecy under refinement. In Proc. of ICALP '06, pages 107-118, 2006.
2. R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):1-42, 2002.
3. 20 states and beyond. Information and Computation, 98(2): 142-170, 1992.
4. S. Chong and A. Myers. Decentralized robustness. In Proc. of CSFW'02, pages 242-256, 2006.
5. A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. NuSMV Version 2: An OpenSource Tool for Symbolic Model Checking. In Proc. of CAV'02, pages 359-364, 2002.
6. E. Clarke and E. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, pages 52-71, 1981.
7. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http ://www.grappa.univ-lille3.fr/tata, 1997.
8. R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning About Knowledge. MIT Press, Cambridge, MA, USA, 1995.
9. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
10. O. Kupferman, M. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, 2000.
11. H. Lauchli and Ch. Savioz. Monadic second order definable relations on the binary tree. J. Symb. Log., 52(1):219-226, 1987.
12. A. Pnueli. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 46-77, 1977.
13. J. Reif. Universal games of incomplete information. In Proc. of STOC '79, pages 288-308, 1979.
14. F. Schneider, editor. Trust in Cyberspace. National Academy Press, 1999.
15. N. Shilov and N. Garanina. Model checking knowledge and fixpoints. In Proc. of FICS'02, pages 25-39, 2002.
16. R. van der Meyden. Common knowledge and update in finite environments. Information and Computation, 140(2):115-157, 1998.
17. R. van der Meyden and N. Shilov. Model checking knowledge and time in systems with perfect recall. In Proc. of FSTTCS'99, pages 432-445, 1999.