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 |
|---|---|
| Title of host publication | Proceedings of the 11th International Conference on Quality Software (QSIC 2011), 13-14 July 2011, Madrid, Spain |
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 244-251 |
| DOIs | |
| Publication status | Published - 2011 |
Fingerprint
Dive into the research topics of 'Saving time in a space-efficient simulation algorithm'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver