A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (Q4715674): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q59556998, #quickstatements; #temporary_batch_1711574657256 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59556998 / rank | |||
Normal rank | |||
Revision as of 01:50, 28 March 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
