Name
Abstract | ||
|---|---|---|
This paper describes a decision procedure for bisimulation-based equivalence relations betweenlabeled transition systems. The algorithm usually performed in order to verify bisimulationconsists in refining some initial equivalence relation until it becomes compatible with thetransition relation under consideration. However, this method requires to store the transitionrelation explicitly, which limits it to medium-sized labeled transition systems.The algorithm proposed here does not... |
Year | Venue | Keywords |
|---|---|---|
1990 | FORTE | verifying bisimulations,equivalence relation |
Field | DocType | ISBN |
Computer science,On the fly,Algorithm,Theoretical computer science,Computer engineering | Conference | 0-444-89024-6 |
Citations | PageRank | References |
24 | 1.85 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-Claude Fernandez | 1 | 395 | 29.17 |
| Laurent Mounier | 2 | 1187 | 79.54 |