Decidability of branching bisimulation on normed commutative context-free processes (Q2254493)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6398301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decidability of branching bisimulation on normed commutative context-free processes |
scientific article; zbMATH DE number 6398301 |
Statements
Decidability of branching bisimulation on normed commutative context-free processes (English)
0 references
5 February 2015
0 references
branching bisimulation equivalence
0 references
commutative context-free graphs
0 references
equivalence checking
0 references
basic parallel processes
0 references
0 references
0.995855748653412
0 references
0.8865296244621277
0 references
0.8401707410812378
0 references
0.8401707410812378
0 references
0.8400170207023621
0 references
