Cover Image

Separators in Continuous Petri Nets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Blondin, Michael, Esparza, Javier
Format:	Preprint
Published:	2022
Subjects:	Logic in Computer Science Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
by: Bozga, Marius, et al.
Published: (2023)

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
by: Bueri, Lucas, et al.
Published: (2024)

From Sound Workflow Nets to LTLf Declarative Specifications by Casting Three Spells
by: Barbaro, Luca, et al.
Published: (2025)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

Continuous Pushdown VASS in One Dimension are Easy
by: Perez, Guillermo A., et al.
Published: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Nets-within-Nets through the Lens of Data Nets
by: Di Cosmo, Francesco, et al.
Published: (2025)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

Positive Hennessy-Milner Logic for Branching Bisimulation
by: Geuvers, Herman, et al.
Published: (2022)

Existential Definability over the Subword Ordering
by: Baumann, Pascal, et al.
Published: (2022)

Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2022)

A Hierarchy of Nondeterminism
by: Radi, Bader Abu, et al.
Published: (2022)

An Elementary Proof of the FMP for Kleene Algebra
by: Kappé, Tobias
Published: (2022)

On Good-for-MDPs Automata
by: Schewe, Sven, et al.
Published: (2022)

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
by: Czerwiński, Wojciech, et al.
Published: (2022)

Characterising memory in infinite games
by: Casares, Antonio, et al.
Published: (2022)

Monitoring Timed Properties (Revisited)
by: Grosen, Thomas Møller, et al.
Published: (2022)

A Dichotomy Theorem for Automatic Structures
by: Cuvelier, Antoine, et al.
Published: (2026)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

The Queue Automaton Revisited
by: Baeten, Jos C. M., et al.
Published: (2025)

Simplifying LTL Model Checking Given Prior Knowledge
by: Duret-Lutz, Alexandre, et al.
Published: (2025)

Determinization of Min-Plus Weighted Automata is Decidable
by: Almagor, Shaull, et al.
Published: (2025)

Unreliability in Practical Subclasses of Communicating Systems
by: Suresh, Amrita, et al.
Published: (2025)

Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics
by: Di Giusto, Cinzia, et al.
Published: (2025)

Parameterized Verification of Quantum Circuits (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2025)

How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2026)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
by: Li, Junle, et al.
Published: (2025)

AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2024)

Simple grammar bisimilarity, with an application to session type equivalence
by: Poças, Diogo, et al.
Published: (2024)

Runtime Verification: Monitoring, Knowledge, and Uncertainty (Lecture Notes)
by: Bollig, Benedikt
Published: (2026)

On Dependent Variables in Reactive Synthesis
by: Akshay, S., et al.
Published: (2024)

String Solving with Stabilization and Transducers (Technical Report)
by: Chocholatý, David, et al.
Published: (2026)