On distributive fixed-point expressions

 Access to full text

 Full (PDF)

1. [1] H. R. Andersen and B. Vergauwen, Efficient Checking of Behavioral Relations and Modal Assertions Using Fixed-Point Inversion. In 7th International Conference on Computer-Aided Verification (CAV). Springer, Lecture Notes in Comput Sci. 939 (1995) 142-154. 
2. [2] A. Arnold, The μ-Calculus Alternation-Depth Hierarchy is Strict on Binary Trees. Theoret. Informatics. Appl., Special issue on FICS'98, to appear. Zbl0945.68118MR1748659
3. [3] A. Arnold and D. NiwińskiFixed Point Characterization of Weak Monadic Logic Definable Sets of Trees, M. Nivat and A. Podelski, Eds. Elsevier, Amsterdam, Tree Automata and Languages (1992) 159-188. Zbl0794.03054MR1196736
4. [4] G. Bhat and R. Cleaveland, Efficient Local Model Checking for Fragments of the Modal μ-Calculus. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS) Springer, Lecture Notes in Comput. Sci. 1055 (1996) 107-126. 
5. [5] J. C. Bradfield, The Modal Mu-Calculus Alternation Hierarchy is Strict. In 7th International Conference on Concurrency Theory (CONCUR). Springer, Lecture Notes in Comput. Sci. 1119 (1986) 233-246. MR1480432
6. [6] H. Doornbos, R. Backhouse and J. van der Woude, A Calculational Approach to Mathematical Induction. Theoret. Comput. Sci. 179 (1997) 103-135. Zbl0901.68124MR1454586
7. [7] E. A. Emerson, C. S. Jutla and A. P. Sistla, On Model-Checking for Fragments μ-Calculus. In 5th International Conference on Computer-Aided Verification (CAV). Springer, Lecture Notes in Comput. Sci. 697 (1993) 385-396. MR1254452
8. [8] E. A. Emerson and E. M. Clarke, Characterizing Correctness Properties of Parallel Programs Using Fixpoints. In 7th International Colloquium on Automata, Languages and Programming (ICALP). Springer, Lecture Notes in Comput. Sci. 85 (1980) 169-181. Zbl0456.68016MR589002
9. [9] L. Flon and N. Suzuki, Consistent and Complete Proof Rules for the Total Correctness of Parallel Programs. In 19th IEEE Symp. on Foundations of Computer Science (FOCS) (1978). Zbl0373.68029MR539840
10. [10] M. Jurdziński, Deciding the Winnner in Parity Games is in UP ∩ co-UP. Inform. Process. Lett. 68 (1998) 119-124. Zbl06590783
11. [11] G. Lenzi, A Hierarchy Theorem for the μ-Calculus. In 23rd International Colloquium on Automata, Languages and Programming (ICALP). Springer, Lecture Notes in Comput. Sci. 1099 (1996) 87-109. Zbl1045.03516MR1464442
12. [12] D. E. Muller, A. Saoudi and P. E. Schupp, Alternating Automata, the Weak Monadic Theory of the Tree and its Complexity. In ICALP'86 (1986). Zbl0617.03020MR864690
13. [13] D. Niwiński, On Fixed Point Clones. In 13th International Colloquium on Automata, Languages and Programming (ICALP). Springer, Lecture Notes in Comput. Sci. 226 (1986) 464-473. Zbl0596.68036MR864709
14. [14] D. Niwiński, Hierarchy of Objects Definable in the Fixed Point Calculus, in Polish. Ph. D. Thesis, University of Warsaw (1987). 
15. [15] D. Niwiński, Fixed Points vs. Infinite Generation. In 3rd Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE (1988) 402-409. 
16. [16] D. Niwiński, Fixed Point Characterization of Infinite Behavior of Finite State Systems. Theoret Comput. Sci. 189 (1997) 1-69. Zbl0893.68102MR1483617
17. [17] D. M. R. Park, On the Semantics of Fair Parallelism. In Abstract Software Specification. Springer, Lecture Notes in Comput. Sci. 86 (1980) 504-526. Zbl0456.68028
18. [18] D. M. R. Park, Concurrency and Automata on Infinite Sequences. In Theoret. Comput. Sci. Springer, Lecture Notes in Comput. Sci. 104 (1981) 167-183. Zbl0457.68049
19. [19] H. Rasiowa and R. Sikorski, Mathematics of Metamathematics. Państowe Wydawnictwo Naukowe (1970). Zbl0122.24311MR344067
20. [20] W. Thomas, Automata on Infinite Objects, J. van Leeuwen, Ed., Handbook of Theoretical Computer Science. Elsevier, Amsterdam (1990). Zbl0900.68316MR1127189