T.A. Henzinger, J.-F. Raskin, and P.-Y. Schobbens Electrical Engineering...  Home/Search
Context
Related
| berkeley.edu/techrepor...CSD991074.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: berkeley.edu/access...CSD991074 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A specification formalism for reactive systems defines a class of !-languages. We call a specification formalism fully decidable if it is constructively closed under boolean operations and has a decidable satisfiability (nonemptiness) problem. There are two important, robust classes of !-languages that are definable by fully decidable formalisms. The !-regular languages are definable by finite automata, or equivalently, by the Sequential Calculus. The counter-free !-regular languages are... (Update)
Similar documents (at the sentence level):
7.9%: The Regular Real-Time Languages - Henzinger, Raskin, Schobbens (1998) (Correct)
Active bibliography (related documents): More All
0.2: It's About Time: Real-time Logics Reviewed - Henzinger (1998) (Correct)
0.2: Real-time Logics: Complexity and Expressiveness - Alur, Henzinger (1990) (Correct)
0.1: Dynamic Linear Time Temporal Logic - Henriksen, Thiagarajan (1997) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ and-temporal,
author = "Henzinger Raskin And",
title = "Temporal Logics, Automata, and Classical Theories for Defining Real-Time
Languages",
url = "citeseer.ist.psu.edu/736260.html" }
Citations (may not include all citations):666 Theoretical Computer Science (context) - Alur, Dill et al. - 1990
177 Temporal logic can be more expressive (context) - Wolper - 1983
176 a decision method in restricted second-order arithmetic (context) - Buchi - 1962
172 A really temporal logic - Alur, Henzinger - 1994
163 the temporal analysis of fairness (context) - Gabbay, Pnueli et al. - 1980
147 Real-time logics: complexity and expressiveness - Alur, Henzinger - 1993
147 Real-time logics: complexity and expressiveness - Alur, Henzinger - 1990
140 Tense Logic and the Theory of Linear Order (context) - Kamp - 1968
116 Synthesis of Communicating Processes from Temporal-Logic Spe.. (context) - Wolper - 1982
88 The benefits of relaxing punctuality - Alur, Feder et al. - 1991
88 The benefits of relaxing punctuality - Alur, Feder et al. - 1996
81 The complementation problem for Buchi automata with applicat.. (context) - Sistla, Vardi et al. - 1985
71 A really abstract concurrent model and its temporal logic (context) - Barringer, Kuiper et al. - 1986
71 Reasoning about infinite computation paths (context) - Wolper, Vardi et al. - 1983
57 Specifying timed state sequences in powerful decidable logic.. - Wilke - 1994
40 A determinizable class of timed automata (context) - Alur, Fix et al. - 1994
35 Back to the future: towards a theory of timed regular langua.. - Alur, Henzinger - 1992
27 State clock logic: a decidable real-time logic - Raskin, Schobbens - 1997
10 Theoretical Issues in the Design and Verification of Distrib.. (context) - Sistla - 1983
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