The following pages link to Nir Piterman (Q439953):
Displaying 50 items.
- Synthesis of Reactive(1) designs (Q439954) (← links)
- The Rabin index of parity games: its complexity and approximation (Q897647) (← links)
- Strategy logic (Q979080) (← links)
- From liveness to promptness (Q1039845) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- On automation of \(\mathsf{CTL}^*\) verification for infinite-state systems (Q1702907) (← links)
- Actions over core-closed knowledge bases (Q2104517) (← links)
- Incorporating monitors in reactive synthesis without paying the price (Q2147214) (← links)
- Finding recurrent sets with backward analysis and trace partitioning (Q2272913) (← links)
- Equivalence of probabilistic \(\mu\)-calculus and p-automata (Q2399249) (← links)
- Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
- Static Analysis of Parity Games: Alternating Reachability Under Parity (Q2796222) (← links)
- (Q2849589) (← links)
- Effective Synthesis of Asynchronous Systems from GR(1) Specifications (Q2891421) (← links)
- Synthesis of biological models from mutation experiments (Q2931826) (← links)
- Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics (Q2954997) (← links)
- Safety Verification of Piecewise-Deterministic Markov Processes (Q2988991) (← links)
- Proving Stabilization of Biological Systems (Q3075477) (← links)
- Dynamic Reactive Modules (Q3090845) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL (Q3183611) (← links)
- Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions (Q3506862) (← links)
- Strategy Logic (Q3525629) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- From Mtl to Deterministic Timed Automata (Q3588091) (← links)
- LTL Generalized Model Checking Revisited (Q3600466) (← links)
- Solving Games Without Determinization (Q3613352) (← links)
- Inferring Network Invariants Automatically (Q3613429) (← links)
- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (Q3617729) (← links)
- (Q4428305) (← links)
- (Q4472441) (← links)
- Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems (Q4640287) (← links)
- The Modal Transition System Control Problem (Q4647840) (← links)
- (Q4779176) (← links)
- (Q4791853) (← links)
- (Q4804910) (← links)
- Fatal Attractors in Parity Games (Q4910410) (← links)
- OBLIGATION BLACKWELL GAMES AND P-AUTOMATA (Q4977213) (← links)
- (Q4992505) (← links)
- Fairness for Infinite-State Systems (Q5194957) (← links)
- Verification: Theory and Practice (Q5305663) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308428) (← links)
- Computer Aided Verification (Q5312916) (← links)
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata (Q5426071) (← links)
- From Liveness to Promptness (Q5429333) (← links)
- Computational Methods in Systems Biology (Q5712395) (← links)
- Safraless Compositional Synthesis (Q5756733) (← links)
- Minimizing Generalized Büchi Automata (Q5756738) (← links)
- Generalized Parity Games (Q5758061) (← links)
- Combinations of Qualitative Winning for Stochastic Parity Games (Q5875367) (← links)
