On bounded specifications

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

Volumn 2250, Issue , 2001, Pages 24-38

  Kupferman, Orna ^a   Vardi, Moshe Y ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; CALCULATIONS; FORESTRY; MODEL CHECKING; SPECIFICATIONS;

BOUNDED MODEL; BRANCHING DEGREE; MODAL LOGIC; MU-CALCULUS; TEMPORAL LOGIC FORMULA; TREE AUTOMATA; WORD AUTOMATA;

TEMPORAL LOGIC;

EID: 84937441190     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_2     Document Type: Conference Paper

References (45)

1. B. Alpern and F. B. Schneider. Defining liveness. IPL, 21:181-185, 1985.
2. B. Alpern and F. B. Schneider. Recognizing safety and liveness. Distributed computing, 2:117-126, 1987.
3. J. Benthem and J. Bergstra. Logic of transition systems. Technical Report P9308, Programing research group, University of Amsterdam, 1993.
4. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proc. 36th DAC, pp. 317-320, 1999.
5. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TACAS, LNCS 1579, 1999.
6. A. Biere, E. M. Clarke, R. Raimi, and Y. Zhu. Verifying safety properties of a PowerPC[tm] microprocessor using symbolic model checking without BDDs. In Proc. 11th CAV, LNCS 1633, pp. 172-183, 1999.
7. J. Benthem. Languages in actions: categories, lambdas and dynamic logic. Studies in Logic, 130, 1991.
8. A. Bouajjani, J.-C. Fernandez, S. Graf, C. Rodriguez, and J. Sifakis. Safety for branching semantics. In Proc. 18thICALP, LNCS, pp. 76-92, 1991.
9. R. Bloem, H. N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in n log n symbolic steps. In FMCAD, LNCS 1954, pp. 37-54, 2000.
10. J. Barwise and Y. N. Moschovakis. Global inductive definability. Journal of Symbolic Logic, 43(3):521-534, 1978.
11. J. C. Bradfield. The modal μ-calculus alternation hierarchy is strict. Theoretical Computer Science, 195(2):133-153, March 1998.
12. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
13. E. A. Emerson and J. Y. Halpern. Sometimes and not never revisited: On branching versus linear time. JACM, 33(1):151-178, 1986.
14. E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional μ-calculus. In Proc. 1st LICS, pp. 267-278, 1986.
15. E. A. Emerson. Alternative semantics for temporal logics. Theoretical Computer Science, 26:121-130, 1983.
16. M. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W. Freeman and Co., San Francisco, 1979.
17. H. P. Gumm. Another glance at the Alpern-Schneider characterization of safety and liveness in concurrent executions. IPL, 47:291-294, 1993.
18. R. H. Hardin, R. P. Kurshan, S. K. Shukla, and M. Y. Vardi. A new heuristic for bad cycle detection using BDDs. In Proc. 9th CAV, LNCS 1254, pp. 268-278, 1997.
19. H. J. Hoogeboom and G. Rozenberg. Infinitary languages: basic theory and applications to concurrent systems. In Proc. Advanced School on Current Trends in Concurrency, LNCS 224, pp. 266-342, 1986.
20. D. Janin and I. Walukiewicz. Automata for the modal μ-calculus and related results. In wProc. 20th MFCS, LNCS, pp. 552-562, 1995.
21. E. Kindler. Safety and liveness properties: A survey. wEATCS, 53:268-272, 1994.
22. D. Kozen. Results on the propositional μ-calculus. TCS, 27:333-354, 1983.
23. R. P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
24. O. Kupferman and M. Y. Vardi. Model checking of safety properties. In Proc. 11th CAV, LNCS 1633, pp. 172-183, 1999.
25. O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. JACM, 47(2):312-360, March 2000.
26. L. Lamport. Sometimes is sometimes "not never" - on the temporal logic of programs. In Proc. 7thPOPL, pp. 174-185, 1980.
27. L. Lamport. Logical foundation. In Distributed systems - methods and tools for specification, LNCS 190, 1985.
28. L. H. Landweber. Decision problems for ω-automata. Mathematical Systems Theory, 3:376-384, 1969.
29. S. Miyano and T. Hayashi. Alternating finite automata on ω-words. Theoretical Computer Science, 32:321-330, 1984.
30. Z. Manna and A. Pnueli. The anchored version of the temporal framework. In Linear time, branching time, and partial order in logics and models for concurrency, LNCS 345, pp. 201-284, 1989.
31. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification., Berlin, January 1992.
32. P. Manolios and R. Trefler. Safety and liveness in branching time. In Proc. 16th LICS, 2001.
33. D. Niwiński. On fixed point clones. In Proc. 13th ICALP, LNCS 226, pp. 464-473, 1986.
34. M. Otto. Eliminating recursion in the μ-calculus. In Proc. 16th STACS, LNCS 1563, pp. 531-540, 1999.
35. M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115-125, 1959.
36. C. J. H. Seger and R. E. Bryant. Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Methods in System Design, 6:147-189, 1995.
37. A. P. Sistla. Safety, liveness and fairness in temporal logic. Formal Aspects of Computing, 6:495-511, 1994.
38. L. Staiger. ω-languages. Handbook of Formal Languages, pp. 339-388, 1997.
39. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pp. 165-191, 1990.
40. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, LNCS 1043, pp. 238-266, 1996.
41. M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182-221, April 1986.
42. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.
43. + is exponentially more succinct than CTL. In Proc. 19th FST&TCS, 1738, pp. 110-121, 1999.
44. T. Wilke. Classifying discrete temporal properties In Proc. 16th STACS, LNCS 1563, pp. 32-46, 1999.
45. J. Yang. A theory for generalized symbolic trajectory evaluation. In Symposium on Symbolic Trajectory Evaluation, Chicago, July 2000.