2009 |
37 | EE | Orna Kupferman,
Nir Piterman:
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata.
FOSSACS 2009: 182-196 |
36 | EE | Patrice Godefroid,
Nir Piterman:
LTL Generalized Model Checking Revisited.
VMCAI 2009: 89-104 |
35 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
From liveness to promptness.
Formal Methods in System Design 34(2): 83-103 (2009) |
2008 |
34 | EE | Jasmin Fisher,
Thomas A. Henzinger,
Maria Mateescu,
Nir Piterman:
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions.
FMSB 2008: 17-32 |
33 | EE | Harald Fecher,
Michael Huth,
Nir Piterman,
Daniel Wagner:
Hintikka Games for PCTL on Labeled Markov Chains.
QEST 2008: 169-178 |
32 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Nir Piterman:
Algorithms for Büchi Games
CoRR abs/0805.2620: (2008) |
2007 |
31 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
From Liveness to Promptness.
CAV 2007: 406-419 |
30 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Nir Piterman:
Strategy Logic.
CONCUR 2007: 59-73 |
29 | EE | Roderick Bloem,
Stefan Galler,
Barbara Jobstmann,
Nir Piterman,
Amir Pnueli,
Martin Weiglhofer:
Interactive presentation: Automatic hardware synthesis from specifications: a case study.
DATE 2007: 1188-1193 |
28 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Nir Piterman:
Generalized Parity Games.
FoSSaCS 2007: 153-167 |
27 | EE | Nir Piterman:
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
CoRR abs/0705.2205: (2007) |
26 | EE | Roderick Bloem,
Stefan Galler,
Barbara Jobstmann,
Nir Piterman,
Amir Pnueli,
Martin Weiglhofer:
Specify, Compile, Run: Hardware from PSL.
Electr. Notes Theor. Comput. Sci. 190(4): 3-16 (2007) |
25 | EE | Nir Piterman:
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata.
Logical Methods in Computer Science 3(3): (2007) |
2006 |
24 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Safraless Compositional Synthesis.
CAV 2006: 31-44 |
23 | EE | Sudeep Juvekar,
Nir Piterman:
Minimizing Generalized Büchi Automata.
CAV 2006: 45-58 |
22 | EE | Thomas A. Henzinger,
Nir Piterman:
Solving Games Without Determinization.
CSL 2006: 395-410 |
21 | EE | Olga Grinchtein,
Martin Leucker,
Nir Piterman:
Inferring Network Invariants Automatically.
IJCAR 2006: 483-497 |
20 | EE | Nir Piterman:
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata.
LICS 2006: 255-264 |
19 | EE | Nir Piterman,
Amir Pnueli:
Faster Solutions of Rabin and Streett Games.
LICS 2006: 275-284 |
18 | EE | Nir Piterman,
Amir Pnueli,
Yaniv Sa'ar:
Synthesis of Reactive(1) Designs.
VMCAI 2006: 364-380 |
17 | EE | Yi Fang,
Nir Piterman,
Amir Pnueli,
Lenore D. Zuck:
Liveness with invisible ranking.
STTT 8(3): 261-279 (2006) |
2005 |
16 | EE | Roy Armoni,
Limor Fix,
Ranan Fraer,
Scott Huddleston,
Nir Piterman,
Moshe Y. Vardi:
SAT-based Induction for Temporal Safety Properties.
Electr. Notes Theor. Comput. Sci. 119(2): 3-16 (2005) |
15 | EE | Yonit Kesten,
Nir Piterman,
Amir Pnueli:
Bridging the gap between fair simulation and trace inclusion.
Inf. Comput. 200(1): 35-61 (2005) |
2004 |
14 | EE | Nir Piterman,
Moshe Y. Vardi:
Global Model-Checking of Infinite-State Systems.
CAV 2004: 387-400 |
13 | EE | Jasmin Fisher,
David Harel,
E. Jane Albert Hubbard,
Nir Piterman,
Michael J. Stern,
Naamah Swerdlin:
Combining State-Based and Scenario-Based Approaches in Modeling Biological Systems.
CMSB 2004: 236-241 |
12 | EE | Yi Fang,
Nir Piterman,
Amir Pnueli,
Lenore D. Zuck:
Liveness with Incomprehensible Ranking.
TACAS 2004: 482-496 |
11 | EE | Yi Fang,
Nir Piterman,
Amir Pnueli,
Lenore D. Zuck:
Liveness with Invisible Ranking.
VMCAI 2004: 223-238 |
2003 |
10 | EE | Roy Armoni,
Limor Fix,
Alon Flaisher,
Orna Grumberg,
Nir Piterman,
Andreas Tiemeyer,
Moshe Y. Vardi:
Enhanced Vacuity Detection in Linear Temporal Logic.
CAV 2003: 368-380 |
9 | EE | Yonit Kesten,
Nir Piterman,
Amir Pnueli:
Bridging the Gap between Fair Simulation and Trace Inclusion.
CAV 2003: 381-393 |
8 | EE | Nir Piterman,
Moshe Y. Vardi:
Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems.
LICS 2003: 381- |
7 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Fair Equivalence Relations.
Verification: Theory and Practice 2003: 702-732 |
6 | EE | Nir Piterman,
Moshe Y. Vardi:
From bidirectionality to alternation.
Theor. Comput. Sci. 295: 295-321 (2003) |
2002 |
5 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Model Checking Linear Properties of Prefix-Recognizable Systems.
CAV 2002: 371-385 |
4 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Pushdown Specifications.
LPAR 2002: 262-277 |
2001 |
3 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Extended Temporal Logic Revisited.
CONCUR 2001: 519-535 |
2 | EE | Nir Piterman,
Moshe Y. Vardi:
From Bidirectionality to Alternation.
MFCS 2001: 598-610 |
2000 |
1 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Fair Equivalence Relations.
FSTTCS 2000: 151-163 |