Results 41 to 50 of about 20,953 (186)
LTL Model Checking Based on Binary Classification of Machine Learning
Linear Temporal Logic (LTL) Model Checking (MC) has been applied to many fields. However, the state explosion problem and the exponentially computational complexity restrict the further applications of LTL model checking.
Weijun Zhu, Huanmei Wu, Miaolei Deng
doaj +1 more source
Incremental Sampling-based Algorithm for Minimum-violation Motion Planning [PDF]
This paper studies the problem of control strategy synthesis for dynamical systems with differential constraints to fulfill a given reachability goal while satisfying a set of safety rules.
Castro, Luis I. Reyes +5 more
core +2 more sources
Separable Kripke structures are algebraically universal [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The Sleep Regularity Index: A New Way to Evaluate Shiftwork Schedules. [PDF]
ABSTRACT Sailors adhere to a variety of demanding shiftwork schedules (known as ‘watchbills’) which pose a challenge for sleep and wellbeing at sea. Previous research aimed at identifying viable watchbills based on how they protect sailors' sleep has largely relied on sleep duration. Findings have highlighted insufficient sleep during watchstanding but
Guzzetti JR +3 more
europepmc +2 more sources
A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria
Consider games where players wish to minimize the cost to reach some state. A subgame-perfect Nash equilibrium can be regarded as a collection of optimal paths on such games.
Góngora Pedro A., Rosenblueth David A.
doaj +1 more source
Quantitative Verification of Weighted Kripke Structures
Extending formal verification techniques to handle quantitative aspects, both for the models and for the properties to be checked, has become a central research topic over the last twenty years. Following several recent works, we study model checking for (one-dimensional) weighted Kripke structures with positive and negative weights, and temporal ...
Patricia Bouyer +2 more
openaire +1 more source
Model Checking CTL is Almost Always Inherently Sequential [PDF]
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already ...
A. L. Selman +20 more
core +5 more sources
Weighted Branching Simulation Distance for Parametric Weighted Kripke Structures [PDF]
In Proceedings Cassting'16/SynCoP'16, arXiv:1608 ...
Foshammer, Louise +2 more
openaire +5 more sources
Chomsky on Analytic and Necessary Propositions
My aim is to critically discuss Chomsky’s position concerning the analytic-synthetic distinction and necessary propositions. To do so, I present Chomsky’s objection to Quine’s criticism of the analytic-synthetic distinction, and I point out that Chomsky ...
Enrico Cipriani
doaj +1 more source
This paper presents a general framework for modular synthesis of supervisors for discrete event systems. The approach is based on compositional minimisation, using concepts of process equivalence.
Flordal, Hugo, Malik, Robi
core +3 more sources

