Hostname: page-component-7c8c6479df-hgkh8 Total loading time: 0 Render date: 2024-03-28T20:10:46.132Z Has data issue: false hasContentIssue false

A Note on Negative Tagging for Least Fixed-Point Formulae

Published online by Cambridge University Press:  15 August 2002

Dilian Gurov
Affiliation:
Swedish Institute of Computer Science, Box 1263, SE-164 29 Kista, Sweden; dilian@sics.se.
Bruce Kapron
Affiliation:
Department of Computer Science, University of Victoria, Victoria, B.C., Canada V8W 3P6; bmkapron@csc.uvic.ca.
Get access

Abstract

Proof systems with sequents of the form U ⊢ Φ for proving validity of a propositional modal μ-calculus formula Φ over a set U of states in a given model usually handle fixed-point formulae through unfolding, thus allowing such formulae to reappear in a proof. Tagging is a technique originated by Winskel for annotating fixed-point formulae with information about the proof states at which these are unfolded. This information is used later in the proof to avoid unnecessary unfolding, without having to investigate the history of the proof. Depending on whether tags are used for acceptance or for rejection of a branch in the proof tree, we refer to “positive” or “negative” tagging, respectively. In their simplest form, tags consist of the sets U at which fixed-point formulae are unfolded. In this paper, we generalise results of earlier work by Andersen et al. which, in the case of least fixed-point formulae, are applicable to singleton U sets only.

Keywords

Type
Research Article
Copyright
© EDP Sciences, 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

H.R. Andersen, Verification of Temporal Properties of Concurrent Systems. Ph.D. Thesis, Computer Science Department, Aarhus University, Denmark (1993).
H.R. Andersen, C. Stirling and G. Winskel, A compositional proof system for the modal mu-calculus, in Proc. of LICS'94 (1994).
J. Bradfield, Verifying Temporal Properties of Systems. Birkhauser (1992).
Dam, M., CTL* and ECTL* as fragments of the modal µ-calculus. Theoret. Comput. Sci. 126 (1994) 77-96. CrossRef
Dam, M., Proving properties of dynamic process networks. Inform. and Comput. 140 (1998) 95-114. CrossRef
Dam, M., Fredlund, L. and Gurov, D., 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. CrossRef
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).
Kozen, D., Results on the propositional µ-calculus. Theoret. Comput. Sci. 27 (1983) 333-354. CrossRef
Stirling, C. and Walker, D., Local model checking in the modal mu-calculus. Theoret. Comput. Sci. 89 (1991) 161-177. CrossRef
Streett, R.S. and Emerson, E.A., An automata theoretic decision procedure for the propositional mu-calculus. Inform. and Comput. 81 (1989) 249-264. CrossRef
Winskel, G., A note on model checking the modal nu-calculus. Theoret. Comput. Sci. 83 (1991) 157-167. CrossRef