Cover Image

Place Bisimilarity is Decidable, Indeed!

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Gorrieri, Roberto
Format:	Preprint
Published:	2021
Subjects:	Logic in Computer Science 68Q85 F.1.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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)

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

$Δ$-Nets: Interaction-Based System for Optimal Parallel $λ$-Reduction
by: Salvadori, Daniel Augusto Rizzi
Published: (2025)

Probabilistic Nets-within-Nets
by: Köhler-Bußmeier, Michael
Published: (2024)

On Equivalent Characterizations of NP in Abstract Models of Computation
by: Kirn, Jeremy C., et al.
Published: (2025)

A "Symbolic" Representation of Object-Nets (Extended Version)
by: Köhler-Bussmeier, Michael, et al.
Published: (2024)

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

Commutative N-polyregular functions
by: Lopez, Aliaume
Published: (2024)

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

Conformance Games for Graded Semantics
by: Forster, Jonas, et al.
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)

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

Dependence and Independence for Reversible Process Calculi
by: Aubert, Clément, et al.
Published: (2024)

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

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
by: Böhnlein, Toni, et al.
Published: (2024)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

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

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
by: Schewe, Klaus-Dieter
Published: (2020)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
by: Adsul, Bharat, et al.
Published: (2024)

Stochastic well-structured transition systems
by: Aspnes, James
Published: (2025)

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

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

Bishop's (up)crossing inequality and lower semicomputable random reals revisited
by: Andreev, Mikhail, et al.
Published: (2025)

Algebra of Self-Replication
by: Moss, Lawrence S.
Published: (2023)

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

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

Extended Nullstellensatz proof systems
by: Krajicek, Jan
Published: (2023)

Provability in BI's Sequent Calculus is Decidable
by: Gheorghiu, Alexander, et al.
Published: (2021)

Relational Connectors and Heterogeneous Bisimulations
by: Nora, Pedro, et al.
Published: (2024)

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

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

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)

Relative Constructibility via Generalised Sequential Algorithms
by: Lau, Desmond
Published: (2024)

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