Imagen de Portada

On the Home-Space Problem for Petri Nets and its Ackermannian Complexity

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jančar, Petr, Leroux, Jérôme
Formato:	Preprint
Publicado:	2022
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

A concise proof of Commoner's theorem
por: Jancar, Petr
Publicado: (2024)

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

Hypersequent Calculi Have Ackermannian Complexity
por: Balasubramanian, A. R., et al.
Publicado: (2026)

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

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

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

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

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

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
por: Amat, Nicolas, et al.
Publicado: (2024)

On the Reachability Problem for Two-Dimensional Branching VASS
por: Bizière, Clotilde, et al.
Publicado: (2025)

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

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

Separators in Continuous Petri Nets
por: Blondin, Michael, et al.
Publicado: (2022)

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

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

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

Bayesian Networks and Proof-Nets: the proof-theory of Bayesian Inference
por: Di Guardia, Rémi, et al.
Publicado: (2026)

Invariants for One-Counter Automata with Disequality Tests
por: Chistikov, Dmitry, et al.
Publicado: (2024)

The Discontinuity Problem
por: Brattka, Vasco
Publicado: (2020)

Decidability and Complexity of Decision Problems for Affine Continuous VASS
por: Balasubramanian, A. R.
Publicado: (2024)

A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
por: Arias, Jaime, et al.
Publicado: (2024)

Cyclic Implicit Complexity
por: Curzi, Gianluca, et al.
Publicado: (2021)

On the Descriptive Complexity of Vertex Deletion Problems
por: Bannach, Max, et al.
Publicado: (2024)

The Descriptive Complexity of Relation Modification Problems
por: Chudigiewitsch, Florian, et al.
Publicado: (2026)

On the Complexity of the Skolem Problem at Low Orders
por: Bacik, Piotr, et al.
Publicado: (2025)

The Complexity of the Constructive Master Modality
por: Santiago-Fernández, Sofía, et al.
Publicado: (2026)

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
por: Neumann, Eike
Publicado: (2025)

Problems and Consequences of Bilateral Notions of (Meta-)Derivability
por: Ayhan, Sara
Publicado: (2025)

The Proof Analysis Problem
por: Arteche, Noel, et al.
Publicado: (2025)

Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
por: Pshenitsyn, Tikhon
Publicado: (2023)

A logic of judgmental existence and its relation to proof irrelevance
por: Pezlar, Ivo
Publicado: (2024)

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

Proof Complexity of Linear Logics
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2026)

Meta-Mathematics of Computational Complexity Theory
por: Oliveira, Igor C.
Publicado: (2025)

Correspondence and Inverse Correspondence for Input/Output Logic and Region-Based Theories of Space
por: De Domenico, Andrea, et al.
Publicado: (2024)

Bi-reachability in Petri nets with data
por: Kamiński, Łukasz, et al.
Publicado: (2024)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
por: Zhuk, Dmitriy
Publicado: (2024)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
por: Atserias, Albert, et al.
Publicado: (2024)