@article{BUSTAN20041,
Abstract = {In this paper we compare four notions of fair simulation: direct [9], delay [12], game [19], and exists [16]. Our comparison refers to three main aspects: The time complexity of constructing the fair simulation, the ability to use it for minimization, and the relationship between the fair simulations and universal branching-time logics. We developed a practical application that is based on this comparison. The application is a new implementation for the assume-guarantee modular framework presented By Grumberg at al. in [ACM Transactions on Programming Languages and Systems (TOPLAS), 16 (1994) 843]. The new implementation significantly improves the complexity of the framework.},
Author = {Bustan, Doron and Grumberg, Orna},
File = {Applicability of fair simulation - Bustan, Grumberg (1) (0) - a - a - r.pdf},
ISSN = {0890-5401},
Journal = {Information and Computation},
Keywords = {Assume-guarantee},
Number = {1},
Pages = {1 - 18},
Title = {Applicability of fair simulation},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540104001087},
Volume = {194},
Year = {2004},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0890540104001087},
bdsk-url-2 = {http://dx.doi.org/10.1016/j.ic.2004.02.005},
date-added = {2016-11-17 08:07:43 +0000},
date-modified = {2016-11-17 08:07:43 +0000},
file-2 = {Applicability of fair simulation - Bustan, Grumberg (0) (0) - a - a - r.pdf},
doi = {10.1016/j.ic.2004.02.005}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A