Essential transitions to bisimulation equivalences
type: Item
instance of: scholarly article
title: Essential transitions to bisimulation equivalences
zbMATH Open document ID: 0901.68140
DOI: 10.1016/S0304-3975(96)00281-2
author: Jaana Eloranta
author: Martti Tienari
author: Antti Valmari
published in: Theoretical Computer Science
publication date: 1998-07-22T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1178214
zbMATH Keywords: labelled transition system
describes a project that uses: LOTOS
MaRDI profile type: Publication
cites work: Branching bisimilarity is an equivalence indeed!
cites work: Algebra of communicating processes with abstraction
cites work: Q3792231
cites work: Minimal state graph generation
cites work: A Theory of Communicating Sequential Processes
cites work: Minimizing the number of transitions with respect to observation equivalence
cites work: An implementation of an efficient algorithm for bisimulation equivalence
cites work: Q4038723
cites work: Q3992568
cites work: Q3907077
cites work: Q4874391
cites work: Bisimulation and divergence
description: scientific article; zbMATH DE number 1178214