Strong bisimilarity of simple process algebras: Complexity lower bounds
type: Item
instance of: scholarly article
title: Strong bisimilarity of simple process algebras: Complexity lower bounds
zbMATH Open document ID: 1060.68081
author: Jiří Srba
published in: Acta Informatica
publication date: 2004-03-11T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 2055231
zbMATH Keywords: process rewrite systems
MaRDI profile type: Publication
full work available at URL: s00236-003-0116-9
OpenAlex ID: W1842478026
DOI: 10.1007/S00236-003-0116-9
Recommended article: Q4737202
Recommended article: Q4941915
Recommended article: Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
Recommended article: Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
Recommended article: On the complexity of bisimilarity for value-passing processes
Recommended article: Q2754155
Recommended article: Computable processes and bisimulation equivalence
Recommended article: Q3028334
Recommended article: A complexity analysis of bisimilarity for value-passing processes
description: scientific article; zbMATH DE number 2055231