12 Modal mu-calculi

Studies in Logic and Practical Reasoning

Volumn 3, Issue , 2007, Pages 721-756

  Bradfield, Julian ^a   Stirling, Colin ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40949090581     PISSN: 15702464     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1570-2464(07)80015-2     Document Type: Article

References (70)

1. DAIMI PB - 445. Andersen H.R. Verification of Temporal Properties of Concurrent Systems (1993), Computer Science Dept, Aarhus University
2. Arnold A. Theμ-calculus alternation hierarchy is strict on binary trees. Theoretical Informatics and Applications 33 4/5 (1999) 329-340
3. Arnold A., and Niwinski D. Fixed point characterization of Biichi automata on infinite trees. J. Inf. Process. Cybern. EIK 26 (1990) 451-459
4. Arnold A., and Niwinski D. Rudiments of μ-Calculus. Studies in Logic (2001), North-Holland Vol. 146
5. Bhat G., and Cleaveland R. Efficient model checking via the equational mu-calculus. Proc. LICS '96 (1996) 304-312
6. Bradfield J.C. Verifying Temporal Properties of Systems (1991), Birkhäuser, Boston
7. Bradfield J.C. The modal mu-calculus alternation hierarchy is strict. Theor. Comput. Sci. 195 (1996) 4-312
8. Bradfield J.C. Simplifying the modal mu-calculus alternation hierarchy. Proc. STAGS 98 LNCS 1373 (1998) 39-49
9. Bradfield J.C. Alternation on the binary tree. In: Ésik Z. (Ed). Proc. 1st Int. Workshop on Fixpoints in Computer Science (FICS '98) (1998), Masaryk Univ. Brno 22-24
10. Bradfield J.C. Fixpoints in arithmetic, transition systems and trees. Theoretical Informatics and Applications 33 4/5 (1999) 341-356
11. Bradfield J.C., and P Stirling C. Local model checking for infinite state spaces. Theoret. Comput. Sci. 96 (1992) 57-174
12. Proc. 1960 congress. Biichi J.R. On a decision method in restricted second order arithmetic. Logic, Methodology and Philosophy of Science (1962), Stanford Univ. Press, Stanford, CA 1-11
13. Clarke E.M., and Emerson E.A. Design and synthesis of synchronization skeletons using branching time temporal logic. LNCS 131 (1981) 52-71
14. Clarke E.M., Emerson E.A., and Sistla A.P. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans, on Programming Languages and Systems 8 (1981) 244-263
15. d'Agostino G., and Hollenberg M. Logical questions concerning the μ-calculus: interpolation, Lyndon and Los-Tarski. J. Symbolic Logic 65 1 (2000) 310-332
16. Dam M. CTL* and ECTL* as fragments of the modal mu-calculus. Theoret. Comput. Sci. 126 (1994) 77-96
17. Dawar A., Grädel E., and Kreutzer S. Inflationary fixed points in modal logics. ACM Trans, on Computational Logic 5 2 (2004)
18. Ebbinghaus H.-D., and Flum J. Finite Model Theory. 2nd edition (1999), Springer
19. Emerson E.A. Temporal and modal logic. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science Volume B. (1990), Elsevier p]995-1072
20. Emerson E.A., and Clarke E.M. Characterizing correctness properties of parallel programs using fixpoints. Procs ICALP '80 LNCS 85 (1980) 169-181
21. Emerson E.A., and Jutla C.S. The complexity of tree automata and logics of programs. Proc. 29th IEEE FOCS (1988) 328-337
22. Emerson E.A., and Jutla C.S. Tree automata, mu-calculus and determinacy. Proc. 32nd IEEE FOCS (1991) 368-377
23. Emerson E.A., and Lei C.-L. Efficient model checking in fragments of the propositional mu-calculus. Proc. 1st IEEE LICS (1986) 267-278
24. Fischer M.J., and Ladner R.E. Propositional dynamic logic of regular programs. J. Computer and System Science 18 (1979) 194-211
25. Floyd R. Assigning meanings to programs. In: Schwartz J.T. (Ed). Mathematical Aspects of Computer Science (1967), American Mathematical Society, Providence 19-32
26. Grädel E. On the restraining power of guards. J. Symbol. Logic 64 (1999) 1719-1742
27. In: Grädel E., Thomas W., and Wilke T. (Eds). Automata, Logics, and Infinite Games, LNCS (2002) 2500
28. Grädel E., and Walukiewicz I. Guarded fixed point logic. Proc. 14th LICS 45 (1999)
29. Gurevich Y., and Harrington L. Trees, automata and games. Procs 14th ACM STOC (1982) 60-65
30. Hennessy M., and Milner R. On observing nondeterminism and concurrency. Procs ICALP '80 LNCS 85 (1980) 295-309
31. Janin D., and Walukiewicz I. Automata for the μ-calculus and related results. Proc. MFCS '95 LNCS 969 (1995) 552-562
32. Janin D., and Walukiewicz I. On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. Proc. CONCUR '96 LNCS 1119 (1996) 263-277
33. Kaivola R. Using Automata to Characterise Fixpoint Temporal Logics. Ph.D. thesis (1997), University of Edinburgh
34. Kozen D. Results on the propositional mu-calculus. Theoret. Comput. Sci. 27 (1983) 333-354
35. Kozen D. A finite model theorem for the propositional μ-calculus. Studia Logica 47 (1988) 233-241
36. Kozen D., and Parikh R. An elementary proof of the completeness of PDL. Theoret. Comput. Sci. 14 (1981) 113-118
37. Kozen D., and Parikh R. A decision procedure for the propositional μ-calculus. LNCS 164 (1984) 313-325
38. Kreutzer S. Expressive equivalence of least and inflationary fixed-point logic. Annals of Pure and Applied Logic 130 1-3 (2004) 61-78
39. Kupferman O., Vardi M., and Wolper P. An automata-theoretic approach to branching-time model checking. J. ACM 42 2 (2000) 312-360
40. LNCS. Küsters R., and Wilke T. Deciding the first level of the μ-calculus alternation hierarchy. Proc. FSTTCS 2002 2556 (2002) 241-252
41. Lamport L. Proving the correctness of multiprocess programs. IEEE Trans. Software Eng. 2 (1977) 125-143
42. Lenzi G. A hierarchy theorem for the mu-calculus. Proc. ICALP '96 LNCS 1099 (1996) 87-109
43. Liu X., Ramakrishnan C.R., and Smolka S.A. Fully local and efficient evaluation of alternating fixed points. Proc. TACAS '98 LNCS 1384 (1998) 5-19
44. Lutz C., Sattler U., and Wolter F. Modal logic and the two-variable fragment. Proc. CSL'01 (LNCS 2142) 247 (2001)
45. Mader A. Verification of Modal Properties Using Boolean Equation Systems. PhD Thesis (1997), Technical University of Munich
46. Maksimova L. Absence of interpolation and of Beth's property in temporal logics with 'the next' operation. Siberian Mathematical Journal 32 6 (1991) 109-113
47. Manna Z., and Pnueli A. Formalization of properties of recursively defined functions. Proc. ACM STOC (1969) 201-210
48. Manna Z., and Pnueli A. How to cook a temporal proof system for your pet language. Proc. 10th ACM POPL (1983) 141-154
49. Milner R. A Calculus of Communicating Systems. LNCS 92 (1980)
50. Milner R. Communication and Concurrency (1989), Prentice-Hal
51. LNCS. Mostowski A.W. Regular expressions for infinite trees and a standard form of automata. Computa- tion Theory 208 (1984) 157-168
52. Niwinski D. On fixed point clones. Proc. ICALP '86 LNCS 226 (1986) 464-473
53. Otto M. Bisimulation-invariant Ptime and higher-dimensional mu-calculus. Theoret. Comput. Sci. 224 (1999) 237-266
54. Otto M. Eliminating recursion in the mu-calculus. Proc. STACS '99, LNCS 1563 (1999) 531-540
55. D P. Fixpoint induction and proofs of program properties. Machine Intelligence 5 (1969), Edin- burgh University Press 59-78
56. Pratt V. Semantical considerations of Floyd-Hoare logic. Proc. 16th IEEE FOCS (1976) 109-121
57. Pratt V. A near-optimal method for reasoning about action. Journal of Comput. and System Sciences 20 (1980) 231-254
58. Pratt V. A decidable mu-calculus. Proc. 22nd IEEE FOCS (1982) 421-427
59. Rabin M.O. Decidability of second-order theories and automata on infinite trees. Transactions of American Mathematical Society 141 (1969) 1-35
60. Stirling C. Local model checking games. Proc. Concur '95 LNCS 962 (1995) 1-11
61. Stirling C., and Walker D. CCS, liveness, and local model checking in the linear time mu-calculus. Proc. First International Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407 (1990) 166-178
62. Stirling C., and Walker D. Local model checking in the modal mu-calculus. Theor. Comput. Sci. 89 (1991) 161-177
63. Streett R.S., and Emerson E.A. An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation 81 (1989) 249-264
64. Streett R. Propositional dynamic logic of looping and converse. Proc. 13th ACM STOC (1981) 375-383
65. Thomas W. Languages, Automata, and Logic. In: Rozen- berg G., and Salomaa A. (Eds). Handbook of Formal Language Theory Vol. III (1998), Springer-Verlag, New York 389-455
66. Vardi M.Y. A temporal fixpoint calculus. Proc. 15th POPL (1988) 250-259
67. Vardi M.Y. Why is modal logic so robustly decidable?. In: Immerman N., and Kolaitis Ph. (Eds). Descriptive Complexity and Finite Models (1997), American Mathematical Society
68. Vardi M.Y. Reasoning about the past with two-way automata. Proc. ICALP '98 LNCS 1443 (1998) 628-641
69. Vardi M.Y., and Wolper P. Yet another process logic. Logics of Programs LNCS 164 (1983) 501-512
70. Walukiewicz I. Completeness of Kozen's axiomatisation of the propositional μ-calculus. Information and Computation 157 (2000) 142-182