Results 61 to 70 of about 138,161 (315)
On the connections between PCTL and Dynamic Programming
Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context of automated model checking.
Chatterjee, Debasish +3 more
core +1 more source
Relational Version of the Multi-agent Computation Tree Logic $\mathcal{CTLK}$
This paper deals with multi-agent computation tree logic --- $\mathcal{CTLK}$ (Computation Tree Logic with Knowledge). Each agent represents its own computational route of the initial problem, and new branches of possible computational routes spawn new ...
S. I. Bashmakov, K. A. Smelykh
doaj +1 more source
Checking RTECTL properties of STSs via SMT-based Bounded Model Checking
We present an SMT-based bounded model checking (BMC) method for Simply-Timed Systems (STSs) and for the existential fragment of the Real-time Computation Tree Logic. We implemented the SMT-based BMC algorithm and compared it with the SAT-based BMC method
Agnieszka Zbrzezny, Andrzej Zbrzezny
doaj +1 more source
Modelling and Verification of Multiple UAV Mission Using SMV
Model checking has been used to verify the correctness of digital circuits, security protocols, communication protocols, as they can be modelled by means of finite state transition model.
Sirigineedi, Gopinadh +3 more
core +2 more sources
Checking WECTLK Properties of TRWISs via SMT-based Bounded Model Checking [PDF]
In this paper, we present a Satisfiability Modulo Theory based (SMT-based) bounded model checking (BMC) method for Timed Real-Weighted Interpreted Systems and for the existential fragment of the Weighted Epistemic Computation Tree Logic.
Zbrzezny, Agnieszka M. +1 more
core +1 more source
Computation Tree Regular Logic for Genetic Regulatory Networks [PDF]
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.
Mateescu, Radu +3 more
openaire +3 more sources
This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi +4 more
wiley +1 more source
Model-checking ecological state-transition graphs.
Model-checking is a methodology developed in computer science to automatically assess the dynamics of discrete systems, by checking if a system modelled as a state-transition graph satisfies a dynamical property written as a temporal logic formula.
Colin Thomas +3 more
doaj +1 more source
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages [PDF]
It is well known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of logic programs to be improved. In this paper, we present a novel combination
Bagnara, R., Hill, P.M., Zaffanella, E.
core +10 more sources
Spectrally Tunable 2D Material‐Based Infrared Photodetectors for Intelligent Optoelectronics
Intelligent optoelectronics through spectral engineering of 2D material‐based infrared photodetectors. Abstract The evolution of intelligent optoelectronic systems is driven by artificial intelligence (AI). However, their practical realization hinges on the ability to dynamically capture and process optical signals across a broad infrared (IR) spectrum.
Junheon Ha +18 more
wiley +1 more source

