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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3060140 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2663462053 / rank | |||
Normal rank | |||
Revision as of 21:27, 19 March 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
