Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.”10.1007/978-3-030-88494-9_3__21st International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:10.1007/978-3-030-88494-9_3.

Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–93.

Ferrere, Thomas, et al. “Monitoring Event Frequencies.”10.4230/LIPIcs.CSL.2020.20__28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20.

Althoff, Matthias, et al. “ARCH-COM Category Report: Continuous and Hybrid Systems with Linear Dynamics.”10.29007/7dt2__EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 16–48, doi:10.29007/7dt2.

Geretti, Luca, et al. “ARCH-COM Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.”10.29007/zkf6__EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 49–75, doi:10.29007/zkf6.

Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.”10.4230/LIPIcs.CONCUR.2020.23__31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23.

Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.”10.4230/LIPIcs.CONCUR.2020.2__31st International Conference on Concurrency Theory, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.2.

Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.”10.34727/2020/isbn.978-3-85448-042-6_21__Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–47, doi:10.34727/2020/isbn.978-3-85448-042-6_21.

Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109.

Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.”10.1109/CDC42340.2020.9304042__Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020, IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042.

Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” 8th International Conference on Learning Representations, ICLR, 2020.

Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural Network?”10.1007/978-3-030-45237-7_5__International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:10.1007/978-3-030-45237-7_5.

Avni, Guy, et al. “Dynamic Resource Allocation Games.”10.1016/j.tcs.2019.06.031__Theoretical Computer Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.

Henzinger, Thomas A., et al. “Outside the Box: Abstraction-Based Monitoring of Neural Networks.”10.3233/FAIA200375__24th European Conference on Artificial Intelligence, vol. 325, IOS Press, 2020, pp. 2433–40, doi:10.3233/FAIA200375.

Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.”10.1007/978-3-030-51074-9_2__Automated Reasoning, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:10.1007/978-3-030-51074-9_2.

Lechner, Mathias, et al. “Neural Circuit Policies Enabling Auditable Autonomy.”10.1038/s42256-020-00237-3__Nature Machine Intelligence, vol. 2, Springer Nature, 2020, pp. 642–52, doi:10.1038/s42256-020-00237-3.

Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.”10.1109/ICRA40945.2020.9196608__Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–52, doi:10.1109/ICRA40945.2020.9196608.

Forets, Marcelo, et al. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with  Time-Triggered Transitions.”10.1109/MEMOCODE51338.2020.9314994__18th ACM-IEEE International Conference on Formal Methods and Models for System Design, 9314994, IEEE, 2020, doi:10.1109/MEMOCODE51338.2020.9314994.

Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” Proceedings of the International Conference on Embedded Software, 2020.

Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.”10.1109/TCAD.2020.3012859__IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 4018–29, doi:10.1109/TCAD.2020.3012859.

Avni, Guy, et al. “All-Pay Bidding Games on Graphs.”10.1609/aaai.v34i02.5546__Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.

Henzinger, Thomas A., and Naci E. Sarac. “Monitorability under Assumptions.”10.1007/978-3-030-60508-7_1__Runtime Verification, vol. 12399, Springer Nature, 2020, pp. 3–18, doi:10.1007/978-3-030-60508-7_1.

Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.”10.1007/978-3-030-53288-8_14__Computer Aided Verification, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:10.1007/978-3-030-53288-8_14.

Kragl, Bernhard, et al. “Inductive Sequentialization of Asynchronous Programs.”10.1145/3385412.3385980__Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–42, doi:10.1145/3385412.3385980.

Nickovic, Dejan, et al. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic.”10.1007/s10009-020-00582-z__International Journal on Software Tools for Technology Transfer, vol. 22, no. 6, Springer Nature, 2020, pp. 741–58, doi:10.1007/s10009-020-00582-z.

Kragl, Bernhard. Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8332.

Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.”10.1109/RTSS49844.2020.00031__2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.

Garcia Soto, Miriam, and Pavithra Prabhakar. “Abstraction Based Verification of Stability of Polyhedral Switched Systems.”10.1016/j.nahs.2020.100856__Nonlinear Analysis: Hybrid Systems, vol. 36, no. 5, 100856, Elsevier, 2020, doi:10.1016/j.nahs.2020.100856.

