Bridging the gap between fair simulation and trace inclusion

Information and Computation

Volumn 200, Issue 1, 2005, Pages 35-61

  Kesten, Yonit ^a   Piterman, Nir ^b,c   Pnueli, Amir ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c EPFL   (Switzerland)

Author keywords

Fair simulation; Streett automata; Trace inclusion

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; AUTOMATA THEORY; COMPUTER SIMULATION; INCLUSIONS; PROBLEM SOLVING;

FAIR SIMULATION; FINITE STATE SYSTEMS; STREETT AUTOMATA; TRACE INCLUSION;

DISCRETE TIME CONTROL SYSTEMS;

EID: 19844382993     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2005.01.006     Document Type: Article

References (40)

1. M. Abadi, and L. Lamport The existence of refinement mappings Theor. Comput. Sci. 82 2 1991 253 284
2. R. Alur, S. La Torre, P. Madhusudan, Playing games with boxes and diamonds, in: Proc. 14th International Conference on Cuncurrency Theory vol. 2761 of Lect. Notes in Comput. Sci., Springer-Verlag, Berlin, 2003, pp. 127-141
3. B. Bloom, and R. Paige Transformational design and implementation of a new efficient solution to the ready simulation problem Sci. Comput. Programming 24 1996 189 220
4. R. Bryant Graph-based algorithms for Boolean function manipulation IEEE Trans. Comput. C 35 12 1986 1035 1044
5. Y. Choueka Theories of automata on ω-tapes: a simplified approach J. Comp. Syst. Sci. 8 1974 117 141
6. L. de Alfaro, T. Henzinger, R. Majumdar, From verification to control: dynamic programs for omega-regular objectives, in: Proc. 16th IEEE symposium logic in computer science, 2001
7. E. Emerson Model checking and the μ-calculus N. Immerman P. Kolaitis Descriptive complexity and finite models 1997 American Mathematical Society Providence, RI 185 214
8. E. Emerson, and E. Clarke Characterizing correctness properties of parallel programs using fixpoints Proc. 7th Int. colloq. aut. lang. prog. vol. 85 of lect. notes in comput. sci. 1980 Springer-Verlag Berlin 169 181
9. E.A. Emerson, C.L. Lei, Efficient model-checking in fragments of the propositional modal μ-calculus, in: Proc. First IEEE Symp. Logic in Comput. Sci., 1986, pp. 267-278
10. O. Grumberg, and D. Long Model checking and modular verification ACM Trans. Programming Lang. Syst. 16 3 1994 843 871
11. Y. Gurevich, L. Harrington, Automata, trees and games, in: Proc. 14th ACM Symp. Theory of Comput, 1982, pp. 60-65
12. M. Henzinger, T. Henzinger, and P. Kopke Computing simulations on finite and infinite graphs Proc. 36th IEEE symp. found. of comput. sci. 1995 IEEE Computer Society Press Silver Spring, MD 453 462
13. T. Henzinger, O. Kupferman, S. Rajamani, Fair simulation, in: Proc. 8th International Conference on Concurrency Theory vol. 1243 of Lect. Notes in Comput. Sci., Springer-Verlag, Berlin, 1997, pp. 273-287
14. T. Henzinger, S. Rajamani, Fair bisimulation, in: S. Graf, M. Schwartzbach (Eds.), Proc. 6th Intl. Conference on Tools and Algorithms for the Construction and Analysis of Systems vol. 1785 of Lect. Notes in Comput. Sci. Springer-Verlag, Berlin, 2000, pp. 299-314
15. M. Jurdzinski, Small progress measures for solving parity games, in: Proc. 17th Annual Symposium on Theoretical Aspects of Computer Science volume 1770 of Lect. Notes in Comput. Sci., Springer-Verlag, 2000, pp. 290-301
16. Y. Kesten, N. Piterman, A. Pnueli, Bridging the gap between fair simulation and trace inclusion, in: W. Hunt Jr., F. Somenzi, (Eds.), Proc. 15th Intl. Conference on Computer Aided Verification 2003, pp. 381-392
17. Y. Kesten, and A. Pnueli Control and data abstractions: the cornerstones of practical formal verification Software Tools Technol. Transfer 2 1 2000 328 342
18. Y. Kesten, and A. Pnueli Verification by augmented finitary abstraction Inform. Comput. 163 2000 203 243
19. Y. Kesten, A. Pnueli, and L. Raviv Algorithmic verification of linear temporal logic specifications K. Larsen S. Skyum G. Winskel Proc. 25th int. colloq. aut. lang. prog. vol. 1443 of lect. notes in comput. sci. 1998 Springer-Verlag Berlin 1 16
20. Y. Kesten, A. Pnueli, E. Shahar, L. Zuck, Network invariants in action, in: Proc. 13th International Conference on Concurrency Theory vol. 2421 of Lect. Notes in Comput. Sci., Springer-Verlag, Berlin, 2002, pp. 101-105
21. D. Kozen Results on the propositional μ-calculus Theor. Comput. Sci. 27 1983 333 354
22. O. Kupferman, N. Piterman, M. Vardi, Fair equivalence relations, in: S. Kapoor, S. Prasad (Eds.), in: Proc. 20th Conf. Foundations of Software Technology and Theoretical Computer Science vol. 1974 of Lect. Notes in Comput. Sci., Springer-Verlag, Berlin, 2000, pp. 151-163
23. O. Kupferman, M. Vardi, Weak alternating automata and tree automata emptiness, in Proc. 30th ACM Symp. Theory of Comput. Dallas, 1998, pp. 224-233
24. O. Lichtenstein, Decidability, Completeness, and Extensions of Linear Time Temporal Logic. PhD thesis, Weizmann Institute of Science, 1991
25. K. Lodaya, P. Thiagarajan, A modal logic for a subclass of events structures, in: Proc. 14th Int. Colloq. Aut. Lang. Prog. vol. 267 of Lect. Notes in Comput. Sci., Springer-Verlag, Berlin, 1987, pp. 290-303
26. D. Long, A. Brown, E. Clarke, S. Jha, W. Marrero, An improved algorithm for the evaluation of fixpoint expressions, in: D. Dill (Ed.), Proc. 6th Intl. Conference on Computer Aided Verification vol. 818 of Lect. Notes in Comput. Sci., Springer-Verlag, Berlin, 1994, pp. 338-350
27. Z. Manna, A. Anuchitanukul, N. Bjørner, A. Browne, E. Chang, M. Colón, L. D. Alfaro, H. Devarajan, H. Sipma, T. Uribe. STeP: The Stanford Temporal Prover. Technical Report STAN-CS-TR-94-1518, Dept. of Comput. Sci., Stanford University, Stanford, California, 1994
28. Z. Manna, and A. Pnueli Temporal verification of reactive systems: Safety 1995 Springer-Verlag New York
29. A. Melton, D. Schmidt, D. Strecker, Galois connections and computer science applications, in: D. Pitt, S. Abramsky, A. Poigne, D. Rydeheard (Eds.), Category Theory and Computer programming vol. 240 of Lect. Notes in Comput. Sci., Springer-Verlag, Berlin, 1986, pp. 299-312
30. R. Milner An algebraic definition of simulation between programs Proceedings on second international joint conference on artificial intelligence 1971 British Computer Society 481 489
31. A. Pnueli, The temporal logic of programs, in: Proc. 18th IEEE Symp. Found. of Comput. Sci., 1977, pp. 46-57
32. A. Pnueli, E. Shahar, A platform for combining deductive with algorithmic verification, in: R. Alur, T. Henzinger (Eds.), Proc. 8th Intl. Conference on Computer Aided Verification vol. 1102 of Lect. Notes in Comput. Sci. Springer-Verlag, 1996, pp. 184-195
33. S. Safra, Exponential determinization for ω-automata with strong-fairness acceptance condition, in: Proc. 24th ACM Symp. on Theory of Computing, 1992
34. H. Seidl Fast and simple nested fixpoints Info. Proc. Lett. 59 6 1996 303 308
35. R. Streett Propositional dynamic logic of looping and converse is elementarily decidable Inform. Control 54 1982 121 141
36. M. Vardi, Personal communication, 2001
37. M. Vardi, and P. Wolper Reasoning about infinite computations Inform. Control 115 1 1994 1 37
38. M.Y. Vardi Verification of concurrent programs-the automata-theoretic framework Ann. Pure Appl. Logic 51 1991 79 98
39. P. Wolper Temporal logic can be more expressive Inform. Control 56 1983 72 99
40. P. Wolper, V. Lovinfosse, Verifying properties of large sets of processes with network invariants, in: J. Sifakis (Ed.), Automatic Verification Methods for Finite State Systems vol. 407 of Lect. Notes in Comput. Sci., Springer-Verlag, Berlin, 1989, pp. 68-80