Results 161 to 170 of about 20,953 (186)
Some of the next articles are maybe not open access.

Alaska: Antichains for logic, automata and symbolic Kripke structures analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2008
ALASKA is a verification tool that implements new algorithms based on antichains [5, 7, 6] to efficiently solve the emptiness problem for both alternating finite automata (AFW) and alternating Büchi automata (ABW). Using the well-known translation from LTL to alternating automata, the tool can decide the satisfiability and validity problems for LTL ...
De Wulf, Martin   +3 more
openaire   +1 more source

Model Checking of Variable Petri Nets by Using the Kripke Structure

IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2022
Ru Yang, Zhijun Ding, Tong Guo
exaly  

THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTH

Journal of Symbolic Logic, 2021
Carlo Nicolai
exaly  

Satisfiability Problems on Sums of Kripke Frames

ACM Transactions on Computational Logic, 2022
Ilya B Shapirovsky
exaly  

Axiomatizing Kripke's theory of truth

Journal of Symbolic Logic, 2006
Leon Horsten
exaly  

Proof of program correctness based on Kripke structure

Journal of Computer Applications, 2011
Jie LIN, Jian-kun YU
openaire   +1 more source

Optimum satisfaction of CTL formulae for indeterminate labelled Kripke structures

Model checking is an automatic technique for verifying whether the dynamics of a system satisfy the properties expressed in temporal logic. This is achieved by algorithmically verifying that a Kripke structure representation of system dynamics is a model of the temporal logic formula.
openaire   +2 more sources

Home - About - Disclaimer - Privacy