A personal perspective of Alphern-Schneider characterization of safety and liveness
Beauty is our business
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Reasoning about infinite computations
Information and Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A lattice-theoretic characterization of safety and liveness
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Resets vs. aborts in linear temporal logic
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
25 Years of Model Checking
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Augmenting a regular expression-based temporal logic with local variables
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
PSL for runtime verification: theory and practice
RV'07 Proceedings of the 7th international conference on Runtime verification
Pillars of computer science
HVC'05 Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing
| Hi-index | 0.00 |
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.