A topological characterization of weakness

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 24, Issue , 2005, Pages 1-8

  Eisner, Cindy ^a   Fisman, Dana ^a   Havlicek, John ^b  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b FREESCALE SEMICONDUCTOR INC   (United States)

Author keywords

Liveness; Safety; Safety component; Semantically weak and strong formulas; Syntactically weak and strong formulas; Temporal weakness and strength; Weak and strong components

Indexed keywords

CHARACTERIZATION; TOPOLOGY;

SAFETY COMPONENT; TOPOLOGICAL CHARACTERIZATION; WEAK AND STRONG COMPONENTS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 32344431981     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073814.1073816     Document Type: Conference Paper

References (19)

1. B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21:181-185, 1985.
2. B. Alpern and F. B. Schneider. Recognizing safety and liveness. Distributed Computing, 2(3):117-126, 1987.
3. R. Armoni, D. Bustan, O. Kupferman, and M. Y. Vardi. Aborts vs resets in linear temporal logic. In Proc. 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2003.
4. R. Armoni, L. Fix, A. Flaisher, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, E. Singerman, A. Tiemeyer, M. Y. Vardi, and Y. Zbar. The ForSpec temporal logic: A new temporal property-specification language. In Proc. 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, LNCS 2280, pages 296-211. Springer, 2002.
5. D. Bustan, D. Fisman, and J. Havlicek. Automata construction for PSL. Technical Report MCS05-04, The Weizmann Institute of Science, May 2005.
6. C. Eisner, D. Fisman, J. Havlicek, Y. Lustig, A. McIsaac, and D. Van Campenhout. Reasoning with temporal logic on truncated paths. In The 15th International Conference on Computer Aided Verification (CAV), LNCS 2725, pages 27-40. Springer-Verlag, July 2003.
7. D. Harel and R. Sherman. Looping vs. repeating in dynamic logic. Information and Control 55, pages 175-192, 1982.
8. J. Havlicek, D. Fisman, and C. Eisner. Basic results on the semantics of Accellera PSL 1.1 foundation language. Technical Report 2004.02, Accellera, May 2004.
9. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
10. J. Kelley. General Topology. Van Nostrand Reinhold, 1955. Springer, 1975.
11. th International Conference on Computer Aided Verification (CAV), LNCS 1633, pages 172-183. Springer-Verlag, 1999.
12. P. Maier. Intuitionistic LTL and a new characterization of safety and liveness. In J. Marcinkowski and A. Tarlecki, editors, Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL; Karpacz, Poland, September 20-24, 2004; Proceedings, volume 3210 of Lecture Notes in Computer Science, pages 295-309. Springer, 2004,
13. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1992.
14. P. Manolios and R. Trefler. A lattice-theoretic characterization of safety and liveness. In PODC '03: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, pages 325-333. ACM Press, 2003.
15. A. Pnueli. A temporal logic of concurrent programs. Theoretical Computer Science, 13:45-60, 1981.
16. M. Rem. A personal perspective of Alpern-Schneider characterization of safety and liveness. In W. H. J. Feijen, editor, Beauty is our business: a birthday salute to Edsger W. Dijkstra, pages 365-372. Springer-Verlag, 1990.
17. A. P. Sistla. Safety, liveness and fairness in temporal logic. Formal Asp. Comput., 6(5):495-512, 1994.
18. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 15 1994.
19. P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1/2):72-99, 1983.