Image de couverture de livre

Decidability Issues for Petri Nets -- a survey

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Esparza, Javier, Nielsen, Mogens
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory Distributed, Parallel, and Cluster Computing F.1.1; F.1.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Computing Inductive Invariants of Regular Abstraction Frameworks
par: Czerner, Philipp, et autres
Publié: (2024)

A LOCAL View of the Polynomial Hierarchy
par: Reiter, Fabian
Publié: (2023)

A Uniform Framework for Problems on Context-Free Grammars
par: Esparza, Javier, et autres
Publié: (2024)

PVASS Reachability is Decidable
par: Guttenberg, Roland, et autres
Publié: (2025)

On some Classes of Reversible 2-head Automata
par: Nagy, Benedek, et autres
Publié: (2025)

Constructing Weakly Terminating Interface Protocols
par: Bera, Debjyoti, et autres
Publié: (2026)

Synchronizability of Communicating Finite State Machines is not Decidable
par: Finkel, Alain, et autres
Publié: (2017)

Deterministic Suffix-reading Automata
par: Keerthan, R, et autres
Publié: (2024)

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
par: Baumann, Pascal, et autres
Publié: (2024)

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
par: Scoones, Andrew, et autres
Publié: (2024)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
par: Mathew, Prince, et autres
Publié: (2024)

Flattability of Priority Vector Addition Systems
par: Guttenberg, Roland
Publié: (2024)

Checking Timed Bisimilarity with Virtual Clocks
par: Lieb, Alexander, et autres
Publié: (2024)

Exploring VASS Parameterised by Geometric Dimension
par: Czerwiński, Wojciech, et autres
Publié: (2026)

On Constructing Finite Automata by Relational Programming
par: Egri-Nagy, Attila, et autres
Publié: (2025)

The Black Ninjas and the Sniper: On Robustness of Population Protocols
par: Lossin, Benno, et autres
Publié: (2024)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
par: Lee, Changryeol
Publié: (2026)

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
par: Silva, Jorge Miguel
Publié: (2026)

Construction of Minkowski Sums by Cellular Automata
par: Tahay, Pierre-Adrien
Publié: (2024)

Learning Tree Automata with Term Rewriting
par: Kopystiański, Jakub, et autres
Publié: (2026)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
par: Rote, Günter
Publié: (2024)

On the Boolean Closure of Deterministic Top-Down Tree Automata
par: Löding, Christof, et autres
Publié: (2024)

Probabilistic Finite Automaton Emptiness is undecidable
par: Rote, Günter
Publié: (2024)

On Repetitive Finite Automata with Translucent Words
par: Mráz, František, et autres
Publié: (2025)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
par: Löding, Christof, et autres
Publié: (2022)

Recognizing Numbers
par: Gaba, Pranshu, et autres
Publié: (2025)

Lexicographic transductions of finite words
par: Filiot, Emmanuel, et autres
Publié: (2025)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
par: Bojańczyk, Mikołaj, et autres
Publié: (2021)

Identity Testing for Stochastic Languages
par: Agarwal, Smayan, et autres
Publié: (2025)

On Direct Product and Quotient of Strongly Connected Automata
par: Hu, Zino H.
Publié: (2011)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
par: Esparza, Javier, et autres
Publié: (2025)

Edit Distance of Finite State Transducers
par: Aiswarya, C., et autres
Publié: (2024)

Edit Distance of Finite-Valued Transducers
par: Mathew, Prince, et autres
Publié: (2026)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
par: Guttenberg, Roland, et autres
Publié: (2025)

Parameterized Verification of Timed Networks with Clock Invariants
par: André, Étienne, et autres
Publié: (2024)

Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability
par: Guillou, Lucie, et autres
Publié: (2023)

Verifying Randomized Consensus Protocols with Common Coins
par: Gao, Song, et autres
Publié: (2024)

Logical Synchrony Networks: A formal model for deterministic distribution
par: Kenwright, Logan, et autres
Publié: (2024)

State machines for large scale computer software and systems
par: Yodaiken, Victor
Publié: (2016)

Population Protocols over Ordered Agents
par: Blondin, Michael, et autres
Publié: (2026)