Results 11 to 20 of about 138,161 (315)
Model Checking Fuzzy Computation Tree Logic Based on Fuzzy Decision Processes with Cost [PDF]
Entropy, 2022 In order to solve the problems in fuzzy computation tree logic model checking with cost operator, we propose a fuzzy decision process computation tree logic model checking method with cost.
Zhanyou Ma +4 more
doaj +4 more sources
Computation Tree Logic for Synchronization Properties [PDF]
, 2016 We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length.
Chatterjee, Krishnendu, Doyen, Laurent
core +11 more sources
Robust Computation Tree Logic [PDF]
Innovations in Systems and Software Engineering, 2022 Abstract It is widely accepted that every system should be robust in that “small” violations of environment assumptions should lead to “small” violations of system guarantees, but it is less clear how to make this intuition mathematically precise.
Satya Prakash Nayak +3 more
+11 more sources
A Finite Exact Representation of Register Automata Configurations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 A register automaton is a finite automaton with finitely many registers ranging from an infinite alphabet. Since the valuations of registers are infinite, there are infinitely many configurations.
Yu-Fang Chen, Bow-Yaw Wang, Di-De Yen
doaj +14 more sources
Reducing Validity in Epistemic ATL to Validity in Epistemic CTL [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We propose a validity preserving translation from a subset of epistemic Alternating-time Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable model-
Dimitar P. Guelev
doaj +4 more sources
Computation Tree Logic with Deadlock Detection [PDF]
Logical Methods in Computer Science, 2009 We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL-X).
Rob van Glabbeek +2 more
doaj +5 more sources
Cycle Detection in Computation Tree Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Temporal logic is a very powerful formalism deeply investigated and used in formal system design and verification. Its application usually reduces to solving specific decision problems such as model checking and satisfiability. In these kind of problems,
Gaëlle Fontaine +4 more
doaj +8 more sources
Possibilistic Cost Computation Tree Logic and Related Equivalence, Abstraction Technique [PDF]
IEEE Access, 2023 Recently, probabilistic Kripke structures have been used to represent uncertain systems; nevertheless, important transition costs were ignored in earlier studies, making it impossible to model some uncertain systems with costs.
Hui Deng, Yuzhe Zhang, Zhilong Huang
doaj +2 more sources
Source Code Verification for Embedded Systems using Prolog [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 System relevant embedded software needs to be reliable and, therefore, well tested, especially for aerospace systems. A common technique to verify programs is the analysis of their abstract syntax tree (AST).
Frank Flederer +3 more
doaj +4 more sources
Extended Computation Tree Logic [PDF]
, 2010 We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may determine the moments along a path that an until property may be fulfilled.
Axelsson, Roland +4 more
openaire +4 more sources