Corpus ID: 222380419

Directed Reachability for Infinite-State Systems

  title={Directed Reachability for Infinite-State Systems},
  author={M. Blondin and C. Haase and Philip Offtermatt},
  • M. Blondin, C. Haase, Philip Offtermatt
  • Published 2020
  • Computer Science
  • ArXiv
  • Numerous tasks in program analysis and synthesis reduce to deciding reachability in possibly infinite graphs such as those induced by Petri nets. However, the Petri net reachability problem has recently been shown to require non-elementary time, which raises questions about the practical applicability of Petri nets as target models. In this paper, we introduce a novel approach for efficiently semi-deciding the reachability problem for Petri nets in practice. Our key insight is that… CONTINUE READING


    Some Decision Problems Related to the Reachability Problem for Petri Nets
    • 103
    Continuous Reachability for Unordered Data Petri nets is in PTime
    • 2
    • PDF
    Complexity of Some Problems in Petri Nets
    • 252
    • PDF
    KReach: A Tool for Reachability in Petri Nets
    • 1
    • PDF
    Complexity Analysis of Continuous Petri Nets
    • 23
    • PDF
    The reachability problem for Petri nets is not elementary
    • 57
    • PDF
    An algorithmic framework for checking coverability in well-structured transition systems
    • Tim Strazny
    • Computer Science
    • Berichte aus dem Department für Informatik / Universität Oldenburg / Fachbereich Informatik
    • 2014
    • 2
    • PDF
    An SMT-Based Approach to Coverability Analysis
    • 39
    • Highly Influential
    • PDF
    Unbounded-Thread Program Verification using Thread-State Equations
    • 14
    • PDF
    Survey on Directed Model Checking
    • 40
    • PDF