Hans Hüttel  Home/Search
Context
Related
| cs.auc.dk/~hans/Publi...snsmodchar.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: cs.auc.dk/~hans/Publicatio...pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that a modal mu-calculus with label set f1; : : : ; ng can define the Rabin recognizable tree languages up to an equivalence similar to the observational equivalence of Milner. 1 Introduction In [11] it was shown that the temporal logic ETL [10] can define exactly the class of !-regular languages. In [7] it was shown that a fixed-point calculus whose signature apart from maximal and minimal fixed points and disjunction includes the usual operators on trees can define exactly the sets... (Update)
Similar documents (at the sentence level):
10.9%: Decidability, Behavioural Equivalences and Infinite Transition.. - Hüttel (1991) (Correct)
Active bibliography (related documents): More All
0.5: Definability with Bounded Number of Bound Variables - Immerman, Kozen (1989) (Correct)
0.1: Using Automata to Characterise Fixed Point Temporal Logics - Kaivola (1996) (Correct)
0.1: Automated Temporal Reasoning about Reactive Systems - Emerson (1996) (Correct)
Similar documents based on text: More All
0.4: Higher-Order Pushdown Trees Are Easy - Knapik, Niwinski, Urzyczyn (2003) (Correct)
0.3: Active Watermarking of Data and Information in Wireless Ad-Hoc.. - Koushanfar (2002) (Correct)
0.2: Structural Decidable Extensions of Bounded Quantification - Vorobyov (1994) (Correct)
BibTeX entry: (Update)
@misc{ ttel-that,
author = "Hans Hüttel",
title = "That SnS Can Be Modally Characterized",
url = "citeseer.ist.psu.edu/231316.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
241 Decidability of Second-order Theories and Automata on Infini.. (context) - Rabin - 1969
177 Temporal Logic Can Be More Expressive (context) - Wolper - 1983
71 reasoning About Infinite Computation Paths (context) - Wolper, Vardi et al.
63 The Temporal Logic of Branching Time (context) - Ben-Ari, Manna et al. - 1983
40 Results On The Propositional ¯-Calculus (context) - Kozen - 1983
28 Computation Tree Logic CTL and Path Quantifiers In The Monad.. (context) - Hafer, Thomas
14 The Propositional Mu-calculus Is Elementary (context) - Street, Emerson
12 Characterizing Kripke Structures In Temporal Logic (context) - Browne, Clarke et al. - 1987
9 Fixed Points vs (context) - Niwinski - 1988
2 Preservation of Expressive Completeness in Temporal Models (context) - Amir, Gabbay - 1987
Documents on the same site (http://www.cs.auc.dk/~hans/Publications/pubs.html): More
Undecidable Equivalences for Basic Parallel Processes - Hüttel (1993) (Correct)
The Complexity of Deciding Behavioural Equivalences and Preorders - Hüttel, Shukla (Correct)
Relating Semantic Models for the Object Calculus - Aceto, Hüttel.. (1997) (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