An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CADP / rank | |||
Normal rank | |||
Revision as of 20:18, 28 February 2024
scientific article; zbMATH DE number 6744625
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation |
scientific article; zbMATH DE number 6744625 |
Statements
An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (English)
0 references
13 July 2017
0 references
branching bisimulation
0 references
algorithm
0 references
stuttering equivalence
0 references