Frehse, Goran, et al. “ARCH-COM Category Report: Hybrid Systems with Piecewise Constant Dynamics.”10.29007/rjwn__ARC. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, vol. 61, EasyChair, 2019, pp. 1–13, doi:10.29007/rjwn.

Kundu, Atreyee, et al. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.”10.1109/INDIANCC.2019.8715598__5th Indian Control Conference Proceedings, 8715598, IEEE, 2019, doi:10.1109/INDIANCC.2019.8715598.

Avni, Guy, et al. “Bidding Games on Markov Decision Processes.”10.1007/978-3-030-30806-3_1__10.1007/978-3-030-30806-3_1__Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.

Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.”10.1109/icra.2019.8793840__Proceedings - IEEE International Conference on Robotics and Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840.

Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.20.

Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.

Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.”10.1109/ijcnn.2019.8851954__Proceedings of the International Joint Conference on Neural Networks, 8851954, IEEE, 2019, doi:10.1109/ijcnn.2019.8851954.

Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.”10.1007/978-3-319-91908-9_22__Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:10.1007/978-3-319-91908-9_22.

Immler, Fabian, et al. “ARCH-COM Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.”10.29007/m75b__EPiC Series in Computing, vol. 61, EasyChair Publications, 2019, pp. 41–61, doi:10.29007/m75b.

Althoff, Matthias, et al. “ARCH-COM Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.”10.29007/bj1w__EPiC Series in Computing, vol. 61, EasyChair, 2019, pp. 14–40, doi:10.29007/bj1w.

Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11.

Christakis, Maria, et al. “Semantic Fault Localization and Suspiciousness Ranking.”10.1007/978-3-030-17462-0_13__25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , vol. 11427, Springer Nature, 2019, pp. 226–43, doi:10.1007/978-3-030-17462-0_13.

Bogomolov, Sergiy, et al. “JuliaReach: A Toolbox for Set-Based Reachability.”10.1145/3302504.3311804__Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control, vol. 22, ACM, 2019, pp. 39–44, doi:10.1145/3302504.3311804.

Ferrere, Thomas, et al. “Interface-Aware Signal Temporal Logic.”10.1145/3302504.3311800__Proceedings of the 2019 22nd ACM International Conference on Hybrid Systems: Computation and Control, ACM, 2019, pp. 57–66, doi:10.1145/3302504.3311800.

Avni, Guy, et al. “Run-Time Optimization for Learned Controllers through Quantitative Games.”10.1007/978-3-030-25540-4_36__31st International Conference on Computer-Aided Verification, vol. 11561, Springer, 2019, pp. 630–49, doi:10.1007/978-3-030-25540-4_36.

Garcia Soto, Miriam, et al. “Membership-Based Synthesis of Linear Hybrid Automata.”10.1007/978-3-030-25540-4_16__31st International Conference on Computer-Aided Verification, vol. 11561, Springer, 2019, pp. 297–314, doi:10.1007/978-3-030-25540-4_16.

Avni, Guy, et al. “Infinite-Duration Bidding Games.”10.1145/3340295__Journal of the ACM, vol. 66, no. 4, 31, ACM, 2019, doi:10.1145/3340295.

Ferrere, Thomas, et al. “From Real-Time Logic to Timed Automata.”10.1145/3286976__Journal of the ACM, vol. 66, no. 3, 19, ACM, 2019, doi:10.1145/3286976.

Guet, Calin C., et al. “Transient Memory in Gene Regulation.”10.1007/978-3-030-31304-3_9__17th International Conference on Computational Methods in Systems Biology, vol. 11773, Springer Nature, 2019, pp. 155–87, doi:10.1007/978-3-030-31304-3_9.

Nidkovi, Dejan, et al. “Shape Expressions for Specifying and Extracting Signal Features.”10.1007/978-3-030-32079-9_17__19th International Conference on Runtime Verification, vol. 11757, Springer Nature, 2019, pp. 292–309, doi:10.1007/978-3-030-32079-9_17.

