Cover Image

Decidable Reversible Equivalences for Finite Petri Nets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gorrieri, Roberto, Lanese, Ivan
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science 68Q85 F.1.1; D.2.4; F.3.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Place Bisimilarity is Decidable, Indeed!
by: Gorrieri, Roberto
Published: (2021)

The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)

Conformance Games for Graded Semantics
by: Forster, Jonas, et al.
Published: (2024)

Axiomatizing NFAs Generated by Regular Grammars
by: Gorrieri, Roberto
Published: (2024)

Current-State Opacity in Safe Partially Observed Quantum Petri Nets: True-Concurrency Semantics and Exact Symbolic Verification
by: Ding, Sichen, et al.
Published: (2026)

Verification of Quantum Protocols Adopting Physically Admissible Schedulers
by: Ceragioli, Lorenzo, et al.
Published: (2026)

Reversible computations are computations
by: Aubert, Clément, et al.
Published: (2025)

QSeqSim: A Symbolic Simulator for Qiskit While Loops Using Sequential Quantum Circuits
by: Li, Zihao, et al.
Published: (2026)

Automating the Derivation of Unification Algorithms: A Case Study in Deductive Program Synthesis
by: Waldinger, Richard
Published: (2025)

Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements
by: Prebet, Enguerrand, et al.
Published: (2026)

Uniform Substitution for Differential Refinement Logic
by: Prebet, Enguerrand, et al.
Published: (2024)

Complementing an imperative process algebra with a rely/guarantee logic
by: Middelburg, C. A.
Published: (2025)

Probabilistic imperative process algebra
by: Middelburg, C. A.
Published: (2026)

Understanding and Improving Automated Proof Synthesis for Interactive Theorem Provers
by: Zhang, Manqing, et al.
Published: (2026)

Quantum Bisimilarity is a Congruence under Physically Admissible Schedulers
by: Ceragioli, Lorenzo, et al.
Published: (2024)

Space-time process algebra with asynchronous communication
by: Bergstra, J. A., et al.
Published: (2024)

On Woolhouse's Cotton-Spinning Problem
by: Groote, Jan Friso, et al.
Published: (2024)

A foundational characterization of Hoare Logic
by: Leivant, Daniel
Published: (2026)

Verification of E-Voting Algorithms in Dafny
by: Büttner, Robert, et al.
Published: (2025)

Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration (Extended Version)
by: Sextl, Florian, et al.
Published: (2023)

SMT-based Symbolic Model-Checking for Operator Precedence Languages
by: Chiari, Michele, et al.
Published: (2024)

Sound and Complete Invariant-Based Heap Encodings (Technical Report)
by: Esen, Zafer, et al.
Published: (2025)

Semi-Automated Modular Formal Verification of Critical Software: Liveness and Completeness Thresholds
by: Reinhard, Tobias
Published: (2024)

Automatic Function Annotations for Hoare Logic
by: Matichuk, Danielle
Published: (2012)

Monitoring Hyperproperties over Observed and Constructed Traces
by: Chalupa, Marek, et al.
Published: (2025)

Learning Closed Signal Flow Graphs
by: Piotrovskaya, Ekaterina, et al.
Published: (2024)

A correspondence between the time and space complexity
by: Latkin, Ivan V.
Published: (2023)

Strategies, model checking and branching-time properties in Maude
by: Rubio, Rubén, et al.
Published: (2024)

Model checking strategy-controlled systems in rewriting logic
by: Rubio, Rubén, et al.
Published: (2024)

Metalevel transformation of strategies
by: Rubio, Rubén, et al.
Published: (2024)

Simulating and model checking membrane systems using strategies in Maude
by: Rubio, Rubén, et al.
Published: (2024)

Formal Verification of Imperative First-Class Functions in Move
by: Grieskamp, Wolfgang, et al.
Published: (2026)

Verified VCG and Verified Compiler for Dafny
by: Nezamabadi, Daniel, et al.
Published: (2025)

From Zonotopes to Proof Certificates: A Formal Pipeline for Safe Control Envelopes
by: Hellwig, Jonathan, et al.
Published: (2025)

The Singularity Theory of Concurrent Programs: A Topological Characterization and Detection of Deadlocks and Livelocks
by: Zhang, Di
Published: (2025)

The equational theory of the Weihrauch lattice with (iterated) composition
by: Pradic, Cécilia
Published: (2024)

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

Graded Monads in the Semantics of Nominal Automata
by: Schulze, Hannes, et al.
Published: (2025)

Dormancy-aware timed branching bisimilarity, with an application to communication protocol analysis
by: Middelburg, C. A.
Published: (2021)

Array-Carrying Symbolic Execution for Function Contract Generation
by: Lu, Weijie, et al.
Published: (2026)