Using Fairness to Make Abstractions Work-Reference-Cited by-同舟云学术

Using Fairness to Make Abstractions Work

Published:2004 Issue: Volume: Page:198-215
ISSN:0302-9743
Container-title:Model Checking Software
language:
Short-container-title:

Author:

Bošnački Dragan,Ioustinova Natalia,Sidorova Natalia

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24732-6_15

Reference25 articles.

1. Baukus, K., Lakhnech, Y., Stahl, K.: Verification of parameterized protocols. Journal of Universal Computer Science 7(2), 141–158 (2001)

2. Lecture Notes in Computer Science;D. Bošnački,1999

3. Bošnački, D., Dams, D.: Integrating real time into Spin: A prototype implementation. In: Proc. of Formal Description Techniques and Protocol Specification, Testing, and Verification, Kluwer Academic Publishers, Dordrecht (1998)

4. Lecture Notes in Computer Science;D. Bošnački,2000

5. Choueka, Y.: Theories of automata on ω-tapes: a simplified approach. Journal of Computer and System Science 8, 117–141 (1974)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Combining State Space Reductions with Global Fairness Assumptions;Lecture Notes in Computer Science;2011

2. A CTL-Based Logic for Program Abstractions;Logic, Language, Information and Computation;2010

3. Fair Model Checking with Process Counter Abstraction;FM 2009: Formal Methods;2009

4. Accelerated Modal Abstractions of Labelled Transition Systems;Algebraic Methodology and Software Technology;2006

5. On Some Galois Connection Based Abstractions for the Mu-Calculus;FM 2005: Formal Methods;2005