Results 311 to 320 of about 180,278 (321)
Some of the next articles are maybe not open access.
2009
We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of computation tree logic CTL*. This is the first such tableau. CTL* is an exceptionally important temporal logic with applications from hardware design to agent reasoning but there is no easy automated reasoning ...
openaire +2 more sources
We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of computation tree logic CTL*. This is the first such tableau. CTL* is an exceptionally important temporal logic with applications from hardware design to agent reasoning but there is no easy automated reasoning ...
openaire +2 more sources
Effector and Memory CTL Differentiation
Annual Review of Immunology, 2007Technological advances in recent years have allowed for an ever-expanding ability to analyze and quantify in vivo immune responses. MHC tetramers, intracellular cytokine staining, an increasing repertoire of transgenic and “knockout” mice, and the detailed characterization of a variety of infectious models have all facilitated more precise and ...
Michael J. Bevan, Matthew A. Williams
openaire +3 more sources
CTL Analysis for Tumor Vaccines
2003Many studies have been conducted with the aim to stimulate a therapeutic immune response against tumors. In most cases, efforts have been directed toward the induction of tumor-specific cytotoxic T lymphocytes (CTL), because this T lymphocyte subpopulation is considered to play a major role in the destruction of tumor cells (1).
ROSATO, ANTONIO +4 more
openaire +3 more sources
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
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
2013
Let Z i, e denote the count of cells in a particular compartment. The index i ranges over NR (naive resting compartment) to NR + n d and from MR (memory resting compartment) to MR + n d .
Otto O. Yang, W. David Wick
openaire +2 more sources
Let Z i, e denote the count of cells in a particular compartment. The index i ranges over NR (naive resting compartment) to NR + n d and from MR (memory resting compartment) to MR + n d .
Otto O. Yang, W. David Wick
openaire +2 more sources
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆
International Journal of Foundations of Computer Science, 2015Heribert Vollmer +3 more
openaire +2 more sources
Cytolytic T Lymphocyte (CTL) Cytosolic Alkalinization During CTL-Mediated Killing
Journal of Leukocyte Biology, 1991T.K. Howcroft, R.R. Lindquist
openaire +3 more sources