Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A polynomial-time algorithm for deciding bisimilation equivalence of normed Basic Parallel Processes
Number of Authors: 3
1994 (English)Report (Refereed)
Abstract [en]

A polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Parallel Processes: multisets of elementary processes combined by a commitative parallel-composition operator.

Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 1994, 1. , 11 p.
Series
SICS Research Report, ISSN 0283-3638 ; R94:09
Keyword [en]
Process algebra, Formal languages, Analysis of algorithms
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-21382OAI: oai:DiVA.org:ri-21382DiVA: diva2:1041418
Available from: 2016-10-31 Created: 2016-10-31Bibliographically approved

Open Access in DiVA

No full text

Other links

fulltext
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.27.0