The algorithmic analysis of hybrid systems

• Scaling Up Reachability Analysis for Rectangular Automata with Random Clocks

  2025 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) conference-paper Computer Science Formal Methods in Verification

  0

  citations
• Reachability analysis of Hybrid Rebeca models

  2025 Journal of Systems Architecture article Computer Science Formal Methods in Verification Open access

  1

  citations
• Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks

  2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification

  12

  citations
• Encoding inductive invariants as barrier certificates: Synthesis via difference-of-convex programming

  2022 Information and Computation article Computer Science Formal Methods in Verification

  9

  citations
• Recent developments in theory and tool support for hybrid systems verification with HyPro

  2022 Information and Computation article Computer Science Formal Methods in Verification Open access

  6

  citations
• Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming

  2021 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

  1

  citations
• Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming

  2021 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

  15

  citations
• A Transformation of Hybrid Petri Nets with Stochastic Firings into a Subclass of Stochastic Hybrid Automata

  2020 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification

  6

  citations

8 results