Kong, Hui, et al. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.”10.1007/978-3-030-29662-9_8__17th International Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 123–41, doi:10.1007/978-3-030-29662-9_8.

Ferrere, Thomas, et al. “Mixed-Time Signal Temporal Logic.”10.1007/978-3-030-29662-9_4__17th International Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 59–75, doi:10.1007/978-3-030-29662-9_4.

Giacobbe, Mirco. Automatic Time-Unbounded Reachability Analysis of Hybrid Systems. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6894.

Clarke, Edmund M., et al. Handbook of Model Checking. 1st ed., Springer Nature, 2018, doi:10.1007/978-3-319-10575-8.

Clarke, Edmund, et al. “Introduction to Model Checking.”10.1007/978-3-319-10575-8_1__Handbook of Model Checking, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:10.1007/978-3-319-10575-8_1.

Chatterjee, Krishnendu, et al. “Computing Average Response Time.”10.1007/978-3-319-95246-8_9__Principles of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:10.1007/978-3-319-95246-8_9.

Avni, Guy, et al. Timed Network Games with Clocks. Vol. 117, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.MFCS.2018.23.

Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.

Nickovic, Dejan, et al. AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic. Edited by Dirk Beyer and Marieke Huisman, vol. 10806, Springer, 2018, pp. 303–19, doi:10.1007/978-3-319-89963-3_18.

Ferrere, Thomas, et al. A Theory of Register Monitors. Vol. Part 8033, IEEE, 2018, pp. 394–403, doi:10.1145/3209108.3209194.

Bakhirkin, Alexey, et al. “Efficient Parametric Identification for STL.”10.1145/3178126.3178132__Proceedings of the 21st International Conference on Hybrid Systems, ACM, 2018, pp. 177–86, doi:10.1145/3178126.3178132.

Avni, Guy, et al. Infinite-Duration Poorman-Bidding Games. Vol. 11316, Springer, 2018, pp. 21–36, doi:10.1007/978-3-030-04612-5_2.

Kragl, Bernhard, and Shaz Qadeer. Layered Concurrent Programs. Vol. 10981, Springer, 2018, pp. 79–102, doi:10.1007/978-3-319-96145-3_5.

Bartocci, Ezio, et al. Localizing Faults in Simulink/Stateflow Models with STL. Association for Computing Machinery, Inc, 2018, pp. 197–206, doi:10.1145/3178126.3178131.

Elgyütt, Adrian, et al. Monitoring Temporal Logic with Clock Variables. Vol. 11022, Springer, 2018, pp. 53–70, doi:10.1007/978-3-030-00151-3_4.

Bakhirkin, Alexey, et al. Online Timed Pattern Matching Using Automata. Vol. 11022, Springer, 2018, pp. 215–32, doi:10.1007/978-3-030-00151-3_13.

Arming, Sebastian, et al. Parameter-Independent Strategies for PMDPs via POMDPs. Vol. 11024, Springer, 2018, pp. 53–70, doi:10.1007/978-3-319-99154-2_4.

Kong, Hui, et al. Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes. Vol. 10981, Springer, 2018, pp. 449–67, doi:10.1007/978-3-319-96145-3_24.

Jiang, Yu, et al. “Safety-Assured Model-Driven Design of the Multifunction Vehicle Bus Controller.”10.1109/TITS.2017.2778077__IEEE Transactions on Intelligent Transportation Systems, vol. 19, no. 10, IEEE, 2018, pp. 3320–33, doi:10.1109/TITS.2017.2778077.

Frehse, Goran, et al. Space-Time Interpolants. Vol. 10981, Springer, 2018, pp. 468–86, doi:10.1007/978-3-319-96145-3_25.

Brázdil, Tomás, et al. Strategy Representation by Decision Trees in Reactive Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.

Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.”10.1016/j.tcs.2017.11.001__Theoretical Computer Science, vol. 712, Elsevier, 2018, pp. 50–72, doi:10.1016/j.tcs.2017.11.001.

