Masarykova univerzita

Výpis publikací

česky | in English

Filtrování publikací

    2020

  1. KLAŠKA, David, Antonín KUČERA a Vojtěch ŘEHÁK. Adversarial Patrolling with Drones. In Proceedings of the 2020 International Conference on Autonomous Agents & Multiagent Systems. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2020. s. 629-637. ISBN 978-1-4503-7518-4. doi:10.5555/3398761.3398837.
  2. CAGIRICI, Onur, Petr HLINĚNÝ, Filip POKRÝVKA a Abhisekh SANKARAN. Clique-Width of Point Configurations. In Graph-Theoretic Concepts in Computer Science, WG 2020. Springer, Lecture Notes in Computer Science, 2020. s. 54-66. ISBN 978-3-030-60439-4. doi:10.1007/978-3-030-60440-0_5.
  3. AGAOGLU, Deniz a Petr HLINĚNÝ. Isomorphism Problem for Sd-Graphs. In Javier Esparza and Daniel Kral. 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, 2020. s. "4:1"-"4:14", 14 s. ISBN 978-3-95977-159-7. doi:10.4230/LIPIcs.MFCS.2020.4.
  4. BLAHOUDEK, František, Alexandre DURET-LUTZ a Jan STREJČEK. Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization. In Shuvendu K. Lahiri and Chao Wang. Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part II. Cham (Switzerland): Springer, 2020. s. 15-27. ISBN 978-3-030-53291-8. doi:10.1007/978-3-030-53291-8_2.
  5. JONÁŠ, Martin a Jan STREJČEK. Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions. In Luca Pulina and Martina Seidl. Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings. Cham (Switzerland): Springer, 2020. s. 378-393. ISBN 978-3-030-51825-7. doi:10.1007/978-3-030-51825-7_27.
  6. CHALUPA, Marek, Tomáš JAŠEK, Lukáš TOMOVIČ, Martin HRUŠKA, Veronika ŠOKOVÁ, Paulína AYAZIOVÁ, Jan STREJČEK a Tomáš VOJNAR. Symbiotic 7: Integration of Predator and More (Competition Contribution). In Armin Biere, David Parker. Tools and Algorithms for the Construction and Analysis of Systems. Německo: Springer, 2020. s. 413-417. ISBN 978-3-030-45236-0. doi:10.1007/978-3-030-45237-7.
  7. 2019

  8. DVOŘÁK, Zdeněk, Petr HLINĚNÝ, Bojan MOHAR, Drago BOKAL, Jesus LEANOS a Tilo WIEDERA. Bounded degree conjecture holds precisely for c-crossing-critical graphs with c<=12. In 35th International Symposium on Computational Geometry, SoCG 2019. Dagstuhl: Leibniz International Proceedings in Informatics, LIPIcs, 2019. s. "14:1-14:15", 15 s. ISBN 978-3-95977-104-7. doi:10.4230/LIPIcs.SoCG.2019.14.
  9. CHALUPA, Marek a Jan STREJČEK. Evaluation of Program Slicing in Software Verification. In Wolfgang Ahrendt, Silvia Lizeth Tapia Tarifa. Integrated Formal Methods - 15th International Conference, IFM 2019, Bergen, Norway, December 2-6, 2019, Proceedings. Cham (Switzerland): Springer, 2019. s. 101-119. ISBN 978-3-030-34967-7. doi:10.1007/978-3-030-34968-4_6.
  10. HLINĚNÝ, Petr a Abhisekh SANKARAN. Exact Crossing Number Parameterized by Vertex Cover. In GD 2019: Graph Drawing and Network Visualization. Cham: Springer, Lecture Notes in Computer Science, volume 11904, 2019. s. 307-319. ISBN 978-3-030-35801-3. doi:10.1007/978-3-030-35802-0_24.
  11. BAIER, Christel, František BLAHOUDEK, Alexandre DURET-LUTZ, Joachim KLEIN, David MÜLLER a Jan STREJČEK. Generic Emptiness Check for Fun and Profit. In Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza. Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings. Cham (Switzerland): Springer, 2019. s. 445-461. ISBN 978-3-030-31783-6. doi:10.1007/978-3-030-31784-3_26.
  12. BLAHOUDEK, František, Juraj MAJOR a Jan STREJČEK. LTL to Smaller Self-Loop Alternating Automata and Back. In Robert Mark Hierons, Mohamed Mosbah. Theoretical Aspects of Computing - ICTAC 2019 - 16th International Colloquium, Hammamet, Tunisia, October 31 - November 4, 2019, Proceedings. Cham (Switzerland): Springer, 2019. s. 152-171. ISBN 978-3-030-32504-6. doi:10.1007/978-3-030-32505-3_10.
  13. MAJOR, Juraj, František BLAHOUDEK, Jan STREJČEK, Miriama JÁNOŠOVÁ a Tatiana ZBONČÁKOVÁ. ltl3tela: LTL to Small Deterministic or Nondeterministic Emerson-Lei Automata. In Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza. Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings. Cham (Switzerland): Springer, 2019. s. 357-365. ISBN 978-3-030-31783-6. doi:10.1007/978-3-030-31784-3_21.
  14. CAGIRICI, Onur, Subir GHOSH, Petr HLINĚNÝ a Bodhayan ROY. On conflict-free chromatic guarding of simple polygons. In 13th Annual International Conference on Combinatorial Optimization and Applications (COCOA'19). Cham: Springer, Lecture Notes in Computer Science, volume 11949, 2019. s. 601-612. ISBN 978-3-030-36411-3. doi:10.1007/978-3-030-36412-0_49.
  15. HLINĚNÝ, Petr a Michal KORBELA. On the achievable average degrees in 2-crossing-critical graphs. Acta Math. Univ. Comenianae. 2019, roč. 88, č. 3, s. 787-793. ISSN 0231-6986.
  16. JONÁŠ, Martin a Jan STREJČEK. Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors. In Isil Dillig, Serdar Tasiran. CAV 2019: Computer Aided Verification. Cham (Switzerland): Springer, 2019. s. 64-73. ISBN 978-3-030-25542-8. doi:10.1007/978-3-030-25543-5_4.
  17. GANIAN, Robert, Petr HLINĚNÝ, Jaroslav NEŠETŘIL, Jan OBDRŽÁLEK a Patrice OSSONA DE MENDEZ. Shrub-depth: Capturing Height of Dense Graphs. Logical Methods in Computer Science. BRAUNSCHWEIG: LOGICAL METHODS COMPUTER SCIENCE E V, 2019, roč. 15, č. 1, s. "7:1"-"7:25", 25 s. ISSN 1860-5974. doi:10.23638/LMCS-15(1:7)2019.
  18. 2018

  19. JONÁŠ, Martin a Jan STREJČEK. Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers. In Bernd Fischer, Tarmo Uustalu. Theoretical Aspects of Computing – ICTAC 2018. Cham (Switzerland): Springer, 2018. s. 273-291. ISBN 978-3-030-02507-6. doi:10.1007/978-3-030-02508-3_15.
  20. KLAŠKA, David, Antonín KUČERA, Tomáš LAMSER a Vojtěch ŘEHÁK. Automatic Synthesis of Efficient Regular Strategies in Adversarial Patrolling Games. In Proceedings of the 2018 International Conference on Autonomous Agents & Multiagent Systems. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2018. s. 659-666. ISBN 978-1-5108-6808-3. doi:10.5555/3237383.3237481.
  21. HLINĚNÝ, Petr, Filip POKRÝVKA a Bodhayan ROY. FO model checking of geometric graphs. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). LIPIcs 89. Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. s. "19:1-19:12", 12 s. ISBN 978-3-95977-051-4. doi:10.4230/LIPIcs.IPEC.2017.19.
  22. JONÁŠ, Martin a Jan STREJČEK. Is Satisfiability of Quantified Bit-Vector Formulas Stable Under Bit-Width Changes? In Gilles Barthe, Geoff Sutcliffe, Margus Veanes. LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Neuveden: EasyChair, 2018. s. 488-497. ISSN 2398-7340. doi:10.29007/spnx.
  23. CHALUPA, Marek, Jan STREJČEK a Martina VITOVSKÁ. Joint Forces for Memory Safety Checking. In María-del-Mar Gallardo and Pedro Merino. Model Checking Software. SPIN 2018. Cham, Švýcarsko: Springer, 2018. s. 115-132. ISBN 978-3-319-94110-3. doi:10.1007/978-3-319-94111-0_7.
  24. CAGIRICI, Onur, Petr HLINĚNÝ a Bodhayan ROY. On Colourability of Polygon Visibility Graphs. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). LIPIcs 93. Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. s. "21:1--21:14", 14 s. ISBN 978-3-95977-055-2. doi:10.4230/LIPIcs.FSTTCS.2017.21.
  25. BRÁZDIL, Tomáš, Antonín KUČERA a Vojtěch ŘEHÁK. Solving Patrolling Problems in the Internet Environment. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden. Neuveden: International Joint Conferences on Artificial Intelligence, 2018. s. 121-127. ISBN 978-0-9992411-2-7. doi:10.24963/ijcai.2018/17.
  26. DVOŘÁK, Zdeněk, Petr HLINĚNÝ a Bojan MOHAR. Structure and generation of crossing-critical graphs. In 34th International Symposium on Computational Geometry, SoCG 2018. Dagstuhl: Leibniz International Proceedings in Informatics, LIPIcs, 2018. s. "33:1-33:14", 14 s. ISBN 978-3-95977-066-8. doi:10.4230/LIPIcs.SoCG.2018.33.
  27. CHALUPA, Marek, Martina VITOVSKÁ a Jan STREJČEK. Symbiotic 5: Boosted Instrumentation (Competition Contribution). In Dirk Beyer and Marieke Huisman. Tools and Algorithms for the Construction and Analysis of Systems, 24th International Conference, Proceedings, Part II. Berlin: Springer, 2018. s. 442-446. ISBN 978-3-319-89963-3. doi:10.1007/978-3-319-89963-3_29.
  28. 2017

  29. BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA a Vojtěch ŘEHÁK. Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms. In Nathalie Bertrand, Luca Bortolussi. Quantitative Evaluation of Systems. Cham: Springer, 2017. s. 190-206. ISBN 978-3-319-66334-0. doi:10.1007/978-3-319-66335-7_12.
  30. JONÁŠ, Martin a Jan STREJČEK. On Simplification of Formulas with Unconstrained Variables and Quantifiers. In Serge Gaspers, Toby Walsh. Theory and Applications of Satisfiability Testing – SAT 2017. Cham (Switzerland): Springer, 2017. s. 364-379. ISBN 978-3-319-66262-6. doi:10.1007/978-3-319-66263-3_23.
  31. GAJARSKÝ, Jakub, Petr HLINĚNÝ, Martin KOUTECKÝ a Shmuel ONN. Parameterized Shifted Combinatorial Optimization. In Y. Cao and J. Chen. International Computing and Combinatorics Conference COCOON 2017 (LNCS, volume 10392). Hong Kong: Springer International Publishing AG, 2017. s. 224-236. ISBN 978-3-319-62388-7. doi:10.1007/978-3-319-62389-4_19.
  32. CHALUPA, Marek, Martina VITOVSKÁ, Martin JONÁŠ, Jiří SLABÝ a Jan STREJČEK. Symbiotic 4: Beyond Reachability (Competition Contribution). In Axel Legay, Tiziana Margaria. Tools and Algorithms for the Construction and Analysis of Systems: 23rd International Conference. Berlin: Springer Berlin Heidelberg, 2017. s. 385-389. ISBN 978-3-662-54580-5. doi:10.1007/978-3-662-54580-5_28.
  33. BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA a Vojtěch ŘEHÁK. Synthesis of Optimal Resilient Control Strategies. In Deepak D'Souza, K. Narayan Kumar. Automated Technology for Verification and Analysis. Cham: Springer International Publishing, 2017. s. 417-434. ISBN 978-3-319-68166-5. doi:10.1007/978-3-319-68167-2_27.
  34. 2016

  35. GAJARSKÝ, Jakub, Petr HLINĚNÝ, Daniel LOKSHTANOV, Jan OBDRŽÁLEK a M S RAMANUJAN. A New Perspective on FO Model Checking of Dense Graph Classes. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS2016. New York, NY, USA: ACM, 2016. s. 176-184. ISBN 978-1-4503-4391-6. doi:10.1145/2933575.2935314.
  36. BLAHOUDEK, František, Matthias HEIZMANN, Sven SCHEWE, Jan STREJČEK a Ming-Hsien TSAI. Complementing Semi-deterministic Büchi Automata. In Marsha Chechik, Jean-François Raskin. Tools and Algorithms for the Construction and Analysis of Systems 22nd International Conference, TACAS 2016. Berlin: Springer Berlin Heidelberg, 2016. s. 770-787. ISBN 978-3-662-49673-2. doi:10.1007/978-3-662-49674-9_49.
  37. DERŇÁR, Marek a Petr HLINĚNÝ. Crossing Number is Hard for Kernelization. In 32nd International Symposium on Computational Geometry (SoCG 2016). Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016. s. "42:1"-"42:10", 10 s. ISBN 978-3-95977-009-5. doi:10.4230/LIPIcs.SoCG.2016.42.
  38. KORENČIAK, Ľuboš, Antonín KUČERA a Vojtěch ŘEHÁK. Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration. In 2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems. London: IEEE Computer Society, 2016. s. 367-372. ISBN 978-1-5090-3431-4. doi:10.1109/MASCOTS.2016.34.
  39. KORENČIAK, Ľuboš, Vojtěch ŘEHÁK a Adrian FARMADIN. Extension of PRISM by Synthesis of Optimal Timeouts in Fixed-Delay CTMC. In Erika Ábrahám, Marieke Huisman. Integrated Formal Methods. Switzerland: Springer International Publishing, 2016. s. 130-138. ISBN 978-3-319-33692-3. doi:10.1007/978-3-319-33693-0_9.
  40. DACA, Przemyslaw, Thomas A. HENZINGER, Jan KŘETÍNSKÝ a Tatjana PETROV. Faster Statistical Model Checking for Unbounded Temporal Properties. In Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016. Berlin Heidelberg: Springer, 2016. s. 112-129. ISBN 978-3-662-49673-2. doi:10.1007/978-3-662-49674-9_7.
  41. CHIMANI, Markus a Petr HLINĚNÝ. Inserting Multiple Edges into a Planar Graph. In 32nd International Symposium on Computational Geometry (SoCG 2016). Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016. s. "30:1"-"30:15", 15 s. ISBN 978-3-95977-009-5. doi:10.4230/LIPIcs.SoCG.2016.30.
  42. SICKERT, Salomon, Javier ESPARZA, Stefan JAAX a Jan KŘETÍNSKÝ. Limit-Deterministic Büchi Automata for Linear Temporal Logic. In Computer Aided Verification - 28th International Conference, CAV 2016. Switzerland: Springer, 2016. s. 312-332. ISBN 978-3-319-41539-0. doi:10.1007/978-3-319-41540-6_17.
  43. DACA, Przemyslaw, Thomas A. HENZINGER, Jan KŘETÍNSKÝ a Tatjana PETROV. Linear Distances between Markov Chains. In 27th International Conference on Concurrency Theory, CONCUR 2016. Schloss Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. s. 1-15. ISBN 978-3-95977-017-0. doi:10.4230/LIPIcs.CONCUR.2016.20.
  44. SICKERT, Salomon a Jan KŘETÍNSKÝ. MoChiBA: Probabilistic {LTL} Model Checking Using Limit-Deterministic Büchi Automata. In Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016. Switzerland: Springer, 2016. s. 130-137. ISBN 978-3-319-46519-7. doi:10.1007/978-3-319-46520-3_9.
  45. BRÁZDIL, Tomáš, Antonín KUČERA a Petr NOVOTNÝ. Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. In Cyrille Artho, Axel Legay, Doron Peled. Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016. Heidelberg: Springer, 2016. s. 32-49. ISBN 978-3-319-46519-7. doi:10.1007/978-3-319-46520-3_3.
  46. BRÁZDIL, Tomáš, Ezio BARTOCCI, Dimitrios MILIOS, Guido SANGUINETTI a Luca BORTOLUSSI. Policy Learning for Time-Bounded Reachability in Continuous-Time Markov Decision Processes via Doubly-Stochastic Gradient Ascent. In Proceedings of QEST 2016. Quebec City: Springer, 2016. s. 244-259. ISBN 978-3-319-43424-7. doi:10.1007/978-3-319-43425-4_17.
  47. HLINĚNÝ, Petr a Ondřej SLÁMEČKA. Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs. In Jan Kofroň, Tomáš Vojnar. Mathematical and Engineering Methods in Computer Science, Lecture Notes in Computer Science 9548. Switzerland: Springer, 2016. s. 54-66. ISBN 978-3-319-29816-0. doi:10.1007/978-3-319-29817-7_6.
  48. JONÁŠ, Martin a Jan STREJČEK. Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams. In Nadia Creignou and Daniel Le Berre. Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference. Berlin, Heidelberg: Springer, 2016. s. 267-283. ISBN 978-3-319-40969-6. doi:10.1007/978-3-319-40970-2_17.
  49. BRÁZDIL, Tomáš, Vojtěch FOREJT, Antonín KUČERA a Petr NOVOTNÝ. Stability in Graphs and Games. In Josee Desharnais, Radha Jagadeesan. 27th International Conference on Concurrency Theory, CONCUR 2016. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. s. 1-14. ISBN 978-3-95977-017-0. doi:10.4230/LIPIcs.CONCUR.2016.10.
  50. BRÁZDIL, Tomáš, Petr NOVOTNÝ, Krishnendu CHATTERJEE, Martin CHMELÍK a Anchit GUPTA. Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract). In Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems. Singapur: ACM, 2016. s. 1465-1466. ISBN 978-1-4503-4239-1.
  51. KŘETÍNSKÝ, Jan. Survey of Statistical Verification of Linear Unbounded Properties: Model Checking and Distances. In Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016. Switzerland: Springer, 2016. s. 27-45. ISBN 978-3-319-47165-5. doi:10.1007/978-3-319-47166-2_3.
  52. CHALUPA, Marek, Martin JONÁŠ, Jiří SLABÝ, Jan STREJČEK a Martina VITOVSKÁ. Symbiotic 3: New Slicer and Error-Witness Generation (Competition Contribution). In Marsha Chechik and Jean-Francois Raskin. Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016. Berlin, Heidelberg: Springer, 2016. s. 946-949. ISBN 978-3-662-49673-2. doi:10.1007/978-3-662-49674-9_67.
  53. ČADEK, Pavel, Jan STREJČEK a Marek TRTÍK. Tighter Loop Bound Analysis. In Cyrille Artho and Axel Legay and Doron Peled. Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016. Berlin, Heidelberg: Springer, 2016. s. 512-527. ISBN 978-3-319-46519-7. doi:10.1007/978-3-319-46520-3_32.
  54. 2015

  55. BENEŠ, Nikola, Przemysław DACA, Thomas A. HENZINGER, Jan KŘETÍNSKÝ a Dejan NIČKOVIĆ. Complete Composition Operators for IOCO-Testing Theory. In Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering. New York, NY, USA: ACM, 2015. s. 101-110. ISBN 978-1-4503-3471-6. doi:10.1145/2737166.2737175.
  56. FAHRENBERG, Uli, Jan KŘETÍNSKÝ, Axel LEGAY a Louis-Marie TRAONOUEZ. Compositionality for Quantitative Specifications. In The 11th International Symposium on Formal Aspects of Component Software - FACS 2014. Heidelberg Dordrecht London New York: Springer, 2015. s. 306-324. ISBN 978-3-319-15316-2. doi:10.1007/978-3-319-15317-9_19.
  57. FOREJT, Vojtěch, Jan KRČÁL a Jan KŘETÍNSKÝ. Controller Synthesis for MDPs and Frequency LTL\GU. In LPAR 2015. Suva, Fiji: Springer, 2015. s. 162-177. ISBN 978-3-662-48898-0. doi:10.1007/978-3-662-48899-7_12.
  58. BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Martin CHMELÍK, Andreas FELLNER a Jan KŘETÍNSKÝ. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. In Daniel Kroening, Corina Pasareanu. Computer Aided Verification: 27th International Conference, CAV 2015. Cham: Springer, 2015. s. 158-177. ISBN 978-3-319-21689-8. doi:10.1007/978-3-319-21690-4_10.
  59. GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, M.S. RAMANUJAN, Daniel LOKSHTANOV a Saket SAURABH. FO Model Checking on Posets of Bounded Width. In Venkatesan Guruswami. 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. Berkeley, CA, USA: IEEE Computer Society, 2015. s. 963-974. ISBN 978-1-4673-8191-8. doi:10.1109/FOCS.2015.63.
  60. BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA a Petr NOVOTNÝ. Long-Run Average Behaviour of Probabilistic Vector Addition Systems. In Neuveden. 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. Neuveden: IEEE, 2015. s. 44-55. ISBN 978-1-4799-8875-4. doi:10.1109/LICS.2015.15.
  61. BRÁZDIL, Tomáš, Chatterjee KRISHNENDU, Vojtěch FOREJT a Antonín KUČERA. MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. In Christel Baier, Cesare Tinelli. Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings. Heidelberg: Springer, 2015. s. 181-187. ISBN 978-3-662-46680-3. doi:10.1007/978-3-662-46681-0_12.
  62. BOKAL, Drago, Mojca BRAČIČ, Marek DERŇÁR a Petr HLINĚNÝ. On Degree Properties of Crossing-critical Families of Graphs. In Emilio Di Giacomo, Anna Lubiw. Graph Drawing and Network Visualization 2015, Lecture Notes in Computer Science 9411. LNCS 9411. Berlin: Springer Verlag, 2015. s. 75-86. ISBN 978-3-319-27260-3. doi:10.1007/978-3-319-27261-0_7.
  63. FOREJT, Vojtěch a Jan KRČÁL. On Frequency LTL in Probabilistic Systems. In CONCUR 2015. Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. s. 184-197. ISBN 978-3-939897-91-0. doi:10.4230/LIPIcs.CONCUR.2015.184.
  64. HLINĚNÝ, Petr a Gelasio SALAZAR. On Hardness of the Joint Crossing Number. In Khaled Elbassioni, Kazuhisa Makino. International Symposium on Algorithms and Computation (ISAAC 2015), Lecture Notes in Computer Science 9472. LNCS 9472. Berlin: Springer Verlag, 2015. s. 603-613. ISBN 978-3-662-48970-3. doi:10.1007/978-3-662-48971-0_51.
  65. BLAHOUDEK, František, Alexandre DURET-LUTZ, Vojtěch RUJBR a Jan STREJČEK. On Refinement of Büchi Automata for Explicit Model Checking. In Fischer, Bernd and Geldenhuys, Jaco. 2015 International SPIN Symposium on Model Checking of Software. Heidelberg, New York, Dordrecht, London: Springer International Publishing, 2015. s. 66-83. ISBN 978-3-319-23403-8. doi:10.1007/978-3-319-23404-5_6.
  66. BUTKOVA, Yuliya, Hassan HATEFI, Holger HERMANNS a Jan KRČÁL. Optimal Continuous Time Markov Decisions. In ATVA 2015. Shanghai, China: Springer, 2015. s. 166-182. ISBN 978-3-319-24952-0. doi:10.1007/978-3-319-24953-7_12.
  67. BRÁZDIL, Tomáš, Ľuboš KORENČIAK, Jan KRČÁL, Petr NOVOTNÝ a Vojtěch ŘEHÁK. Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis. In Javier Campos, Boudewijn R. Haverkort. Quantitative Evaluation of Systems. BERLIN: SPRINGER-VERLAG BERLIN, 2015. s. 141-159. ISBN 978-3-319-22263-9. doi:10.1007/978-3-319-22264-6_10.
  68. KŘETÍNSKÝ, Jan, Kim Guldstrand LARSEN, Simon LAURSEN a Jiří SRBA. Polynomial Time Decidability of Weighted Synchronization under Partial Observability. In 26th International Conference on Concurrency Theory (CONCUR 2015). Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015. s. 142-154. ISBN 978-3-939897-91-0. doi:10.4230/LIPIcs.CONCUR.2015.142.
  69. KRČÁL, Jan a Pavel KRČÁL. Scalable Analysis of Fault Trees with Dynamic Features. In DSN 2015. Rio de Janeiro, Brazil: IEEE, 2015. s. 89-100. ISBN 978-1-4799-8629-3. doi:10.1109/DSN.2015.29.
  70. SVOREŇOVÁ, Mária, Jan KŘETÍNSKÝ, Martin CHMELÍK, Krishnendu CHATTERJEE, Ivana ČERNÁ a Calin BELTA. Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games. In Proceedings of ACM international conference on Hybrid Systems: Computation and Control. Seattle, Washington, USA: Association for Computing Machinery (ACM), 2015. s. 259-268. ISBN 978-1-4503-3433-4. doi:10.1145/2728606.2728608.
  71. BABIAK, Tomáš, František BLAHOUDEK, Alexandre DURET-LUTZ, Joachim KLEIN, Jan KŘETÍNSKÝ, David MÜLLER, David PARKER a Jan STREJČEK. The Hanoi Omega-Automata Format. In Daniel Kroening, Corina Pasareanu. Computer Aided Verification: 27th International Conference, CAV 2015. Cham: Springer, 2015. s. 479-486. ISBN 978-3-319-21689-8. doi:10.1007/978-3-319-21690-4_31.
  72. CHATTERJEE, Krishnendu, Zuzana KOMÁRKOVÁ a Jan KŘETÍNSKÝ. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. In Thirtieth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Los Alamitos, California: IEEE, 2015. s. 244-256. ISBN 978-1-4799-8875-4. doi:10.1109/LICS.2015.32.
  73. 2014

  74. KORENČIAK, Ľuboš, Jan KRČÁL a Vojtěch ŘEHÁK. Dealing with Zero Density Using Piecewise Phase-Type Approximation. In András Horváth, Katinka Wolter. Computer Performance Engineering. Switzerland: Springer International Publishing, 2014. s. 119-134. ISBN 978-3-319-10884-1. doi:10.1007/978-3-319-10885-8_9.
  75. GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK a Sebastian ORDYNIAK. Faster Existential FO Model Checking on Posets. In Hee-Kap Ahn, Chan-Su Shin. ISAAC 2014, LNCS 8889. Berlin: Springer International Publishing, 2014. s. 441-451. ISBN 978-3-319-13074-3. doi:10.1007/978-3-319-13075-0_35.
  76. BLAHOUDEK, František, Alexandre DURET-LUTZ, Mojmír KŘETÍNSKÝ a Jan STREJČEK. Is there a best Büchi automaton for explicit model checking? In Neha Rungta and Oksana Tkachuk. 2014 International SPIN Symposium on Model Checking of Software. New York: ACM, 2014. s. 68-76. ISBN 978-1-4503-2452-6. doi:10.1145/2632362.2632377.
  77. BRÁZDIL, Tomáš, David KLAŠKA, Antonín KUČERA a Petr NOVOTNÝ. Minimizing Running Costs in Consumption Systems. In Armin Biere, Roderick Bloem. Computer Aided Verification. Neuveden: Springer International Publishing, 2014. s. 457-472. ISBN 978-3-319-08866-2. doi:10.1007/978-3-319-08867-9_30.
  78. ABAFFY, Michal, Tomáš BRÁZDIL, Vojtěch ŘEHÁK, Branislav BOŠANSKÝ, Antonín KUČERA a Jan KRČÁL. Solving adversarial patrolling games with bounded error: (extended abstract). In Alessio Lomuscio, Paul Scerri, Ana Bazzan, and Michael Huhns. Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'14). Richland, SC, USA: International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2014. s. 1617-1618. ISBN 978-1-4503-2738-1.
  79. SLABÝ, Jiří a Jan STREJČEK. Symbiotic 2: More Precise Slicing (Competition Contribution). In E. Ábrahám and K. Havelund. Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, TACAS 2014. Berlin, Heidelberg: Springer, 2014. s. 415-417. ISBN 978-3-642-54861-1. doi:10.1007/978-3-642-54862-8_34.
  80. TRTÍK, Marek a Jan STREJČEK. Symbolic Memory with Pointers. In Franck Cassez and Jean-Francois Raskin. Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014. Berlin Heidelberg: Springer, 2014. s. 380-395. ISBN 978-3-319-11935-9. doi:10.1007/978-3-319-11936-6_27.
  81. BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Martin CHMELÍK, Vojtěch FOREJT, Jan KŘETÍNSKÝ, Marta KWIATKOWSKA, David PARKER a Mateusz UJMA. Verification of Markov Decision Processes using Learning Algorithms. In Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014. Heidelberg Dordrecht London New York: Springer, 2014. s. 98-114. ISBN 978-3-319-11935-9. doi:10.1007/978-3-319-11936-6_8.
  82. BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA, Petr NOVOTNÝ a Joost-Pieter KATOEN. Zero-reachability in probabilistic multi-counter automata. In Thomas Henzinger and Dale Miller. Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). New York: ACM, 2014. s. nestránkováno, 10 s. ISBN 978-1-4503-2886-9. doi:10.1145/2603088.2603161.
  83. 2013

  84. SLABÝ, Jiří, Jan STREJČEK a Marek TRTÍK. ClabureDB: Classified Bug-Reports Database Tool for Developers of Program Analysis Tools. In Roberto Giacobazzi, Josh Berdine, Isabella Mastroeni. Verification, Model Checking, and Abstract Interpretation: 14th International Conference, VMCAI 2013. Berlin, Heidelberg: Springer, 2013. s. 268-274. ISBN 978-3-642-35872-2. doi:10.1007/978-3-642-35873-9_17.
  85. SLABÝ, Jiří, Jan STREJČEK a Marek TRTÍK. Compact Symbolic Execution. In Hung Dang-Van and Mizuhito Ogawa. 11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013. Berlin Heidelberg: Springer, 2013. s. 193-207. ISBN 978-3-319-02443-1. doi:10.1007/978-3-319-02444-8_15.
  86. BLAHOUDEK, František, Mojmír KŘETÍNSKÝ a Jan STREJČEK. Comparison of LTL to Deterministic Rabin Automata Translators. In Kenneth L. McMillan, Aart Middeldorp, and Andrei Voronkov. Logic for Programming Artificial Intelligence and Reasoning, LPAR-19. Berlin Heidelberg: Springer, 2013. s. 164-172. ISBN 978-3-642-45220-8. doi:10.1007/978-3-642-45221-5_12.
  87. BABIAK, Tomáš, Thomas BADIE, Alexandre DURET-LUTZ, Mojmír KŘETÍNSKÝ a Jan STREJČEK. Compositional Approach to Suspension and Other Improvements to LTL Translation. In Ezio Bartocci, C. R. Ramakrishnan. Model Checking Software - 20th International Symposium, SPIN 2013. LNCS 7976. Berlin Heidelberg: Springer, 2013. s. 81-98. ISBN 978-3-642-39175-0. doi:10.1007/978-3-642-39176-7_6.
  88. HERMANNS, Holger, Jan KRČÁL a Jan KŘETÍNSKÝ. Compositional Verification and Optimization of Interactive Markov Chains. In CONCUR 2013 - Concurrency Theory - 24th International Conference. Heidelberg Dordrecht London New York: Springer, 2013. s. 364-379. ISBN 978-3-642-40183-1. doi:10.1007/978-3-642-40184-8_26.
  89. CHMELÍK, Martin a Vojtěch ŘEHÁK. Controllable-choice Message Sequence Graphs. In Proceedings of Mathematical and Engineering Methods in Computer Science, 8th Doctoral Workshop (MEMICS 2012), Selected Papers. Berlin Heidelberg: Springer, 2013. s. 118-130. ISBN 978-3-642-36044-2. doi:10.1007/978-3-642-36046-6_12.
  90. BRÁZDIL, Tomáš, Antonín KUČERA a Petr NOVOTNÝ. Determinacy in Stochastic Games with Unbounded Payoff Functions. In Mathematical and Engineering Methods in Computer Science (MEMICS 2012). Heidelberg: Springer, 2013. s. 94-105. ISBN 978-3-642-36044-2. doi:10.1007/978-3-642-36046-6_10.
  91. BLAHOUDEK, František, Tomáš BABIAK, Mojmír KŘETÍNSKÝ a Jan STREJČEK. Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment. In Hung Dang-Van and Mizuhito Ogawa. 11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013. Berlin Heidelberg: Springer, 2013. s. 24-38. ISBN 978-3-319-02443-1. doi:10.1007/978-3-319-02444-8_4.
  92. OBDRŽÁLEK, Jan a Robert GANIAN. Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. In Thierry Lecroq, Laurent Mouchard. Combinatorial Algorithms 24th International Workshop, IWOCA 2013. Berlin Heidelberg: Springer, 2013. s. 164-177. ISBN 978-3-642-45277-2. doi:10.1007/978-3-642-45278-9_15.
  93. GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ a Jakub TESKA. FO Model Checking of Interval Graphs. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg. ICALP (2) 2013. Berlin Heidelberg: Springer, 2013. s. 250-262. ISBN 978-3-642-39211-5. doi:10.1007/978-3-642-39212-2_24.
  94. GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, Felix REIDL, Peter ROSSMANITH, Fernando Sanchez VILLAAMIL a Somnath SIKDAR. Kernelization Using Structural Parameters on Sparse Graph Classes. In Hans L. Bodlaender a Giuseppe F. Italiano. ESA 2013. Berlin Heidelberg: Springer, 2013. s. 529-540. ISBN 978-3-642-40449-8. doi:10.1007/978-3-642-40450-4_45.
  95. BRÁZDIL, Tomáš, Ľuboš KORENČIAK, Jan KRČÁL, Jan KŘETÍNSKÝ a Vojtěch ŘEHÁK. On time-average limits in deterministic and stochastic Petri nets. In ACM/SPEC International Conference on Performance Engineering, ICPE'13. New York: ACM, 2013. s. 421-422. ISBN 978-1-4503-1636-1. doi:10.1145/2479871.2479936.
  96. HLINĚNÝ, Petr a Martin DERKA. Planar Emulators Conjecture Is Nearly True for Cubic Graphs. In J. Nešetřil, M. Pellegrini. The Seventh European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013. Pisa, Italy: Scuola Normale Superiore Pisa, 2013. s. 245-250. ISBN 978-88-7642-474-8.
  97. BRÁZDIL, Tomáš, Taolue CHEN, Vojtěch FOREJT, Petr NOVOTNÝ a Aistis SIMAITIS. Solvency Markov Decision Processes with Interest. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Dagstuhl, Germany: IBFI Schloss Dagstuhl, 2013. s. 487-499. ISBN 978-3-939897-64-4. doi:10.4230/LIPIcs.FSTTCS.2013.487.
  98. SLABÝ, Jiří, Jan STREJČEK a Marek TRTÍK. Symbiotic: Synergy of Instrumentation, Slicing, and Symbolic Execution - (Competition Contribution). In Nir Piterman, Scott A. Smolka. Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013. Berlin, Heidelberg: Springer, 2013. s. 630-632. ISBN 978-3-642-36741-0. doi:10.1007/978-3-642-36742-7_50.
  99. BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Vojtěch FOREJT a Antonín KUČERA. Trading Performance for Stability in Markov Decision Processes. In Proceedings of 28th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2013). London: IEEE Computer Society, 2013. s. 331-340. ISBN 978-1-4799-0413-6. doi:10.1109/LICS.2013.39.
  100. 2012

  101. BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA a Petr NOVOTNÝ. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. In Computer Aided Verification - 24th International Conference, CAV 2012. Berlin: Springer, 2012. s. 23-38. ISBN 978-3-642-31423-0. doi:10.1007/978-3-642-31424-7_8.
  102. GAJARSKÝ, Jakub a Petr HLINĚNÝ. Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). 2012. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2012. s. 112-123. ISBN 978-3-939897-47-7. doi:10.4230/LIPIcs.FSTTCS.2012.112.
  103. GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Peter ROSSMANITH a Somnath SIKDAR. Lower Bounds on the Complexity of MSO_1 Model-Checking. In 29th International Symposium on Theoretical Aspects of Computer Science STACS2012. 2012. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2012. s. 326-337. ISBN 978-3-939897-35-4. doi:10.4230/LIPIcs.STACS.2012.326.
  104. BRÁZDIL, Tomáš, Antonín KUČERA, Petr NOVOTNÝ a Dominik WOJTCZAK. Minimizing Expected Termination Time in One-Counter Markov Decision Processes. In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012). Berlin: Springer, 2012. s. 141-152. ISBN 978-3-642-31584-8. doi:10.1007/978-3-642-31585-5_16.
  105. BRÁZDIL, Tomáš a Stefan KIEFER. Stabilization of Branching Queueing Networks. In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science. Paris, France: IBFI Schloss Dagstuhl, 2012. s. 507-518. ISBN 978-3-939897-35-4.
  106. BRÁZDIL, Tomáš, Holger HERMANNS, Jan KRČÁL, Jan KŘETÍNSKÝ a Vojtěch ŘEHÁK. Verification of Open Interactive Markov Chains. In Deepak D'Souza and Telikepalli Kavitha and Jaikumar Radhakrishnan. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2012. s. 474-485. ISBN 978-3-939897-47-7. doi:10.4230/LIPIcs.FSTTCS.2012.474.
  107. GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Jaroslav NEŠETŘIL, Patrice OSSONA DE MENDEZ a Reshma RAMADURAI. When Trees Grow Low: Shrubs and Fast MSO1. In Math Foundations of Computer Science MFCS 2012. 7464. vyd. Německo: Lecture Notes in Computer Science, Springer-Verlag, 2012. s. 419-430. ISBN 978-3-642-32588-5. doi:10.1007/978-3-642-32589-2_38.
Zobrazit podrobně
Zobrazeno: 1. 3. 2021 17:19