The following pages link to Orna Kupferman (Q216121):
Displaying 50 items.
- Synthesis with rational environments (Q314471) (← links)
- Network-formation games with regular objectives (Q342715) (← links)
- Rigorous approximated determinization of weighted automata (Q385026) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- Improved model checking of hierarchical systems (Q418123) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Synthesis from component libraries with costs (Q683714) (← links)
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Coverage metrics for temporal logic model checking (Q853721) (← links)
- Profile trees for Büchi word automata, with application to determinization (Q897653) (← links)
- From liveness to promptness (Q1039845) (← links)
- Spanning the spectrum from safety to liveness (Q1629750) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- Latticed-LTL synthesis in the presence of noisy inputs (Q1677194) (← links)
- On relative and probabilistic finite counterability (Q1742987) (← links)
- Module checking (Q1854407) (← links)
- Fair simulation (Q1854506) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
- From pre-historic to post-modern symbolic model checking (Q1878908) (← links)
- Branching-time temporal logic and tree automata (Q1917081) (← links)
- Timed vacuity (Q2024362) (← links)
- Games with full, longitudinal, and transverse observability (Q2039955) (← links)
- Mutually accepting capacitated automata (Q2040403) (← links)
- What's decidable about weighted automata? (Q2064522) (← links)
- Lazy regular sensing (Q2112190) (← links)
- Timed network games (Q2112796) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Quantitative assume guarantee synthesis (Q2164236) (← links)
- Good-enough synthesis (Q2226757) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- Verification (Q2244833) (← links)
- An abstraction-refinement framework for trigger querying (Q2248101) (← links)
- Capacitated automata and systems (Q2280332) (← links)
- Dynamic resource allocation games (Q2286736) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Sensing as a complexity measure (Q2400985) (← links)
- A parametrized analysis of algorithms on hierarchical graphs (Q2400995) (← links)
- When does abstraction help? (Q2445332) (← links)
- Concurrent reachability games (Q2465027) (← links)
- Prime languages (Q2514149) (← links)
- From complementation to certification (Q2575735) (← links)
- Relating word and tree automata (Q2576943) (← links)
- (Q2754072) (← links)
- (Q2769435) (← links)
- (Q2769612) (← links)
- On the Capacity of Capacitated Automata (Q2798729) (← links)
- Dynamic Resource Allocation Games (Q2819456) (← links)
- Prime Languages (Q2849947) (← links)
- Parityizing Rabin and Streett (Q2908872) (← links)
- Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction (Q2914365) (← links)
