A topological characterization of weakness

Cindy Eisner, Dana Fisman, John Havlicek

Research output: Contribution to conferencePaperpeer-review

18 Scopus citations


We are interested in the relation between weak and strong temporal operators. We would like to find a characterization that shows what it means for an operator to be the weak or strong version of another operator, or more generally for a formula to be a weak or strong version of another formula. We show that the weak version of a formula is not the same as Alpern and Schneider's safety component. By working over an extended alphabet, we show that their topological characterization of safety can be adapted to obtain a topological characterization of weakness. We study the resulting topology and the relations between weak and strong formulas. Finally, we apply the method to show the internal consistency of a logic containing both weak and strong versions of regular expressions.

Original languageEnglish
Number of pages8
StatePublished - 1 Dec 2005
Externally publishedYes
Event24th Annual ACM Symposium on Principles of Distributed Computing, PODC 2005 - Las Vegas, NV, United States
Duration: 17 Jul 200520 Jul 2005


Conference24th Annual ACM Symposium on Principles of Distributed Computing, PODC 2005
Country/TerritoryUnited States
CityLas Vegas, NV


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

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'A topological characterization of weakness'. Together they form a unique fingerprint.

Cite this