A topological characterization of weakness

DOI10.1145/1073814.1073816zbMath1314.68182OpenAlexW1971281350MaRDI QIDQ5177218

Cindy Eisner, John W. Havlicek, Dana Fisman

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073814.1073816

zbMATH Keywords

livenesssafetysafety componentsemantically weak and strong formulassyntactically weak and strong formulastemporal weakness and strengthweak and strong components

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items (5)

Functional Specification of Hardware via Temporal Logic ⋮ Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations ⋮ From Philosophical to Industrial Logics ⋮ From Monadic Logic to PSL ⋮ Making Metric Temporal Logic Rational

This page was built for publication: A topological characterization of weakness