Results 181 to 190 of about 133,374 (215)
Graded Computation Tree Logic with Binary Coding [PDF]
, 2010 Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the branching-time temporal logic CTL (GCTL), in such a way that they can express statements about a minimal and conservative number of accessible paths.
BIANCO, ALESSANDRO +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Open computation tree logic with fairness
Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03., 2003One of the main concerns of the designer of a circuit module is to guarantee that the interface of the module conforms to specific protocols (such as PCI Bus, AMBA bus or Ethernet) by which it interacts with its environment. The computational complexity of verifying such open systems under all possible environments has been shown to be very hard ...
Partha Chakrabarti +2 more
openaire +2 more sources
On Probabilistic Computation Tree Logic
2004In this survey we motivate, define and explain model checking of probabilistic deterministic and nondeterministic systems using the probabilistic computation tree logics PCTL and PCTL *. Juxtapositions to non-deterministic computation tree logic are made and algorithms are presented.
Marcus Größer, Frank Ciesinski
openaire +2 more sources
Softlock Detection for Super Metroid with Computation Tree Logic
The 16th International Conference on the Foundations of Digital Games (FDG) 2021, 2021Videogame level designs can contain errors called softlocks where a player traversing the level in an unintended manner can become permanently stuck. In this paper, we explore the automated detection of softlocks in the game Super Metroid using Computation Tree Logic (CTL). Super Metroid distinguishes itself as an example domain because of its velocity-
Adam M. Smith, Ross Mawhorter
openaire +1 more source
Model checking fuzzy computation tree logic
Fuzzy Sets and Systems, 2015Traditional temporal logics such as linear temporal logic and computation tree logic are widely used to specify properties of reactive systems. Model checking is a well-established technique for verifying if a desired property described as a temporal logic formula holds over a reactive system model.
Zhanyou Ma +3 more
openaire +2 more sources
Verification of Rewrite Rules for Computation Tree Logics
2014 21st International Symposium on Temporal Representation and Reasoning, 2014A number of procedures for checking the satisfiability of formulas in the important branching time temporal logic CTL have recently been proposed. This paper instead focuses on automatic generation and verification of rewrite rules for computation tree logics, shows that non-local computation tree logics can be used to verify rewrite rules, including ...
Mark Reynolds +1 more
openaire +2 more sources
CTL-RP: A computation tree logic resolution prover
AI Communications, 2010In this paper, we present a resolution-based calculus R CTL >,S for Computation Tree Logic (CTL) as well as an implementation of that calculus in the theorem prover CTL-RP. The calculus R CTL >,S requires a transformation of an arbitrary CTL formula to an equi-satisfiable clausal normal form formulated in an extension of CTL with indexed path formulae.
Zhang, L., Hustadt, U., Dixon, C.
openaire +4 more sources
Fuzzy logic system for fuzzy event tree computing
Proceedings First International IEEE Symposium Intelligent Systems, 2003The paper presents the authors' contribution in developing a fuzzy logic system for event-tree analysis. The fuzzy event-tree method can be used for the protection and automation of power systems independent safety analysis. The main contribution of the proposed analysis is the evaluation or the general fuzzy conclusion named "general safety ...
Mariana Dumitrescu +2 more
openaire +2 more sources
Model Checking for the Full Hybrid Computation Tree Logic
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME), 2016We consider the hybridisations of the full branching time logic CTL* through the addition of nominals, binders and jumps. We formally define three fragments restricting the interplay between hybrid operators and path formulae contrary to previous proposals in the literature which ignored potential problems with a formal semantics.
Martin Lange, Daniel Kernberger
openaire +2 more sources
One-Pass Tableaux for Computation Tree Logic
2007We give the first single-pass ("on the fly") tableau decision procedure for computational tree logic (CTL). Our method extends Schwendimann's single-pass decision procedure for propositional linear temporal logic (PLTL) but the extension is non-trivial because of the interactions between the branching inherent in CTL-models, which is missing in PLTL ...
Florian Widmann +2 more
openaire +2 more sources