A complexity analysis of bisimilarity for value-passing processes
type: Item
instance of: scholarly article
title: A complexity analysis of bisimilarity for value-passing processes
zbMATH Open document ID: 0944.68135
DOI: 10.1016/S0304-3975(98)00177-7
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1493202
zbMATH Keywords: process algebras
zbMATH Keywords: value-passing
zbMATH Keywords: bisimulation
zbMATH Keywords: computational complexity
author: Michele Boreale
author: Luca Trevisan
MaRDI profile type: Publication
cites work: Q4293543
cites work: Alternation
cites work: The complexity of theorem-proving procedures
cites work: On the Computational Complexity of Algorithms
cites work: Proof systems for message-passing process algebras
cites work: Symbolic bisimulations
cites work: Deciding bisimulation equivalences for a class of non-finite-state programs
cites work: CCS expressions, finite state processes, and three problems of equivalence
cites work: A calculus of communicating systems
cites work: Q3992568
cites work: A calculus of mobile processes. II
cites work: Three Partition Refinement Algorithms
cites work: Q3221403
cites work: Algebraic theories for name-passing calculi
cites work: A theory of bisimulation for the \(\pi\)-calculus
cites work: Q4131648
Recommended article: On the complexity of bisimilarity for value-passing processes
Recommended article: Q4222870
Recommended article: Q2754155
Recommended article: The complexity of bisimilarity-checking for one-counter processes.
Recommended article: Complexity of Checking Bisimilarity between Sequential and Parallel Processes
Recommended article: Computable processes and bisimulation equivalence
Recommended article: Strong bisimilarity of simple process algebras: Complexity lower bounds
Recommended article: Bisimulation for higher-order process calculi
Recommended article: A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
Recommended article: On the computational complexity of bisimulation, redux
description: scientific article; zbMATH DE number 1493202