Cover Image

Dependence and Independence for Reversible Process Calculi

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aubert, Clément, Phillips, Iain, Ulidowski, Irek
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science 68Q85 F.4.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (Full Version)
by: Nishida, Naoki
Published: (2026)

Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version)
by: Nishida, Naoki, et al.
Published: (2026)

Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (Full Version)
by: Kojima, Misaki, et al.
Published: (2026)

Decidable Reversible Equivalences for Finite Petri Nets
by: Gorrieri, Roberto, et al.
Published: (2025)

Compositionality in Coalgebraic Trace Semantics
by: Jourde, Robin, et al.
Published: (2026)

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

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

Behavioural Conformances based on Lax Couplings
by: Wild, Paul, et al.
Published: (2025)

A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
by: Ramos, Arthur, et al.
Published: (2025)

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

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

An Axiomatic Theory for Reversible Computation
by: Lanese, Ivan, et al.
Published: (2023)

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

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

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
by: Nakano, Keisuke, et al.
Published: (2024)

Gödel Mirror: A Formal System For Contradiction-Driven Recursion
by: Chan, Jhet
Published: (2025)

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

Quantitative Graded Semantics and Spectra of Behavioural Metrics
by: Forster, Jonas, et al.
Published: (2023)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
by: Rahnama, Moses
Published: (2025)

Unifying Weak Independence and Signal Hierarchy Theory: Extended Biological Petri Net Formalism with Application to Vibrio fischeri Quorum Sensing
by: Simao, Eugenio
Published: (2025)

A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space
by: Bergougnoux, Benjamin, et al.
Published: (2025)

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

Generalized Kantorovich-Rubinstein Duality beyond Hausdorff and Kantorovich
by: Wild, Paul, et al.
Published: (2025)

Composing Codensity Bisimulations
by: Kori, Mayuko, et al.
Published: (2024)

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

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

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)

Anti-Context-Free languages
by: Cardó, Carles
Published: (2024)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
by: Dorochko, Leonid, et al.
Published: (2026)

Computing Distinguishing Formulae for Threshold-Based Behavioural Distances
by: Forster, Jonas, et al.
Published: (2026)

A classification of bisimilarities for general Markov decision processes
by: Moroni, Martín Santiago, et al.
Published: (2024)

The complexity of bisimilarity on pointmass processes
by: Moroni, Martín Santiago, et al.
Published: (2026)

Solutions of Word Equations over Partially Commutative Structures
by: Diekert, Volker, et al.
Published: (2016)

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

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
by: Cojocaru, Liliana
Published: (2015)

Optimal Simultaneous Byzantine Agreement, Common Knowledge and Limited Information Exchange
by: van der Meyden, Ron
Published: (2025)

Rewriting Systems on Arbitrary Monoids
by: Magalhães, Eduardo
Published: (2026)

Automating proof search when equality is a logical connective
by: Chaudhuri, Kaustuv, et al.
Published: (2026)

A Classifying Topos for the Spectrum of Equivalences
by: Oggad, Kenan
Published: (2026)