Cover Image

Nets-within-Nets through the Lens of Data Nets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Di Cosmo, Francesco, Mal, Soumodev, Prince, Tephilla
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Formal Languages and Automata Theory Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Non-commutative linear logic fragments with sub-context-free complexity
by: Nishimiya, Yusaku, et al.
Published: (2025)

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

On Higher Order Busy Beaver Function
by: Cao, Zining
Published: (2025)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
by: Shakiba, Yousef, et al.
Published: (2025)

Reachability in Geometrically $d$-Dimensional VASS
by: Fu, Yuxi, et al.
Published: (2025)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
by: Göller, Stefan, et al.
Published: (2023)

Stochastic Process Turing Machines
by: Wolpert, David, et al.
Published: (2024)

Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
by: Achilleos, Antonis, et al.
Published: (2024)

The Complexity of Nested Reset Counter Systems
by: Balasubramanian, A. R., et al.
Published: (2026)

Counting and Sampling Traces in Regular Languages
by: de Colnet, Alexis, et al.
Published: (2025)

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
by: Halftermeyer, Pierre
Published: (2026)

A Framework for Universality in Physics, Computer Science, and Beyond
by: Gonda, Tomáš, et al.
Published: (2023)

CMSO-transducing tree-like graph decompositions
by: Campbell, Rutger, et al.
Published: (2024)

Weighted basic parallel processes and combinatorial enumeration
by: Clemente, Lorenzo
Published: (2024)

A positional $\mathbfΠ^0_3$-complete objective
by: Casares, Antonio, et al.
Published: (2024)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)

Symbolic ω-automata with obligations
by: Di Stefano, Luca
Published: (2025)

Execution and monitoring of HOA automata with HOAX
by: Di Stefano, Luca
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)

Proceedings Combined 31st International Workshop on Expressiveness in Concurrency and 21st Workshop on Structural Operational Semantics
by: Caltais, Georgiana, et al.
Published: (2024)

Deciding the synthesis problem for hybrid games through bisimulation
by: Dima, Catalin, et al.
Published: (2024)

Improving Reachability in Vector Addition Systems through Pumpability
by: Chen, Weijun, et al.
Published: (2026)

On the Impact of the Communication Model on Realisability
by: Di Giusto, Cinzia, et al.
Published: (2025)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
by: Guha, Shibashis, et al.
Published: (2026)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
by: Aceto, Luca, et al.
Published: (2025)

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

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

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

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)

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

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)

The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games
by: Bhaduri, Purandar
Published: (2025)

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)