Abstract
We present an efficient algorithm for computing the simulation preorder and equivalence
for labeled transition systems. The algorithm improves an existing space-efficient algorithm
and improves its time complexity by employing a variant of the stability condition
and exploiting properties of the underlying relations and partitions. It has comparable
space and time complexity with the most efficient counterpart algorithms for Kripke
structures.
| Original language | English |
|---|---|
| Place of Publication | Eindhoven |
| Publisher | Technische Universiteit Eindhoven |
| Number of pages | 19 |
| Publication status | Published - 2011 |
Publication series
| Name | SE report |
|---|---|
| Volume | 2011-03 |
| ISSN (Print) | 1872-1567 |