Results 361 to 370 of about 436,571 (380)
Some of the next articles are maybe not open access.
Reducing Model Checking from Multi-valued CTL* to CTL*
2002A multi-valued version of CTL* (mv-CTL*), where both the propositions and the accessibility relation are multi-valued taking values in a finite quasi-boolean algebra, is considered. A general translation from mv-CTL* to CTL* model checking is defined. An application of the translation is shown for the most commonly used quasi-boolean algebras.
Beata Konikowska, Wojciech Penczek
openaire +2 more sources
Journal of Automated Reasoning, 1989
Let T denote closure of the set of formulas of the form P \((term_ 1,...,term_ n)\) under operation of conjunction and temporal operators of some kind (f. E. operators ``always'', ``until'' and so on), and TR be the set of formulas (rules) of the form \(f_ 1 \&...\& f_ m\to f_{m+1}\), where \(f_ i\) belongs to T.
openaire +2 more sources
Let T denote closure of the set of formulas of the form P \((term_ 1,...,term_ n)\) under operation of conjunction and temporal operators of some kind (f. E. operators ``always'', ``until'' and so on), and TR be the set of formulas (rules) of the form \(f_ 1 \&...\& f_ m\to f_{m+1}\), where \(f_ i\) belongs to T.
openaire +2 more sources
HIV evolution: CTL escape mutation and reversion after transmission
Nature Network Boston, 2004A. Leslie +29 more
semanticscholar +1 more source
Tumor lactic acidosis suppresses CTL function by inhibition of p38 and JNK/c‐Jun activation
International Journal of Cancer, 2012Anna N. Mendler +5 more
semanticscholar +1 more source
Viral dynamics model with CTL immune response incorporating antiretroviral therapy
Journal of Mathematical Biology, 2013Yan Wang +3 more
semanticscholar +1 more source
2005
We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of the bundled (or suffix and fusion closed) computation tree logic BCTL*. This proves that BCTL* is decidable. It is also moderately useful to have a tableau available for a reasonably expressive branching time temporal ...
openaire +2 more sources
We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of the bundled (or suffix and fusion closed) computation tree logic BCTL*. This proves that BCTL* is decidable. It is also moderately useful to have a tableau available for a reasonably expressive branching time temporal ...
openaire +2 more sources
Evolution and transmission of stable CTL escape mutations in HIV infection
Nature, 2001P. Goulder +18 more
semanticscholar +1 more source
HIV and SIV CTL escape: implications for vaccine design
Nature reviews. Immunology, 2004P. Goulder, D. Watkins
semanticscholar +1 more source

