Results 221 to 230 of about 329,027 (236)

Coupling the CTL and MATLAB

2007
The programming language MATLAB is widespread in the field of scientific computing. In some cases it may be reasonable to use external software, which is to be embedded into or invoked from MATLAB code. Interfacing Java code from MATLAB is directly available.
Bügling, Boris, Krosche, Martin
openaire   +3 more sources

Characterization of CTL by Microscopy

2014
Conventional microscopic techniques may be easily employed to detect and characterize cytotoxic T lymphocytes (CTL). Immunohistochemistry (IHC) may be effectively performed in CTL characterization to identify the location and distribution of target antigens in suspension cells or in tissues by staining with a specific antibody.
openaire   +4 more sources

Intracellular Signaling of CTLs

2014
Extracellular signals are transmitted to intracellular targets thanks to a complex network of interacting proteins that regulate a large number of cellular processes. The signaling mechanisms that occur in CTLs are initiated by T cell receptors (TCRs) that recognize antigens presented in the groove of class I histocompatibility (MHC) molecules of ...
openaire   +4 more sources

Flat fragments of CTL and CTL: separating the expressive and distinguishing powers

Logic Journal of IGPL, 1999
We study both the expressive and the distinguishing powers of at temporal logics. These are fragments obtained by restricting the ??rst argument of the Until operator to propositional formulae. Both the linear-time and the branching-time cases are considered.
openaire   +2 more sources

CTL+ Is Exponentially More Succinct than CTL

1999
It is proved that CTL+ is exponentially more succinct than CTL. More precisely, it is shown that every CTL formula (and every modal µ-calculus formula) equivalent to the CTL+ formula E(Fp0 Λ... Λ Fpn-1) is of length at least (n/⌊n/2⌋), which is Ω(2n/√n). This matches almost the upper bound provided by Emerson and Halpern, which says that for every CTL+
openaire   +2 more sources

A Tableau for CTL*

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

CTL Analysis for Tumor Vaccines

2003
Many 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, G. Milan, A. Zambon, ZANOVELLO, PAOLA, D. Collavo   +4 more
openaire   +3 more sources

Effector and Memory CTL Differentiation

Annual Review of Immunology, 2007
Technological 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

Reducing Model Checking from Multi-valued CTL* to CTL*

2002
A 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

Towards a CTL* Tableau

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