Results 1 to 10 of about 133,374 (215)
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 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 +7 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.
Krishnendu Chatterjee, Laurent Doyen
core +11 more sources
Natural Deduction Calculus for Computation Tree Logic [PDF]
IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing (JVA'06), 2006 The authors present a natural deduction calculus for the computation tree logic, CTL, defined with the full set of classical and temporal logic operators. The system extends the natural deduction construction of the linear-time temporal logic. This opens
Alexander Bolotov +2 more
core +7 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
Graded Computation Tree Logic [PDF]
ACM Transactions on Computational Logic, 2013 In modal logics, graded (world) modalities have been deeply investigated as a useful framework for generalizing standard existential and universal modalities in such a way that they can express statements about a given number of immediately accessible worlds.
Fabio Mogavero
openalex +6 more sources
Strategic (Timed) Computation Tree Logic [PDF]
, 2023 We define extensions of CTL and TCTL with strategic operators, called Strategic CTL (SCTL) and Strategic TCTL (STCTL), respectively. For each of the above logics we give a synchronous and asynchronous semantics, i.e., STCTL is interpreted over networks of extended Timed Automata (TA) that either make synchronous moves or synchronise via joint actions ...
Jaime Arias +4 more
+7 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
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
openalex +4 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