Results 281 to 290 of about 138,161 (315)

A blended modeling framework for real-time design and verification of safety-critical embedded systems. [PDF]

PLoS One
Awan MM, Anwar MW, Butt WH, Azam F.
europepmc   +1 more source

High Precision Speech Keyword Spotting Based on Binary Deep Neural Network in FPGA. [PDF]

Entropy (Basel)
Zhang A, Shi J, Qian H, Wang J.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Quantified Computation Tree Logic

Information Processing Letters, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patthak, A. C., Bhattacharya, I., Dasgupta, A., Dasgupta, Pallab, Chakrabarti, P. P.   +4 more
openaire   +2 more sources

Paraconsistent Computation Tree Logic

New Generation Computing, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaneiwa, Ken, Kamide, Norihiro
openaire   +2 more sources

Computation Tree Logic Formula Model Checking Using DNA Computing

Journal of Nanoelectronics and Optoelectronics, 2020
Computation tree logic model checking is a formal verification technology that can ensure the correctness of systems. The vast storage density of deoxyribonucleic acid (DNA) molecules and the massive parallelism of DNA computing offer new methods for computation tree logic model checking.
Ying-Jie Han, Jian-Wei Wang, Chun Huang, Qing-Lei Zhou   +3 more
openaire   +1 more source

Open computation tree logic with fairness

Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03., 2003
One 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 ...
A. Banerjee, P. Dasgupta, P. Chakrabarti
openaire   +1 more source

Model checking fuzzy computation tree logic

Fuzzy Sets and Systems, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pan, Haiyu, Li, Yongming, Cao, Yongzhi, Ma, Zhanyou   +3 more
openaire   +1 more source

On Probabilistic Computation Tree Logic

2004
In 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.
Frank Ciesinski, Marcus Größer
openaire   +1 more source

CTL-RP: A computation tree logic resolution prover

AI Communications, 2010
In this paper, we present a resolution-based calculus RCTL>,S for Computation Tree Logic (CTL) as well as an implementation of that calculus in the theorem prover CTL-RP. The calculus RCTL>,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. The
Zhang, L., Hustadt, U., Dixon, C.
openaire   +3 more sources