نتایج جستجو برای: Fuzzy CTL
تعداد نتایج: 98341 فیلتر نتایج به سال:
all practical digital circuits are usually a mixture of combinational and sequential logic. flip–flops are essential to sequential logic therefore fuzzy flip–flops are considered to be among the most essential topics of fuzzy digital circuit. the concept of fuzzy digital circuit is among the most interesting applications of fuzzy sets and logic due to the fact that if there has to be an ultimat...
Background: Studies on efficacy of various vaccines that prevent or reduce the primary and recurrent HSV-1 infection have demonstrated the importance of cellular immunity for protection against the infection. We previously used DNA vaccination to induce cellular immunity against HSV-1 infection in mice. Objective: The aim of our study was to evaluate the effect of LIGHT, a member of TNF super f...
It is widely accepted that every system should be robust in “small” violations of environment assumptions lead to guarantees, but it less clear how make this intuition mathematically precise. While significant efforts have been devoted providing notions robustness for Linear Temporal Logic (LTL), branching-time logics, such as Computation Tree (CTL) and CTL*, received attention regard. To addre...
Background: Leishmania is a pathogenic parasite which infects mononuclear cells in vertebrate hosts. Different strategies have been taken to develop immunity against Leishmania . DCs loaded with immunogenic antigen have resulted in different levels of Th1-type immune response and cytotoxic T lymphocytes (CTL) activity. Objective: To evaluate the potency of DCs primed with soluble Leishmania mex...
Background: There is an increasing popularity of waterpipe tobacco smoking (WTS) in youth and even inathletes worldwide. Despite the existence of evidence of the harmful effects of hookah smoke on varioussystems of the body, especially the cardiovascular system, its simultaneous effect with exercise training hasnot been well studi...
This paper gives a general coalgebraic account of temporal logics whose semantics involves a notion of computation path. Examples of such logics include the logic CTL* for transition systems and the logic PCTL for probabilistic transition systems. Our path-based temporal logics are interpreted over coalgebras of endofunctors obtained as the composition of a computation type (e.g. nondeterminist...
There has been a growing interest in detecting whether a logic specification holds in the system vacuously. For example, a specification ”every request is eventually followed by an acknowledgment” holds vacuously on those systems that never generate requests. In a recent paper, Armoni et al. have argued against previous definitions of vacuity, defined as sensitivity with respect to syntactic pe...
We reduce synthesis for CTL∗ properties to synthesis for LTL. In the context of model checking this is impossible — CTL∗ is more expressive than LTL. Yet, in synthesis we have knowledge of the system structure and we can add new outputs. These outputs can be used to encode witnesses of the satisfaction of CTL∗ subformulas directly into the system. This way, we construct an LTL formula, over old...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید