Localized fairness: A rewriting semantics

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 250-263

  Meseguer, José ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; INFORMATION THEORY; PARAMETER ESTIMATION; SET THEORY; TECHNICAL WRITING;

LOCALIZATION; REWRITING SEMANTICS; THEORY TRANSFORMATION;

SEMANTICS;

EID: 24944559770     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_19     Document Type: Conference Paper

References (21)

1. G. Agha. Actors. MIT Press, 1986.
2. R. Bruni and J. Meseguer. Generalized rewrite theories. In J. Baeten, J. Lenstra, J. Parrow, and G. Woeginger, editors, Proceedings of ICALP 2003, 30th International Colloquium on Automata, Languages and Programming, volume 2719 of Springer LNCS, pages 252-266, 2003.
3. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2001.
4. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. Maude 2.0 Manual. June 2003, http://maude.cs.uiuc. edu.
5. S. Eker, J. Meseguer, and A. Sridharanarayanan. The Maude LTL model checker. In F. Gadducci and U. Montanari, editors, Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2002.
6. N. Francez. Fairness. Springer-Verlag, 1986.
7. V. Gyuris and A. Sistla. On-the-fly model-checking under fairness that exploits symmetry. Formal Methods in System Design. To appear.
8. L. Lamport. A temporal logic of actions. ACM Trans. on Prog. Lang. and Systems, 16(3):872-923, 1994.
9. T. Latvala and K. Heljanko. Coping with strong fairness. Fundamenta Informaticae, 34:1-19, 2000.
10. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems - Specification. Springer-Verlag, 1992.
11. N. Martí-Oliet and J. Meseguer. Rewriting logic: roadmap and bibliography. Theoretical Computer Science, 285:121-154, 2002.
12. J. Meseguer. Localized fairness. Manuscript, UIUC, February 2005, http: //maude.cs.uiuc.edu.
13. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.
14. J. Meseguer. A logical theory of concurrent objects and its realization in the Maude language. In G. Agha, P. Wegner, and A. Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming, pages 314-390. MIT Press, 1993.
15. J. Meseguer. Membership algebra as a logical framework for equational specification. In F. Parisi-Presicce, editor, Proc. WADT'97, pages 18-61. Springer LNCS 1376, 1998.
16. J. Misra. A Discipline of Multiprogramming. Springer-Verlag, 2001.
17. A. Pnueli and Y. Kesten. Algorithmic and deductive verification methods for CTL*. In M. Broy and M. Pizka, editors, Models, Algebras, and Logic of Engineering Software, NATO Advanced Study Institute, Marktoberdorf, Germany, July 30 - August 11, 2002, pages 109-131. IOS Press, 2003.
18. S. Porat and N. Francez. Fairness in term rewriting systems. In Proc. Intl. Conf. on Rewriting Techniques and Applications (RTA 1985), pages 287-300. Springer LNCS 202, 1985.
19. S. Porat and N. Francez. Full communication and fair termination in equational (and combined) term-rewriting systems. In Proc. 8th Intl. Conf. on Automated Deduction (CADE-8), pages 21-41. Springer LNCS 230, 1986.
20. S. Tison. Fair termination is decidable for ground systems. In N. Dershowitz, editor, Rewriting Techniques and Applications, Chappel Hill, North Carolina, pages 462-476. Springer LNCS 355, 1989.
21. P. Viry. Equational rules for rewriting logic. Theoretical Computer Science, 285:487-517, 2002.