| D. Park. Finiteness is mu-effable. Technical Report 3, The University of Warwick, March 1989. Theory of Computation Report. |
....variables bound by greatest ( and least ( fixpoint operators. It is strictly more expressive than CTL, and provides a framework to express fairness (fairCTL) and extended temporal modalities [EL85] There have been several variations of mu calculus proposed in the past [Cle89, EL85, Koz83, Par89, BCM 90a] We closely follow the formal definition of the syntax of propositional mu calculus from Clarke and others [BCM 90a] that forms the basis of the model checker [Jan93b] used in this work. Let Sigma be a finite signature, in which every symbol is a propositional variable or a ....
D. Park. Finiteness is mu-effable. Technical Report 3, The University of Warwick, March 1989. Theory of Computation Report.
....and predicates defined by means of the least and greatest fixpoint operators, and , respectively. It is strictly more expressive than CTL , and provides a framework to express fairness and extended temporal modalities [10] There have been several variations of mu calculus proposed in the past [3, 6, 10, 16, 24]. We closely follow the formal definition of the syntax of propositional mu calculus from Burch, et al. [3] that forms the basis of the model checker [14] used in this work. Let Sigma be a finite signature, in which every symbol is a propositional variable or a predicate variable with a positive ....
D. Park. Finiteness is mu-effable. Technical Report 3, The University of Warwick, March 1989. Theory of Computation Report.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC