scientific article; zbMATH DE number 1059247
From MaRDI portal
Publication:4353562
zbMath0877.03020MaRDI QIDQ4353562
Publication date: 8 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
correctnessnondeterminismreactive systemsautomatic verificationfinite state systemmodel checking algorithmstemporal logic model checkingMu-calculus
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Other applications of logic (03B80)
Related Items (27)
Bounded situation calculus action theories ⋮ Modular strategies for recursive game graphs ⋮ Bounded model checking of infinite state systems ⋮ Model checking Petri nets with names using data-centric dynamic systems ⋮ Using Evolution Graphs for Describing Topology-Aware Prediction Models in Large Clusters ⋮ The power of first-order quantification over states in branching and linear time temporal logics ⋮ A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games ⋮ Action Theories over Generalized Databases with Equality Constraints ⋮ Unnamed Item ⋮ Knowledge forgetting in propositional \(\mu\)-calculus ⋮ On feasible cases of checking multi-agent systems behavior. ⋮ On temporal logic versus Datalog ⋮ Computing sufficient and necessary conditions in CTL: a forgetting approach ⋮ First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus ⋮ Synthesis of Reactive(1) designs ⋮ Inf-datalog, Modal Logic and Complexities ⋮ Cyclic games and linear programming ⋮ Synthesis of obfuscation policies to ensure privacy and utility ⋮ Bridging the gap between fair simulation and trace inclusion ⋮ A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ On complexity of verification of interacting agents' behavior ⋮ On Solving Mean Payoff Games Using Pivoting Algorithms ⋮ Tools and Methods for RTCP-Nets Modeling and Verification ⋮ Systems of agents controlled by logical programs: complexity of verification ⋮ Evaluation of cyber security and modelling of risk propagation with Petri nets ⋮ Combinatorial structure and randomized subexponential algorithms for infinite games
This page was built for publication:
