Results 51 to 60 of about 133,374 (215)
Model-checking ecological state-transition graphs.
PLoS Computational Biology, 2022 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
Bisimulations Meet PCTL Equivalences for Probabilistic Automata [PDF]
Logical Methods in Computer Science, 2013 Probabilistic automata (PAs) have been successfully applied in formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on ...
Lei Song +3 more
doaj +1 more source
Checking WECTLK Properties of TRWISs via SMT-based Bounded Model Checking [PDF]
, 2015 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
Logical gates embedding in artificial spin ice
New Journal of Physics, 2020 The realization and study of arrays of interacting magnetic nanoislands, such as artificial spin ices, have reached mature levels of control that allow design and demonstration of exotic, collective behaviors not seen in natural materials.
Francesco Caravelli, Cristiano Nisoli
doaj +1 more source
Parametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Parametric Markov chains have been introduced as a model for families of stochastic systems that rely on the same graph structure, but differ in the concrete transition probabilities. The latter are specified by polynomial constraints for the parameters.
Lisa Hutschenreiter +2 more
doaj +1 more source
Generating and Employing Witness Automata for ACTLW Formulae
IEEE Access, 2022 When verifying the validity of a formula in a system model by a model checker, a common feature is the generation of a linear witness or counterexample, which is a computation path usually showing a single reason why the formula is valid or, respectively,
Rok Vogrin, Robert Meolic, Tatjana Kapus
doaj +1 more source
Modelling and Verification of Multiple UAV Mission Using SMV
, 2010 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
A Case Study on Formal Verification of Self-Adaptive Behaviors in a Decentralized System [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Self-adaptation is a promising approach to manage the complexity of modern software systems. A self-adaptive system is able to adapt autonomously to internal dynamics and changing conditions in the environment to achieve particular quality goals.
M. Usman Iftikhar, Danny Weyns
doaj +1 more source
Model Theoretic Complexity of Automatic Structures [PDF]
, 2008 We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees).
Khoussainov, Bakhadyr, Minnes, Mia
core +3 more sources
Axiomatising extended computation tree logic
Theoretical Computer Science, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources