Augustin Baziramwabo, Pierre McKenzie, Denis Thérien  Home/Search
Context
Related
| iro.umontreal.ca/~mckenzi...bamcth99.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iro.umontreal.ca/~...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Th'erien and Wilke characterized the Until hierarchy of linear temporal logic in terms of aperiodic monoids. Here, a temporal operator able to count modulo q is introduced. Temporal logic augmented with such operators is found decidable as it is shown to express precisely the solvable regular languages. Natural hierarchies are shown to arise when modular and conventional operators are interleaved. Modular operators are then cast as special cases of more general "group" temporal operators which, ... (Update)
Similar documents (at the sentence level):
62.6%: Modular Temporal Logic - Baziramwabo, McKenzie, Thérien (1998) (Correct)
Active bibliography (related documents): More All
0.4: Temporal Logic and Semidirect Products: An Effective.. - Therien, Wilke (1996) (Correct)
0.2: Syntactic Semigroups - Pin (1997) (Correct)
0.2: Over Words, Two Variables Are as Powerful as One.. - Thérien, Wilke (Correct)
Similar documents based on text: More All
0.4: On the Expressive Power of Temporal Logic - Joelle Cohen Dominique (1993) (Correct)
0.4: Equation Satisfiability and Program Satisfiability .. - Barrington.. (2000) (Correct)
0.3: Nesting Until and Since in Linear Temporal Logic - Thérien, Wilke (Correct)
BibTeX entry: (Update)
@inproceedings{ baziramwabo99modular,
author = "Augustin Baziramwabo and Pierre McKenzie and Denis Therien",
title = "Modular Temporal Logic",
booktitle = "Logic in Computer Science",
pages = "344-351",
year = "1999",
url = "citeseer.ist.psu.edu/356153.html" }
Citations (may not include all citations):140 Tense Logic and the Theory of Linear Order (context) - Kamp - 1968
127 Counter-free Automata (context) - McNaughton, Papert - 1971
55 Classifying regular events in symbolic logic (context) - Thomas - 1982 DBLP
44 Finite semigroups and universal algebra (context) - Almeida - 1995
43 On Finite Monoids Having Only Trivial Subgroups (context) - Schutzenberger - 1965 DBLP
32 First order predicate logic with generalized quantifiers (context) - Lindstrom - 1966
29 An until hierarchy for temporal logic - Etessami, Wilke ACM DBLP
22 the expressive power of temporal logic - Cohen, Pin et al. - 1993
19 Regular languages defined with generalized quantifiers (context) - Straubing, Th'erien et al. - 1988 ACM DBLP
18 The dot-depth hierarchy of star-free languages is infinite (context) - Brzozowski, Knast - 1978 DBLP
18 On uniformity within NC 1 (context) - Barrington, Immerman et al. - 1990
15 Temporal logic and semidirect products: An effective charact.. - Th'erien, Wilke - 1996 ACM DBLP
15 Formal Logic and Circuit Complexity (context) - Straubing, Automata - 1994
15 Temporal logic and semidirect products: An effective charact.. - Th'erien, Wilke ACM DBLP
5 The algebraic theory of machines (context) - Krohn, Rhodes - 1965
Documents on the same site (http://www.iro.umontreal.ca/~mckenzie/publications.html): More
Reversible Space Equals Deterministic Space (Extended.. - Lange, McKenzie, Tapp (Correct)
Tree Isomorphism and Some Other Complete Problems for.. - Jenner, Lange, McKenzie (1997) (Correct)
Nondeterministic NC¹ computation - Caussinus, McKenzie, Thérien.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC