The following pages link to (Q4353562):
Displaying 39 items.
- Bounded situation calculus action theories (Q286407) (← links)
- Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
- Synthesis of Reactive(1) designs (Q439954) (← links)
- A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus (Q549180) (← links)
- Synthesis of obfuscation policies to ensure privacy and utility (Q682359) (← links)
- Distributed symbolic model checking for \(\mu\)-calculus (Q816198) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
- Cyclic games and linear programming (Q944703) (← links)
- Systems of agents controlled by logical programs: complexity of verification (Q1040334) (← links)
- A note on model checking the modal \(\nu\)-calculus (Q1176250) (← links)
- On feasible cases of checking multi-agent systems behavior. (Q1401355) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus (Q1706163) (← links)
- Selective mu-calculus and formula-based equivalence of transition systems (Q1970206) (← links)
- Evaluation of cyber security and modelling of risk propagation with Petri nets (Q2333477) (← links)
- Modular strategies for recursive game graphs (Q2368953) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- The power of first-order quantification over states in branching and linear time temporal logics (Q2390310) (← links)
- Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
- On complexity of verification of interacting agents' behavior (Q2498917) (← links)
- Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
- Using assumptions to distribute alternation free {\(\mu\)}-calculus model checking (Q2845490) (← links)
- Moving Arrows and Four Model Checking Results (Q2915023) (← links)
- Using Evolution Graphs for Describing Topology-Aware Prediction Models in Large Clusters (Q2915044) (← links)
- Action Theories over Generalized Databases with Equality Constraints (Q2938514) (← links)
- (Q3023539) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Enriched MU-Calculi Module Checking (Q3535606) (← links)
- Inf-datalog, Modal Logic and Complexities (Q3549285) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- (Q4472245) (← links)
- On Solving Mean Payoff Games Using Pivoting Algorithms (Q4689394) (← links)
- Tools and Methods for RTCP-Nets Modeling and Verification (Q4971674) (← links)
- (Q5856409) (← links)
- Calculational design of a regular model checker by abstract interpretation (Q5896884) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897473) (← links)
- Computing sufficient and necessary conditions in CTL: a forgetting approach (Q6204992) (← links)
- Implementing a CTL model checker with \(\mu \mathcal{G}\), a language for programming graph neural networks (Q6535461) (← links)
