An algebraic approach to temporal logic Export

@incollection{citeulike:2289328, abstract = {The sequential calculus is an algebraic calculus, intended for reasoning about phenomena with a duration and their sequencing. It can be specialized to various domains used for reasoning about programs and systems, including Tarski's calculus of binary relations, Kleene's regular expressions, Hoare's CSP and Dijkstra's regularity calculus.}, author = {von Karger, Burghard}, citeulike-article-id = {2289328}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-59293-8_198}, doi = {10.1007/3-540-59293-8_198}, journal = {TAPSOFT '95: Theory and Practice of Software Development}, keywords = {closure-structures, galois-connections, temporal-logic}, pages = {232--246}, posted-at = {2008-01-25 13:30:16}, priority = {2}, title = {An algebraic approach to temporal logic}, url = {http://dx.doi.org/10.1007/3-540-59293-8_198}, year = {1995} }

TY - CHAP ID - citeulike:2289328 L3 - citeulike-article-id:2289328 N2 - The sequential calculus is an algebraic calculus, intended for reasoning about phenomena with a duration and their sequencing. It can be specialized to various domains used for reasoning about programs and systems, including Tarski's calculus of binary relations, Kleene's regular expressions, Hoare's CSP and Dijkstra's regularity calculus. JF - TAPSOFT '95: Theory and Practice of Software Development EP - 246 TI - An algebraic approach to temporal logic SP - 232 KW - closure-structures KW - galois-connections KW - temporal-logic AU - von Karger, Burghard PY - 1995/// UR - http://dx.doi.org/10.1007/3-540-59293-8_198 ER -