no. 4-5
A note on negative tagging for least fixed-point formulae
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 4-5, pp. 383-392. 
@article{ITA_1999__33_4-5_383_0,
     author = {Gurov, Dilian and Kapron, Bruce},
     title = {A note on negative tagging for least fixed-point formulae},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {383--392},
     publisher = {EDP-Sciences},
     volume = {33},
     number = {4-5},
     year = {1999},
     mrnumber = {1748662},
     zbl = {0940.03034},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1999__33_4-5_383_0/}
}
TY  - JOUR
AU  - Gurov, Dilian
AU  - Kapron, Bruce
TI  - A note on negative tagging for least fixed-point formulae
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1999
SP  - 383
EP  - 392
VL  - 33
IS  - 4-5
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1999__33_4-5_383_0/
LA  - en
ID  - ITA_1999__33_4-5_383_0
ER  - 
%0 Journal Article
%A Gurov, Dilian
%A Kapron, Bruce
%T A note on negative tagging for least fixed-point formulae
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1999
%P 383-392
%V 33
%N 4-5
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1999__33_4-5_383_0/
%G en
%F ITA_1999__33_4-5_383_0
Gurov, Dilian; Kapron, Bruce. A note on negative tagging for least fixed-point formulae. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 4-5, pp. 383-392. http://www.numdam.org/item/ITA_1999__33_4-5_383_0/

[1] H.R. Andersen, Verification of Temporal Properties of Concurrent Systems. Ph. D. Thesis, Computer Science Department, Aarhus University, Denmark (1993).

[2] H. R. Andersen, C. Stirling and G. Winskel, A compositional proof System for the modal mu-calculus, in Proc. of LICS'94 (1994).

[3] J. Bradfield, Verifying Temporal Properties of Systems. Birkhauser (1992). | Zbl

[4] M. Dam, CTL* and ECTL* as fragments of the modal μ-calculus. Theoret. Comput. Sci. 126 (1994) 77-96. | MR | Zbl

[5] M. Dam, Proving properties of dynamic process networks. Inform. and Comput. 140 (1998) 95-114. | MR | Zbl

[6] M. Dam, L. Fredlund and D. Gurov, Toward parametric verification of open distributed systems, H. Langmaack, A. Pnueli and W.-P. De Roever, Eds., Compositionality: The Significant Difference. Springer, Lecture Notes in Comput Sci. 1536 (1998) 150-158. | MR

[7] D. Gurov, S. Berezin and B. Kapron, A modal μ-calculus and a proof System for value passing processes. Electron. Notes Theoret. Comput. Sci. 5 (1996). | MR | Zbl

[8] D. Kozen, Results on the propositional μ-calculus. Theoret. Comput. Sci. 27 (1983) 333-354. | MR | Zbl

[9] C. Stirling and D. Walker, Local model checking in the modal mu-calculus. Theoret. Comput. Sci. 89 (1991) 161-177. | MR | Zbl

[10] R. S. Streett and E. A. Emerson, An automata theoretic decision procedure for the propositional mu-calculus. Inform. and Comput. 81 (1989) 249-264. | MR | Zbl

[11] G. Winskel, A note on model checking the modal nu-calculus. Theoret. Comput. Sci. 83 (1991) 157-167. | Zbl