Results 1 to 10 of about 328,928 (137)
On the Hybrid Extension of CTL and CTL+ [PDF]
, 2009 The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL+ by variables.
B. Cate ten +19 more
core +5 more sources
Satisfiability of CTL* with constraints [PDF]
, 2013 We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.Comment: To appear at ...
B. Courcelle +8 more
core +3 more sources
, 2005 CTL is the dominant temporal specification language in practice mainly due to the fact that it admits model checking in linear time. Logic programming and the database query language Datalog are often used as an implementation platform for logic ...
Afrati, Foto +4 more
core +3 more sources
Logical Methods in Computer Science, 2010 This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations of Boolean and arithmetic operations allowed in constraints, one obtains several distinct logics generalizing CTL.
Laroussinie, François +2 more
openaire +9 more sources
THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ [PDF]
International Journal of Foundations of Computer Science, 2008 The satisfiability problems for [Formula: see text] and [Formula: see text] are known to be EXPTIME-complete, resp. 2EXPTIME-complete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that use less temporal or propositional operators, the complexity may decrease.
Heribert Vollmer +3 more
openaire +2 more sources
CTL and Equivalent Sublanguages of CTL [PDF]
, 1997 Specifications of finite state algorithms with a complex temporal behavior such as protocols or hardware systems are often given in temporal logics as e.g. CTL or CTL*. On the one hand, CTL offers in comparison to CTL* efficient model checking algorithms, but on the other hand, CTL seems to suffer from a limited expressiveness.
Klaus Schneider, D. Schmid
openaire +2 more sources
Frequency analysis of cytolytic T lymphocyte precursors (CTL-P) generated in vivo during lethal rabies infection of mice. II. Rabies virus genus specificity of CTL-P [PDF]
, 1984 Cytolytic T lymphocyte precursors (CTL-P) were sensitized in vivo by intraplantar infection of C57BL/6 mice with a lethal dose of rabies virus, strain ERA (ERA).
Aden +22 more
core +1 more source
Model with two types of CTL regulation and experiments on CTL dynamics [PDF]
Journal of Theoretical Biology, 2010 Recently, we developed a mathematical model of interaction between the HIV and the immune system to match various dynamic experiments carried out in HIV-infected humans and SIV-infected macaques. The model includes helper cell-dependent and helper cell-independent cytotoxic lymphocytes (CTLs) and predicts two stable steady states, a state with a high ...
R.A. Sergeev +2 more
openaire +3 more sources
Frequency analysis of cytolytic T cell precursors (CTL-P) generated in vivo during lethal rabies infection of mice. I. Distinction of CTL-P with different interleukin 2 sensitivity [PDF]
, 1982 The aim of this study was to determine the number and state of activity of cytolytic T lymphocytes (CTL) and their precursors (CTL-P) present in vivo during the early stages of viral infection. The local response to lethal infection with rabies virus was
Cerottini +21 more
core +1 more source
Specification in CTL+Past, Verification in CTL
Electronic Notes in Theoretical Computer Science, 1997 AbstractWe describe PCTL, a temporal logic extending CTL with connectives allowing to refer to the past of a current state. This incorporates the new N, “From Now On”, combinator we recently introduced.PCTL has branching future but determined, finite and cumulative past.
Philippe Schnoebelen +1 more
openaire +2 more sources