A topological characterization of weakness Export

@inproceedings{citeulike:3208196, abstract = {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.}, address = {New York, NY, USA}, author = {Eisner, Cindy and Fisman, Dana and Havlicek, John}, booktitle = {PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing}, citeulike-article-id = {3208196}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1073814.1073816}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1073814.1073816}, doi = {10.1145/1073814.1073816}, isbn = {1-59593-994-2}, keywords = {temporal-logic}, location = {Las Vegas, NV, USA}, pages = {1--8}, posted-at = {2008-09-09 08:04:03}, priority = {0}, publisher = {ACM}, title = {A topological characterization of weakness}, url = {http://dx.doi.org/10.1145/1073814.1073816}, year = {2005} }

TY - CONF ID - citeulike:3208196 L3 - citeulike-article-id:3208196 N2 - 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. CY - Las Vegas, NV, USA SN - 1-59593-994-2 AD - New York, NY, USA EP - 8 TI - A topological characterization of weakness PB - ACM T2 - PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing SP - 1 KW - temporal-logic AU - Eisner, Cindy AU - Fisman, Dana AU - Havlicek, John PY - 2005/// UR - http://dx.doi.org/10.1145/1073814.1073816 ER -