Ferrere, Thomas. The Compound Interest in Relaxing Punctuality. Vol. 10951, Springer, 2018, pp. 147–64, doi:10.1007/978-3-319-95582-7_9.

Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.”10.1109/emsoft.2018.8537203__2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10, doi:10.1109/emsoft.2018.8537203.

Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.

Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.”10.3390/g9030039__Games, vol. 9, no. 3, 39, MDPI AG, 2018, doi:10.3390/g9030039.

Benveniste, Albert, et al. “Contracts for System Design.”10.1561/1000000053__Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3, Now Publishers, 2018, pp. 124–400, doi:10.1561/1000000053.

Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.”10.1145/3158121__Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:10.1145/3158121.

Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.”10.1145/3060139__ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139.

Chatterjee, Krishnendu, et al. “Nested Weighted Automata.”10.1145/3152769__ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.

Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.”10.23638/LMCS-13(3:23)2017__Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.

Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.”10.1007/978-3-319-63121-9_18__Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.

Bak, Stanley, et al. Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees. Edited by Alessandro Abate and Sylvie Bodo, vol. 10381, Springer, 2017, pp. 83–89, doi:10.1007/978-3-319-63501-9_6.

Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11.

Bogomolov, Sergiy, et al., editors. Numerical Software Verification. Vol. 10152, Springer, 2017, doi:10.1007/978-3-319-54292-8.

Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi:10.15479/AT:IST-2018-853-v2-2.

Kong, Hui, et al. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.”10.1145/3049797.3049814__Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–72, doi:10.1145/3049797.3049814.

Chatterjee, Krishnendu, et al. Bidirectional Nested Weighted Automata. Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.5.

Avni, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37.

Le, Xuan, et al. “JFIX: Semantics-Based Repair of Java Programs via Symbolic  PathFinder.”10.1145/3092703.3098225__Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2017, pp. 376–79, doi:10.1145/3092703.3098225.

Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.21.

Daca, Przemyslaw. Statistical and Logical Methods for Property Checking. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:TH_730.

Bogomolov, Sergiy, et al. Conic Abstractions for Hybrid Systems. Vol. 10419, Springer, 2017, pp. 116–32, doi:10.1007/978-3-319-65765-3_7.

Bogomolov, Sergiy, et al. Counterexample Guided Refinement of Template Polyhedra. Vol. 10205, Springer, 2017, pp. 589–606, doi:10.1007/978-3-662-54577-5_34.

Svoreová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”10.1016/j.nahs.2016.04.006__Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:10.1016/j.nahs.2016.04.006.

Cerny, Pavol, et al. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.”10.1007/s10703-016-0256-5__Formal Methods in System Design, vol. 50, no. 2–3, Springer, 2017, pp. 97–139, doi:10.1007/s10703-016-0256-5.

Giacobbe, Mirco, et al. “Model Checking the Evolution of Gene Regulatory Networks.”10.1007/s00236-016-0278-x__Acta Informatica, vol. 54, no. 8, Springer, 2017, pp. 765–87, doi:10.1007/s00236-016-0278-x.

Henzinger, Thomas A., and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.”10.1016/j.nahs.2016.09.001__Nonlinear Analysis: Hybrid Systems, vol. 23, Elsevier, 2017, pp. 166–90, doi:10.1016/j.nahs.2016.09.001.

Avni, Guy, et al. Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults. Vol. 10206, Springer, 2017, pp. 169–87, doi:10.1007/978-3-662-54580-5_10.

Chatterjee, Krishnendu, et al. “Quantitative Fair Simulation Games.”10.1016/j.ic.2016.10.006__Information and Computation, vol. 254, no. 2, Elsevier, 2017, pp. 143–66, doi:10.1016/j.ic.2016.10.006.

Chatterjee, Krishnendu, et al. Faster Algorithms for Weighted Recursive State Machines. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:10.1007/978-3-662-54434-1_11.

Avni, Guy, et al. An Abstraction-Refinement Methodology for Reasoning about Network Games. AAAI Press, 2017, pp. 70–76, doi:10.24963/ijcai.2017/11.