Cover Image

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Amat, Nicolas, Zilio, Silvano Dal, Botlan, Didier Le
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Complexity of Proving Polyhedral Reductions
by: Amat, Nicolas, et al.
Published: (2023)

TAPAAL HyperLTL: A Tool for Checking Hyperproperties of Petri Nets
by: Gonzalez, Bruno Maria René, et al.
Published: (2025)

Verification of Nonblockingness in Bounded Petri Nets With Minimax Basis Reachability Graphs
by: Gu, Chao, et al.
Published: (2020)

Pseudo-Complex Quantifier Elimination
by: Faroß, Nicolas, et al.
Published: (2026)

Soundness Correction of Data Petri Nets
by: Suvorov, Nikolai M., et al.
Published: (2024)

Structural Liveness of Conservative Petri Nets
by: Jančar, Petr, et al.
Published: (2025)

Petri Nets and Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2025)

Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules
by: Lyon, Tim S., et al.
Published: (2026)

Efficient Probabilistic Model Checking for Relational Reachability (Extended Version)
by: Gerlach, Lina, et al.
Published: (2025)

Structural Liveness of Immediate Observation Petri Nets
by: Jancar, Petr, et al.
Published: (2021)

Methods for Efficient Unfolding of Colored Petri Nets
by: Bilgram, Alexander, et al.
Published: (2022)

On Efficient Algorithms For Partial Quantifier Elimination
by: Goldberg, Eugene
Published: (2024)

Partial Quantifier Elimination By Certificate Clauses
by: Goldberg, Eugene
Published: (2020)

On the Home-Space Problem for Petri Nets and its Ackermannian Complexity
by: Jančar, Petr, et al.
Published: (2022)

Invariant Checking for SMT-based Systems with Quantifiers
by: Redondi, Gianluca, et al.
Published: (2024)

Structure-Aware Computing, Partial Quantifier Elimination And SAT
by: Goldberg, Eugene
Published: (2024)

Integer Linear-Exponential Programming in NP by Quantifier Elimination
by: Chistikov, Dmitry, et al.
Published: (2024)

Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
by: Cesco, Arnaldo, et al.
Published: (2021)

Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking)
by: Lichtner, Kilian, et al.
Published: (2025)

Quantifier Elimination Meets Treewidth
by: Wu, Hao, et al.
Published: (2026)

Quantum Petri Nets with Event Structures semantics
by: Joachim, Julien Saan, et al.
Published: (2025)

Quantum Petri Nets with Event Structure semantics
by: Joachim, Julien Saan, et al.
Published: (2025)

Quantifier Elimination and Craig Interpolation, Quantitatively
by: Batz, Kevin, et al.
Published: (2025)

One-Parametric Presburger Arithmetic has Quantifier Elimination
by: Mansutti, Alessio, et al.
Published: (2025)

Separators in Continuous Petri Nets
by: Blondin, Michael, et al.
Published: (2022)

Home Spaces and Invariants to Analyze Parameterized Petri Nets
by: Memmi, Gerard
Published: (2024)

Continuous Petri Nets Faithfully Fluidify Most Permissive Boolean Networks
by: Haar, Stefan, et al.
Published: (2025)

On the Cut Elimination of Weak Intuitionistic Tense Logic
by: Wang, Yiheng, et al.
Published: (2024)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
by: Grilletti, Gianluca, et al.
Published: (2024)

Relating Reversible Petri Nets and Reversible Event Structures, categorically
by: Melgratti, Hernán, et al.
Published: (2023)

Multiple Reachability in Linear Dynamical Systems
by: Karimov, Toghrul, et al.
Published: (2024)

Trees in Coalgebra from Generalized Reachability
by: Wißmann, Thorsten, et al.
Published: (2025)

Property Directed Reachability with Extended Resolution
by: Luka, Andrew, et al.
Published: (2025)

Symbolic Model Checking using Intervals of Vectors
by: Morard, Damien, et al.
Published: (2026)

Initial Algebra Correspondence under Reachability Conditions
by: Kori, Mayuko, et al.
Published: (2025)

On Higher-Order Reachability Games vs May Reachability
by: Asada, Kazuyuki, et al.
Published: (2022)

The Dual of Quantifier Elimination: Boolean Elimination over C and R
by: Frank, Matthew
Published: (2025)

Embedded Finite Models Beyond Restricted Quantifier Collapse
by: Benedikt, Michael, et al.
Published: (2023)

Robust Almost-Sure Reachability in Multi-Environment MDPs
by: van der Vegt, Marck, et al.
Published: (2023)

Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)