Year |
Citation |
Score |
2020 |
Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games Theoretical Computer Science. 807: 42-55. DOI: 10.1016/J.Tcs.2019.06.031 |
0.382 |
|
2019 |
Avni G, Henzinger TA, Chonev V. Infinite-duration Bidding Games Journal of the Acm. 66: 1-29. DOI: 10.1145/3340295 |
0.441 |
|
2017 |
Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata Acm Transactions On Computational Logic. 18: 1-44. DOI: 10.1145/3152769 |
0.483 |
|
2017 |
Henzinger TA, Otop J. Model measuring for discrete and hybrid systems Nonlinear Analysis: Hybrid Systems. 23: 166-190. DOI: 10.1016/J.Nahs.2016.09.001 |
0.336 |
|
2017 |
Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative fair simulation games Information and Computation. 254: 143-166. DOI: 10.1016/J.Ic.2016.10.006 |
0.584 |
|
2016 |
Schilling C, Bogomolov S, Henzinger TA, Podelski A, Ruess J. Adaptive moment closure for parameter inference of biochemical reaction networks. Bio Systems. PMID 27461396 DOI: 10.1016/J.Biosystems.2016.07.005 |
0.305 |
|
2016 |
Daca P, Henzinger TA, Křetínský J, Petrov T. Faster statistical model checking for unbounded temporal properties Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9636: 112-129. DOI: 10.1145/3060139 |
0.372 |
|
2015 |
Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. The complexity of multi-mean-payoff and multi-energy games Information and Computation. 241: 177-196. DOI: 10.1016/J.Ic.2015.03.001 |
0.593 |
|
2014 |
Boker U, Henzinger T. Exact and Approximate Determinization of Discounted-Sum Automata Logical Methods in Computer Science. 10. DOI: 10.2168/Lmcs-10(1:10)2014 |
0.361 |
|
2014 |
Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values Acm Transactions On Computational Logic. 15. DOI: 10.1145/2629686 |
0.571 |
|
2014 |
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. Synthesizing robust systems Acta Informatica. 51: 193-220. DOI: 10.1007/S00236-013-0191-5 |
0.554 |
|
2013 |
Chatterjee K, de Alfaro L, Henzinger TA. Strategy improvement for concurrent reachability and turn-based stochastic safety games. Journal of Computer and System Sciences. 79: 640-657. PMID 26516289 DOI: 10.1016/J.Jcss.2012.12.001 |
0.636 |
|
2013 |
Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8052: 242-256. DOI: 10.2168/Lmcs-11(1:20)2015 |
0.35 |
|
2013 |
Chatterjee K, Doyen L, Henzinger TA. A survey of partial-observation stochastic parity games Formal Methods in System Design. 43: 268-284. DOI: 10.1007/s10703-012-0164-2 |
0.591 |
|
2013 |
Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study International Journal On Software Tools For Technology Transfer. 15: 585-601. DOI: 10.1007/S10009-011-0207-9 |
0.541 |
|
2012 |
Chatterjee K, Henzinger TA, Prabhu VS. Finite automata with time-delay blocks Emsoft'12 - Proceedings of the 10th Acm International Conference On Embedded Software 2012, Co-Located With Esweek. 43-52. DOI: 10.1145/2380356.2380370 |
0.515 |
|
2012 |
Ghosal A, Iercan D, Kirsch CM, Henzinger TA, Sangiovanni-Vincentelli A. Separate compilation of hierarchical real-time programs into linear-bounded Embedded Machine code Science of Computer Programming. 77: 96-112. DOI: 10.1016/J.Scico.2010.06.004 |
0.306 |
|
2012 |
Chatterjee K, Henzinger TA. A survey of stochastic ω-regular games Journal of Computer and System Sciences. 78: 394-413. DOI: 10.1016/J.Jcss.2011.05.002 |
0.616 |
|
2011 |
Chatterjee K, Henzinger T, Prabhu V. Timed Parity Games: Complexity and Robustness Logical Methods in Computer Science. 7. DOI: 10.2168/Lmcs-7(4:8)2011 |
0.642 |
|
2011 |
Fisher J, Harel D, Henzinger TA. Biology as reactivity Communications of the Acm. 54: 72-82. DOI: 10.1145/2001269.2001289 |
0.316 |
|
2011 |
Tripakis S, Lickly B, Henzinger TA, Lee EA. A theory of synchronous relational interfaces Acm Transactions On Programming Languages and Systems. 33. DOI: 10.1145/1985342.1985345 |
0.34 |
|
2011 |
Chatterjee K, Alfaro LD, Henzinger TA. Qualitative concurrent parity games Acm Transactions On Computational Logic. 12: 1-51. DOI: 10.1145/1970398.1970404 |
0.629 |
|
2011 |
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: Quantitative synthesis tool Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6605: 267-271. DOI: 10.1007/978-3-642-19835-9_24 |
0.586 |
|
2010 |
Wolf V, Goel R, Mateescu M, Henzinger TA. Solving the chemical master equation using sliding windows. Bmc Systems Biology. 4: 42. PMID 20377904 DOI: 10.1186/1752-0509-4-42 |
0.303 |
|
2010 |
Chatterjee K, Doyen L, Henzinger TA, Raskin JF. Generalized mean-payoff and energy games Leibniz International Proceedings in Informatics, Lipics. 8: 505-516. DOI: 10.4230/LIPIcs.FSTTCS.2010.505 |
0.568 |
|
2010 |
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6174: 380-395. DOI: 10.1145/2699430 |
0.61 |
|
2010 |
Feret J, Henzinger T, Koeppl H, Petrov T. Lumpability Abstractions of Rule-based Systems Electronic Proceedings in Theoretical Computer Science. 40: 142-161. DOI: 10.1016/J.Tcs.2011.12.059 |
0.334 |
|
2010 |
Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6281: 246-257. DOI: 10.1016/J.Ic.2015.06.003 |
0.599 |
|
2010 |
Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction for parity games with imperfect information Information and Computation. 208: 1206-1220. DOI: 10.1016/J.Ic.2009.09.006 |
0.616 |
|
2010 |
Chatterjee K, Henzinger TA, Piterman N. Strategy logic Information and Computation. 208: 677-693. DOI: 10.1016/J.Ic.2009.07.004 |
0.583 |
|
2010 |
Chatterjee K, Henzinger TA. Probabilistic automata on infinite words: Decidability and undecidability results Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6252: 1-16. DOI: 10.1007/978-3-642-15643-4_1 |
0.516 |
|
2010 |
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-Payoff Automaton Expressions Lecture Notes in Computer Science. 6269: 269. DOI: 10.1007/978-3-642-15375-4_19 |
0.468 |
|
2010 |
Chatterjee K, Doyen L, Henzinger TA. Qualitative analysis of partially-observable Markov decision processes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6281: 258-269. DOI: 10.1007/978-3-642-15155-2_24 |
0.551 |
|
2010 |
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. Gist: A solver for probabilistic games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6174: 665-669. DOI: 10.1007/978-3-642-14295-6_57 |
0.574 |
|
2010 |
Černý P, Henzinger TA, Radhakrishna A. Quantitative simulation games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6200: 42-60. DOI: 10.1007/978-3-642-13754-9_3 |
0.378 |
|
2009 |
Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages Proceedings - Symposium On Logic in Computer Science. 199-208. DOI: 10.2168/Lmcs-6(3:10)2010 |
0.523 |
|
2009 |
Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5797: 3-23. DOI: 10.1142/S0129054111008441 |
0.32 |
|
2009 |
Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities in noisy cellular processes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5688: 173-188. DOI: 10.1016/J.Tcs.2010.10.022 |
0.342 |
|
2009 |
Guerraoui R, Henzinger TA, Singh V. Model checking transactional memories Distributed Computing. 22: 129-145. DOI: 10.1007/S00446-009-0092-6 |
0.345 |
|
2009 |
Chatterjee K, Doyen L, Henzinger TA. Probabilistic weighted automata Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5710: 244-258. DOI: 10.1007/978-3-642-04081-8_17 |
0.514 |
|
2009 |
Chatterjee K, Henzinger TA, Horn F. Stochastic Games with Finitary Objectives Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5734: 34-54. DOI: 10.1007/978-3-642-03816-7_4 |
0.626 |
|
2009 |
Chatterjee K, Doyen L, Henzinger TA. Alternating weighted automata Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5699: 3-13. DOI: 10.1007/978-3-642-03409-1_2 |
0.49 |
|
2009 |
Chatterjee K, Henzinger TA. Probabilistic systems with limsup and liminf objectives Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5489: 32-45. DOI: 10.1007/978-3-642-03092-5_4 |
0.557 |
|
2009 |
Chatterjee K, Doyen L, Henzinger TA. A survey of stochastic games with limsup and liminf objectives Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5556: 1-15. DOI: 10.1007/978-3-642-02930-1_1 |
0.59 |
|
2009 |
Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. Better quality in synthesis through quantitative objectives Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5643: 140-156. DOI: 10.1007/978-3-642-02658-4_14 |
0.43 |
|
2008 |
Doyen L, Henzinger TA, Raskin JF. Equivalence of labeled Markov chains International Journal of Foundations of Computer Science. 19: 549-563. DOI: 10.1142/S0129054108005814 |
0.373 |
|
2008 |
Chatterjee K, Henzinger TA. Reduction of stochastic parity to stochastic mean-payoff games Information Processing Letters. 106: 1-7. DOI: 10.1016/J.Ipl.2007.08.035 |
0.623 |
|
2008 |
Chatterjee K, Majumdar R, Henzinger TA. Stochastic limit-average games are in EXPTIME International Journal of Game Theory. 37: 219-234. DOI: 10.1007/S00182-007-0110-5 |
0.624 |
|
2008 |
Chatterjee K, Doyen L, Henzinger TA. Quantitative languages Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5213: 385-400. DOI: 10.1007/978-3-540-87531-428 |
0.517 |
|
2008 |
Chatterjee K, Henzinger TA, Jobstmann B. Environment assumptions for synthesis Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5201: 147-161. DOI: 10.1007/978-3-540-85361-9_14 |
0.572 |
|
2008 |
Chatterjee K, Majumdar R, Henzinger TA. Controller synthesis with budget constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4981: 72-86. DOI: 10.1007/978-3-540-78929-1-6 |
0.549 |
|
2008 |
Chatterjee K, Sen K, Henzinger TA. Model-checking ω-regular properties of interval Markov chains Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4962: 302-317. DOI: 10.1007/978-3-540-78499-9_22 |
0.536 |
|
2008 |
Chatterjee K, Henzinger TA. Value iteration Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5000: 107-138. DOI: 10.1007/978-3-540-69850-0_7 |
0.555 |
|
2007 |
Fisher J, Henzinger TA. Executable cell biology. Nature Biotechnology. 25: 1239-49. PMID 17989686 DOI: 10.1038/Nbt1356 |
0.302 |
|
2007 |
de Alfaro L, Henzinger TA, Kupferman O. Concurrent reachability games Theoretical Computer Science. 386: 188-217. DOI: 10.1016/J.Tcs.2007.07.008 |
0.415 |
|
2007 |
Beyer D, Henzinger TA, Jhala R, Majumdar R. The software model checker Blast: Applications to software engineering International Journal On Software Tools For Technology Transfer. 9: 505-525. DOI: 10.1007/S10009-007-0044-Z |
0.322 |
|
2007 |
Chatterjee K, Henzinger TA. Assume-guarantee synthesis Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4424: 261-278. |
0.458 |
|
2006 |
Chatterjee K, Doyen L, Henzinger TA, Raskin JE. Algorithms for omega-regular games with imperfect information Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4207: 287-302. DOI: 10.2168/Lmcs-3(3:4)2007 |
0.627 |
|
2006 |
Chatterjee K, Henzinger TA. Finitary winning in ω-regular games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3920: 257-271. DOI: 10.1145/1614431.1614432 |
0.647 |
|
2006 |
Chatterjee K, De Alfaro L, Henzinger TA. The complexity of quantitative concurrent parity games Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 678-687. DOI: 10.1145/1109557.1109631 |
0.591 |
|
2006 |
Henzinger TA, Matic S. An interface algebra for real-time components Real-Time Technology and Applications - Proceedings. 253-266. DOI: 10.1109/RTAS.2006.11 |
0.567 |
|
2006 |
Chatterjee K, De Alfaro L, Henzinger TA. Strategy improvement for concurrent reachability games Third International Conference On the Quantitative Evaluation of Systems, Qest 2006. 291-300. DOI: 10.1109/QEST.2006.37 |
0.594 |
|
2006 |
Chatterjee K, Henzinger TA, Jurdziński M. Games with secure equilibria Theoretical Computer Science. 365: 67-82. DOI: 10.1016/j.tcs.2006.07.032 |
0.571 |
|
2006 |
Chatterjee K, Henzinger TA. Strategy improvement and randomized subexponential algorithms for stochastic parity games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3884: 512-523. DOI: 10.1007/11672142_42 |
0.576 |
|
2006 |
Henzinger TA, Piterman N. Solving games without determinization Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4207: 395-410. |
0.399 |
|
2006 |
Henzinger TA, Prabhu VS. Timed alternating-time temporal logic Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4202: 1-17. |
0.342 |
|
2006 |
Chatterjee K, Henzinger TA. Strategy improvement for stochastic Rabin and Streett games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4137: 375-389. |
0.61 |
|
2005 |
Henzinger TA, Kirsch CM, Matic S. Composable code generation for distributed Giotto Acm Sigplan Notices. 40: 21-30. DOI: 10.1145/1070891.1065914 |
0.585 |
|
2005 |
Henzinger TA, Majumdar R, Raskin J. A classification of symbolic transition systems Acm Transactions On Computational Logic. 6: 1-32. DOI: 10.1145/1042038.1042039 |
0.343 |
|
2005 |
Matic S, Henzinger TA. Trading end-to-end latency for composability Proceedings - Real-Time Systems Symposium. DOI: 10.1109/RTSS.2005.43 |
0.566 |
|
2005 |
Chakrabarti A, Chatterjee K, Henzinger TA, Kupferman O, Majumdar R. Verifying quantitative properties using bound functions Lecture Notes in Computer Science. 50-64. DOI: 10.1007/11560548_7 |
0.608 |
|
2005 |
Chatterjee K, Henzinger TA, Jhala R, Majumdar R. Counterexample-guided planning Proceedings of the 21st Conference On Uncertainty in Artificial Intelligence, Uai 2005. 104-111. |
0.302 |
|
2005 |
Chatterjee K, Henzinger TA. Semiperfect-information games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3821: 1-18. |
0.483 |
|
2004 |
Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. Stack size analysis for interrupt-driven programs Information and Computation. 194: 144-174. DOI: 10.1016/J.Ic.2004.06.001 |
0.533 |
|
2003 |
Henzinger TA, Kirsch CM, Sanvido MAA, Pree W. From control models to real-time code using Giotto Ieee Control Systems Magazine. 23: 50-64. DOI: 10.1109/Mcs.2003.1172829 |
0.306 |
|
2003 |
Henzinger TA, Jhala R, Majumdar R, Sanvido MAA. Extreme Model Checking Lecture Notes in Computer Science. 332-358. DOI: 10.1007/978-3-540-39910-0_16 |
0.316 |
|
2003 |
Chatterjee K, Jurdziński M, Henzinger TA. Simple stochastic parity games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2803: 100-113. |
0.6 |
|
2003 |
Henzinger TA, Kirsch CM, Matic S. Schedule-carrying code Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2855: 241-256. |
0.583 |
|
2002 |
Horowitz B, Liebman J, Ma C, Koo TJ, Henzinger TA, Sangiovanni-Vincentelli A, Sastry S. Embedded Software Design And System Integration For Rotorcraft Uav Using Platforms Ifac Proceedings Volumes. 35: 447-452. DOI: 10.3182/20020721-6-Es-1901.01628 |
0.58 |
|
2002 |
Alur R, Henzinger TA, Kupferman O. Alternating-time temporal logic Journal of the Acm. 49: 672-713. DOI: 10.1145/585265.585270 |
0.404 |
|
2002 |
Schobbens PY, Raskin JF, Henzinger TA. Axioms for real-time logics Theoretical Computer Science. 274: 151-182. DOI: 10.1016/S0304-3975(00)00308-X |
0.356 |
|
2002 |
Jurdziński M, Kupferman O, Henzinger TA. Trading probability for Fairness Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2471: 292-305. |
0.357 |
|
2001 |
De Alfaro L, Henzinger TA, Majumdar R. Symbolic algorithms for infinite-state games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2154: 536-550. |
0.311 |
|
2000 |
Henzinger TA, Rajamani SK. Fair bisimulation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1785: 299-314. |
0.325 |
|
1999 |
Alur R, Fix L, Henzinger TA. Event-clock automata: A determinizable class of timed automata Theoretical Computer Science. 211: 253-273. DOI: 10.1016/S0304-3975(97)00173-4 |
0.342 |
|
1998 |
Preußig J, Kowalewski S, Wong-Toi H, Henzinger TA. An algorithm for the approximative analysis of rectangular automata Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1486: 228-240. DOI: 10.1007/Bfb0055350 |
0.366 |
|
1998 |
Henzinger TA, Kopke PW, Puri A, Varaiya P. What's Decidable about Hybrid Automata? Journal of Computer and System Sciences. 57: 94-124. DOI: 10.1006/Jcss.1998.1581 |
0.407 |
|
1997 |
Henzinger TA, Kopke PW. Discrete-time control for rectangular hybrid automata Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1256: 582-593. DOI: 10.1016/S0304-3975(99)00038-9 |
0.372 |
|
1997 |
Alur R, Henzinger TA. Real-time system = discrete system + clock variables International Journal On Software Tools For Technology Transfer. 1: 86-109. DOI: 10.1007/S100090050007 |
0.362 |
|
1996 |
Henzinger TA. Some myths about formal verification Acm Computing Surveys. 28: 119-es. DOI: 10.1145/242224.242378 |
0.31 |
|
1996 |
Alur R, Feder T, Henzinger TA. The benefits of relaxing punctuality Journal of the Acm (Jacm). 43: 116-146. DOI: 10.1145/227595.227602 |
0.376 |
|
1996 |
Alur R, Henzinger TA, Ho PH. Automatic symbolic verification of embedded systems Ieee Transactions On Software Engineering. 22: 181-201. DOI: 10.1109/32.489079 |
0.368 |
|
1995 |
Alur R, Courcoubetis C, Halbwachs N, Henzinger T, Ho P, Nicollin X, Olivero A, Sifakis J, Yovine S. The algorithmic analysis of hybrid systems Theoretical Computer Science. 138: 3-34. DOI: 10.1016/0304-3975(94)00202-T |
0.341 |
|
1994 |
Alur R, Henzinger TA. A Really Temporal Logic Journal of the Acm (Jacm). 41: 181-203. DOI: 10.1145/174644.174651 |
0.362 |
|
1994 |
Henzinger TA, Manna Z, Pnueli A. Temporal Proof Methodologies for Timed Transition-Systems Information and Computation. 112: 273-337. DOI: 10.1006/Inco.1994.1060 |
0.387 |
|
1994 |
Henzinger TA, Nicollin X, Sifakis J, Yovine S. Symbolic Model Checking for Real-Time Systems Information and Computation. 111: 193-244. DOI: 10.1006/Inco.1994.1045 |
0.41 |
|
1992 |
Henzinger TA. Sooner is safer than later Information Processing Letters. 43: 135-141. DOI: 10.1016/0020-0190(92)90005-G |
0.308 |
|
Show low-probability matches. |