A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (Q4715674): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0960129500000992 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2137502532 / rank | |||
Normal rank | |||
Latest revision as of 08:49, 30 July 2024
scientific article; zbMATH DE number 946746
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes |
scientific article; zbMATH DE number 946746 |
Statements
A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (English)
0 references
18 November 1996
0 references
basic parallel processes
0 references
polynomial-time algorithm
0 references
bisimulation
0 references
