A polynomial-time algorithm for deciding bisimilation equivalence of normed Basic Parallel Processes

Hirshfeld, Yoram; Jerrum, Mark; Moller, Faron

Simple search

Advanced search

Statistics

Change search

Cite ExportLink to record

Permanent link

https://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-21382

Direct link

https://ri.diva-portal.org/smash/record.jsf?pid=diva2:1041418

Cite

Citation style

apa
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

Hirshfeld, Yoram

Jerrum, Mark

Moller, Faron

RISE - Research Institutes of Sweden, ICT, SICS.

1994 (English)Report (Other academic)

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. , p. 11

Series

SICS Research Report, ISSN 0283-3638 ; R94:09

Keywords [en]

Process algebra, Formal languages, Analysis of algorithms

National Category

Computer and Information Sciences

Identifiers

URN: urn:nbn:se:ri:diva-21382OAI: oai:DiVA.org:ri-21382DiVA, id: diva2:1041418

Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2025-09-23Bibliographically approved

Open Access in DiVA

fulltext(1288 kB)

85 downloads

File information

File name FULLTEXT01.pdfFile size 1288 kBChecksum SHA-512

76f9f54d9fd393628a9d0e7b8dd96f7c3e5f369b2a7a5135e6a1fdd3a9831808c03d4d29e28dc09c6682e0681693e03c06e83e43610c65978fb11cea1f62f87d

Type fulltextMimetype application/pdf

By organisation

SICS

On the subject