Publication:4353562
From MaRDI portal
zbMath0877.03020MaRDI QIDQ4353562
Publication date: 8 December 1997
correctness; nondeterminism; reactive systems; automatic verification; finite state system; model checking algorithms; temporal logic model checking; Mu-calculus
68Q25: Analysis of algorithms and problem complexity
03B45: Modal logic (including the logic of norms)
03B80: Other applications of logic
Related Items
On Solving Mean Payoff Games Using Pivoting Algorithms, Bounded situation calculus action theories, Model checking Petri nets with names using data-centric dynamic systems, Synthesis of Reactive(1) designs, A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus, Synthesis of obfuscation policies to ensure privacy and utility, Combinatorial structure and randomized subexponential algorithms for infinite games, A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games, Cyclic games and linear programming, Systems of agents controlled by logical programs: complexity of verification, On feasible cases of checking multi-agent systems behavior., On temporal logic versus Datalog, First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus, Evaluation of cyber security and modelling of risk propagation with Petri nets, Modular strategies for recursive game graphs, Bounded model checking of infinite state systems, The power of first-order quantification over states in branching and linear time temporal logics, Bridging the gap between fair simulation and trace inclusion, On complexity of verification of interacting agents' behavior, Using Evolution Graphs for Describing Topology-Aware Prediction Models in Large Clusters, Action Theories over Generalized Databases with Equality Constraints, Inf-datalog, Modal Logic and Complexities, An Automata-Theoretic Approach to Infinite-State Systems
