Results 11 to 20 of about 133,374 (215)
Cycle detection in computation tree logic [PDF]
Information and Computation, 2018 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, the solution often requires detecting some specific properties over cycles.
Gaëlle Fontaine +4 more
openalex +10 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
Temporal Logics with Reference Pointers and Computation Tree Logics [PDF]
Journal of Applied Non-Classical Logics, 2000 ABSTRACT A complete axiomatic system CTLrp is introduced for a temporal logic for finitely branching ω+ -trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTLrp.
Valentin Goranko
openalex +3 more sources
Computation Tree Regular Logic for Genetic Regulatory Networks [PDF]
, 2008 Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (GRNs) that govern the functioning of living cells. The applications of model checking in systems biology have revealed that temporal logics should be able to capture both branching-time and fairness properties.
Radu Mateescu +3 more
+9 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 +3 more sources
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Huth
openalex +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.
Roland Axelsson +4 more
openalex +4 more sources
Min-max event-triggered computation tree logic
Sadhana, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pallab Dasgupta +2 more
openalex +5 more sources
Inferring Properties in Computation Tree Logic
, 2023 We consider the problem of automatically inferring specifications in the branching-time logic, Computation Tree Logic (CTL), from a given system. Designing functional and usable specifications has always been one of the biggest challenges of formal methods.
Rajarshi Roy, Daniel Neider
openalex +4 more sources
Exogenous Probabilistic Computation Tree Logic
Electronic Notes in Theoretical Computer Science, 2007 AbstractWe define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evolution is modelled by probabilistic Kripke structures that capture both stochastic and non–deterministic transitions.
Pedro Baltazar +3 more
openalex +3 more sources