Imagen de Portada

A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jansen, David N., Groote, Jan Friso, Keiren, Jeroen J. A., Wijs, Anton
Formato:	Preprint
Publicado:	2019
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Tutorial: Designing Distributed Software in mCRL2
por: Groote, Jan Friso, et al.
Publicado: (2021)

Fair Mutual Exclusion for N Processes (extended version)
por: Hafidi, Yousra, et al.
Publicado: (2021)

A formal specification of the desired software behaviour of the Princess Marijke lock complex
por: Groote, Jan Friso, et al.
Publicado: (2025)

A Quadratic Lower Bound for Simulation
por: Groote, Jan Friso, et al.
Publicado: (2024)

Benchmarks for Parity Games (extended version)
por: Keiren, Jeroen J. A.
Publicado: (2014)

Formal Modelling and Analysis of Slot Machines
por: Groote, Jan Friso, et al.
Publicado: (2024)

Lowerbounds for Bisimulation by Partition Refinement
por: Groote, Jan Friso, et al.
Publicado: (2022)

A Complete Formal Specification and Verification of the BESW software control system of the Maeslant Storm Surge Barrier
por: Beers, Adrian, et al.
Publicado: (2025)

Expressiveness Results for Timed Modal Mu-Calculi
por: Cleaveland, Rance, et al.
Publicado: (2023)

A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice
por: van Glabbeek, Rob, et al.
Publicado: (2025)

An Evaluation of Massively Parallel Algorithms for DFA Minimization
por: Martens, Jan, et al.
Publicado: (2024)

Deductive Verification of Weak Memory Programs with View-based Protocols (extended version)
por: Şakar, Ömer, et al.
Publicado: (2026)

Improved Static Analysis of Parameterised Boolean Equation Systems using Control Flow Reconstruction
por: Keiren, Jeroen J. A., et al.
Publicado: (2013)

Stuttering Equivalence for Parity Games
por: Cranen, Sjoerd, et al.
Publicado: (2011)

Structural Analysis of Boolean Equation Systems
por: Keiren, Jeroen, et al.
Publicado: (2010)

Deadlock in packet switching networks
por: Stramaglia, Anna, et al.
Publicado: (2021)

Efficient Evidence Generation for Modal $μ$-Calculus Model Checking (extended version)
por: Stramaglia, Anna, et al.
Publicado: (2025)

Formally Modelling the Rijkswaterstaat Tunnel Control Systems in a Constrained Industrial Environment
por: Jilissen, Kevin H. J., et al.
Publicado: (2024)

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

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

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

Intuitionistic modal logics: new and simpler decidability proofs for FIK and LIK
por: Balbiani, Philippe, et al.
Publicado: (2025)

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

HaliVer: Deductive Verification and Scheduling Languages Join Forces
por: Haak, Lars B. van den, et al.
Publicado: (2024)

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

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
por: Oda, Yukihiro
Publicado: (2025)

Proof complexity of positive branching programs
por: Das, Anupam, et al.
Publicado: (2021)

Deciding branching hyperproperties for real time systems
por: Deka, Nabarun, et al.
Publicado: (2024)

Nested Sequents for Quasi-transitive Modal Logics
por: Marin, Sonia, et al.
Publicado: (2024)

Deciding characteristic formulae: A journey in the branching-time spectrum
por: Aceto, Luca, et al.
Publicado: (2025)

Simulating dynamic systems using Linear Time Calculus theories
por: Bogaerts, Bart, et al.
Publicado: (2014)

Topologically valued transition structures
por: Collinson, Matthew
Publicado: (2026)

The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum
por: Aceto, Luca, et al.
Publicado: (2024)

A unified rule format for bounded nondeterminism in SOS with terms as labels
por: Aceto, Luca, et al.
Publicado: (2024)

Base-extension Semantics for Intuitionistic Modal Logics
por: Buzoku, Yll, et al.
Publicado: (2025)

Base-extension Semantics for Modal Logic
por: Eckhardt, Timo, et al.
Publicado: (2024)

An order out of nowhere: a new algorithm for infinite-domain CSPs
por: Mottet, Antoine, et al.
Publicado: (2023)

Incompleteness for stably computable formal systems
por: Savelyev, Yasha
Publicado: (2022)

Modelling of logical systems by means of their fragments
por: Rybakov, Mikhail
Publicado: (2025)

Completeness of Relational Algebra via Cylindric Algebra
por: Laštovička, Jan
Publicado: (2026)