A note on negative tagging for least fixed-point formulae

Dilian Gurov; Bruce Kapron

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1999)

  • Volume: 33, Issue: 4-5, page 383-392
  • ISSN: 0988-3754

How to cite

top

Gurov, Dilian, and Kapron, Bruce. "A note on negative tagging for least fixed-point formulae." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 33.4-5 (1999): 383-392. <http://eudml.org/doc/92610>.

@article{Gurov1999,
author = {Gurov, Dilian, Kapron, Bruce},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {propositional modal -calculus; branching-time properties; proof systems; unfolding; proof tree; tagging; least fixed-point formulae},
language = {eng},
number = {4-5},
pages = {383-392},
publisher = {EDP-Sciences},
title = {A note on negative tagging for least fixed-point formulae},
url = {http://eudml.org/doc/92610},
volume = {33},
year = {1999},
}

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
PB - EDP-Sciences
VL - 33
IS - 4-5
SP - 383
EP - 392
LA - eng
KW - propositional modal -calculus; branching-time properties; proof systems; unfolding; proof tree; tagging; least fixed-point formulae
UR - http://eudml.org/doc/92610
ER -

References

top
  1. [1] H.R. Andersen, Verification of Temporal Properties of Concurrent Systems. Ph. D. Thesis, Computer Science Department, Aarhus University, Denmark (1993). 
  2. [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. [3] J. Bradfield, Verifying Temporal Properties of Systems. Birkhauser (1992). Zbl0753.68065
  4. [4] M. Dam, CTL* and ECTL* as fragments of the modal μ-calculus. Theoret. Comput. Sci. 126 (1994) 77-96. Zbl0798.03018MR1268023
  5. [5] M. Dam, Proving properties of dynamic process networks. Inform. and Comput. 140 (1998) 95-114. Zbl0892.68034MR1604188
  6. [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. MR1721664
  7. [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). Zbl0912.68185MR1490312
  8. [8] D. Kozen, Results on the propositional μ-calculus. Theoret. Comput. Sci. 27 (1983) 333-354. Zbl0553.03007MR731069
  9. [9] C. Stirling and D. Walker, Local model checking in the modal mu-calculus. Theoret. Comput. Sci. 89 (1991) 161-177. Zbl0745.03027MR1133710
  10. [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. Zbl0671.03023MR1000065
  11. [11] G. Winskel, A note on model checking the modal nu-calculus. Theoret. Comput. Sci. 83 (1991) 157-167. Zbl0745.68083

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.