Results 41 to 50 of about 14,300 (195)
On Model Checking Durational Kripke Structures [PDF]
, 2002 We consider quantitative model checking in durational Kripke structures (Kripke structures where transitions have integer durations) with timed temporal logics where subscripts put quantitative constraints on the time it takes before a property is satisfied.We investigate the conditions that allow polynomial-time model checking algorithms for timed ...
François Laroussinie +2 more
openaire +1 more source
A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria
International Journal of Applied Mathematics and Computer Science, 2015 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
, 2006 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
Quantitative Verification of Weighted Kripke Structures
, 2014 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
Checking Interval Properties of Computations
, 2015 Model checking is a powerful method widely explored in formal verification. Given a model of a system, e.g., a Kripke structure, and a formula specifying its expected behaviour, one can verify whether the system meets the behaviour by checking the ...
Molinari, A. +4 more
core +1 more source
State space c-reductions for concurrent systems in rewriting logic [PDF]
, 2011 We present c-reductions, a state space reduction technique. The rough idea is to exploit some equivalence relation on states (possibly capturing system regularities) that preserves behavioral properties, and explore the induced quotient system.
A.F. Donaldson +13 more
core +2 more sources
Dual-Context Calculi for Modal Logic [PDF]
, 2020 We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of assumptions, one of which
Kavvos, G. A.
core +4 more sources
Scalar and Vectorial mu-calculus with Atoms [PDF]
, 2019 We study an extension of modal $\mu$-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability becomes undecidable.
Klin, Bartek, Łełyk, Mateusz
core +2 more sources
Folk Theorems on the Correspondence between State-Based and Event-Based Systems
, 2010 Kripke Structures and Labelled Transition Systems are the two most prominent semantic models used in concurrency theory. Both models are commonly believed to be equi-expressive.
J.F. Groote +7 more
core +1 more source
Logic Programming for Finding Models in the Logics of Knowledge and its Applications: A Case Study
, 2010 The logics of knowledge are modal logics that have been shown to be effective in representing and reasoning about knowledge in multi-agent domains. Relatively few computational frameworks for dealing with computation of models and useful transformations ...
C. BARAL +5 more
core +1 more source