| Year: |
|
O. Kupferman, N. Piterman, and M. Y. Vardi. Automata Theoretic Approach to Model Checking Pushdown Systems. 2010. In Time for Verification: Essays in Memory of Amir Pnueli, volume 6200 of Lecture Notes in Computer Science, pages 202--259. © Springer-Verlag.
M. Huth, N. Piterman, and D. Wagner. Weak p-Automata: Acceptors of Markov Chains. 2010. In 7th International Conference on Quantitative Evaluation of SysTems. IEEE.
D. Nickovic and N. Piterman. From MTL to Deterministic Timed Automata. 2010. In 8th International Conference on Formal Modelling and Analysis of Timed Systems.
K. Chatterjee, T.A. Henzinger, and N. Piterman. Strategy Logic. 2010. Information and Computation, 208(6):677--693.
H. Fecher, M. Huth, N. Piterman, and D. Wagner. PCTL Model Checking of Markov Chains: Truth and Falsity as Winning Strategies in Games. 2010. Performance Evaluation, 67(9):858--872.
J. Fisher and N. Piterman. The Executable Pathway to Biological Networks. 2010. Briefings in Functional Genomics and Proteomics, 9(1):79--92.
M. Huth, N. Piterman, and H. Wang. A Workbench for PreProcessor Design and Evaulation: toward Benchmarks for Parity Games. 2009. In 9th International Workshop on Automated Verification of Critical Systems. EASST.
M. Huth, N. Piterman, and D. Wagner. Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL. 2009. In 17th International Symposium on Fundamentals of Computation Theory, volume 5699 of Lecture Notes in Computer Science, pages 205--216. © Springer-Verlag. (PDF, 0 bytes)
O. Kupferman, N. Piterman, and M.Y. Vardi. From Liveness to Promptness. 2009. Formal Methods in System Design, 34(2):83--103. (PDF, 237 kb)
O. Kupferman and N. Piterman. Lower Bounds on Witnesses for Nonemptiness of Universal co-Buchi Automata. 2009. In 12th International Conference on Foundations of Software Science and Computation Structures, volume 5504 of Lecture Notes in Computer Science, pages 182--196. © Springer-Verlag. (PDF, 171 kb)
P. Godefroid and N. Piterman. LTL Generalized Model Checking Revisited. 2009. In 10th International Conference on Verification, Model Checking, and Abstract Interpretation, volume 5403 of Lecture Notes in Computer Science, pages 89--103. © Springer-Verlag. (PDF, 234 kb)
J. Fisher, T.A. Henzinger, M. Mateescu, and N. Piterman. Bounded Asynchrony for Modeling Cell-Cell Interactions. 2008. In 1st Workshop on Formal Methods in Systems Biology, volume 5054 of Lecture Notes in Computer Science, pages 17--32. © Springer-Verlag. (PDF, 152 kb)
K. Chatterjee, T.A. Henzinger, and N. Piterman. Strategy Logic. 2007. In 18th International Conference on Concurrency Theory. © Springer-Verlag. (PDF, 219 kb)
O. Kupferman, N. Piterman, and M.Y. Vardi. From Liveness to Promptness. 2007. In 18th Conference on Computer Aided Verification, volume 4590 of Lecture Notes in Computer Science, pages 411--424. © Springer-Verlag. (PDF, 166 kb)
J. Fisher, N. Piterman, A. Hajnal, and T.A. Henzinger. Predictive Modeling of Signaling Crosstalk during C. elegans Vulval Development. 2007. PLoS Computational Biology, 3(5):e92.
R. Bloem, S. Galler, B. Jobstmann, N. Piterman, A. Pnueli, and M. Weiglhofer. Specify, Compile, Run: Hardware from PSL. 2007. In 6th International Workshop on Compiler Optimization Meets Compiler Verification. (PDF, 187 kb)
R. Bloem, S. Galler, B. Jobstmann, N. Piterman, A. Pnueli, and M. Weiglhofer. Automatic Hardware Synthesis from Specifications: A Case Study. 2007. In Design Automation and Test in Europe. (PDF, 85 kb)
K. Chatterjee, T.A. Hezinger, and N. Piterman. Generalized Parity Games. 2007. In 10th International Conference on Foundations of Software Science and Computation Structures, volume 4423 of Lecture Notes in Computer Science, pages 153--167. © Springer-Verlag. (PDF, 240 kb)
K. Chatterjee, T.A. Henzinger, and N. Piterman. Algorithms for Buchi Games. 2006. In 3rd Workshop on Games in Design and Verification. (PDF, 224 kb)
O. Grinchtein, M. Leucker, and N. Piterman. Inferring Network Invariants Automatically. 2006. In 3rd International Joint Conference on Automated Reasoning, volume 4130 of Lecture Notes in Computer Science, pages 483--497. © Springer-Verlag.
O. Kupferman, N. Piterman, and M.Y. Vardi. Safraless Compositional Synthesis. 2006. In 18th Conference on Computer Aided Verification, volume 4144 of Lecture Notes in Computer Science, pages 31--44. © Springer-Verlag. (PDF, 222 kb)
S. Juvekar and N. Piterman. Minimizing Generalized Buchi Automata. 2006. In 18th Conference on Computer Aided Verification, volume 4144 of Lecture Notes in Computer Science, pages 45--58. © Springer-Verlag. (PDF, 193 kb)
N. Piterman. From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata. 2006. In 21st Symposium on Logic in Computer Science, pages 255--264. © IEEE press. (see a tighter analysis by Wanwei Liu and by Sven Schewe) (PDF, 202 kb)
N. Piterman and A. Pnueli. Faster Solutions of Rabin and Streett Games. 2006. In 21st Symposium on Logic in Computer Science, pages 275--284. © IEEE press. (PDF, 283 kb)
Y. Fang, N. Piterman, A. Pnueli, and L. Zuck. Liveness with Invisible Ranking. 2006. Software Tools for Technology Transfer, 8(3):261--279. (PDF, 292 kb)
N. Piterman, A. Pnueli, and Y. Sa'ar. Synthesis of Reactive(1) Designs. 2006. In 7th International Conference on Verification, Model Checking and Abstract Interpretation, volume 3855 of Lecture Notes in Computer Science, pages 364--380. © Springer-Verlag. (see also tool homepage) (PDF, 154 kb)
J. Fisher, N. Piterman, E.J.A. Hubbard, M.J. Stern, and D. Harel. Computational Insights into C. elegans Vulval Development. 2005. Proceedings of the National Academy of Sciences, 102(6):1951-1956. (PDF)
R. Armoni, L. Fix, R. Fraer, S. Huddleston, N. Piterman, and M.Y. Vardi. SAT-based Induction for Temporal Safety Properties. 2004. In 2nd International Workshop on Bounded Model Checking, volume 119 of Electronic Notes in Theoretical Computer Science, pages 3--16. Elsevier, Boston, MA, USA. (PDF, 215 kb)
J. Fisher, D. Harel, E.J.A. Hubbard, N. Piterman, M.J. Stern, and N. Swerdlin. Combining State-based and Scenario-based Approaches in Modeling Biological Systems. 2004. In 2nd International Workshop on Computational Methods in Systems Biology, volume 3082 of Lecture Notes in Computer Science, pages 236-241. © Springer-Verlag, Paris, France. (PDF, 30 kb)
N. Piterman and M.Y, Vardi. Global Model-Checking for Infinite-State Systems. 2004. In 16th International Conference on Computer Aided Verification, volume 3114 of Lecture Notes in Computer Science, pages 387--400. © Springer-Verlag, Boston, MA, USA. (PDF, 245 kb)
Y. Fang, N. Piterman, A. Pnueli, and L. Zuck. Liveness with Incomprehensible Ranking. 2004. In 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2988 of Lecture Notes in Computer Science, pages 482--496. © Springer-Verlag, Bercelona, Spain. (PDF, 148 kb)
Y. Fang, N. Piterman, A. Pnueli, and L. Zuck. Liveness with Invisible Ranking. 2004. In 5th International Conference on Verification, Model Checking and Abstract Interpretation, volume 2937 of Lecture Notes in Computer Science, pages 223--238. © Springer-Verlag, Venice, Italy. (PDF, 151 kb)
Y. Kesten, N. Piterman, and A. Pnueli. Bridging the Gap Between Fair Simulation and Trace Inclusion. 2003. In 15th International Conference on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 381--393. © Springer-Verlag, Boulder, CO, USA. (PDF, 222 kb)
R. Armoni, L. Fix, A. Flaisher, O. Grumberg, N. Piterman, A. Tiemeyer, and M. Vardi. Enhanced Vacuity Detection in Linear Temporal Logic. 2003. In 15th International Conference on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 368--380. © Springer-Verlag, Boulder, CO, USA. (PDF, 223 kb)
N. Piterman and M. Vardi. Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems. 2003. In 18th IEEE Symposium on Logic in Computer Science, pages 381--390. IEEE. © IEEE press, Ottawa, Canada. (PDF, 243 kb)
N. Piterman and M. Vardi. From Bidirectionality to Alternation. 2003. Theoretical Computer Science, 295(1-3):295--321. (PDF, 301 kb)
O. Kupferman, N. Piterman, and M. Vardi. Model Checking Linear Properties of Prefix-Recognizable Systems. 2002. In 14th International Conference on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pages 371--385. © Springer-Verlag, Copenhagen, Denmark. (PDF, 290 kb)
O. Kupferman, N. Piterman, and M. Vardi. Extended Temporal Logic Revisited. 2001. In 12th International conference on Concurrency theory, volume 2154 of Lecture Notes in Computer Science, pages 519-535. © Springer-Verlag, Aalborg, Denmark. (PDF, 283 kb)
N. Piterman. Extending temporal logic with ω-automata. 2000. Master's thesis, The Weizmann Institute of Science. (PDF, 677 kb)