(Enter summary)
Abstract: . For every hierarchical system of equations S over some complete
and distributive lattice we construct an equivalent system with the
same set of variables which additionally is guarded. The price to be paid is
that the resulting right-hand sides may grow exponentially. We therefore
present methods how the exponential blow-up can be avoided. Especially,
the loop structure of the variable dependence graph is taken into account.
Also we prove that size O(m \Delta jSj) suffices whenever S... (Update)
Cited by: More
Counting in Trees for Free - Seidl, Schwentick, Muscholl.. (2004)
(Correct)
Active bibliography (related documents): More All
1.0: Using Automata to Characterise Fixed Point Temporal Logics - Kaivola (1996)
(Correct)
0.5: Modal Logics and Mu-Calculi: An Introduction - Bradfield, Stirling (2001)
(Correct)
0.2: Formal Verification of Processes - Schöpp (2001)
(Correct)
Similar documents based on text: More All
0.5: On Distributive Fixpoint Expressions - Seidl, Niwinski (1998)
(Correct)
0.2: Fast and Simple Nested Fixpoints - Seidl (1996)
(Correct)
0.1: Shape-based Retrieval of Complementary 3D Surfaces from a Protein.. - Seidl (1995)
(Correct)
BibTeX entry: (Update)
Helmut Seidl and Andreas Neumann. On Guarding Nested Fixpoints. In Ann. Conf. of the European Association of Logic in Computer Science (CSL), pages 484--498. LNCS 1683, 1999. http://citeseer.ist.psu.edu/seidl99guarding.html More
@inproceedings{ seidl99guarding,
author = "Helmut Seidl and Andreas Neumann",
title = "On Guarding Nested Fixpoints",
booktitle = "{CSL}",
pages = "484-498",
year = "1999",
url = "citeseer.ist.psu.edu/seidl99guarding.html" }
Citations (may not include all citations):
225
Flow Analysis of Computer Programs (context) - Hecht - 1977
190
Results on the Propositional -Calculus (context) - Kozen - 1983
93
Global Data Flow Analysis and Iterative Algorithms (context) - Kam, Ullman - 1976
32
Finding Dominators in Directed Graphs (context) - Tarjan - 1974
26
Efficient Chaotic Iteration Strategies with Widenings
- Bourdoncle - 1993
18
Verification of Modal Properties Using Boolean Equation Syst.. (context) - Mader - 1997
17
A Compositional Proof System for the Modal Mu-Calculus (context) - Andersen, Stirling et al. - 1994
12
A Faster Solver for General Systems of Equations
- Fecht, Seidl - 1999
12
Definable Operations in General Algebras (context) - Bekic - 1967
10
Fixed Point Characterization of Infinite Behavior of Finite ..
- Niwinski - 1997
8
Theoretical Computer Science (context) - Niwinski, Walukiewicz et al. - 1996
7
Basic Notions of Universal Algebra for Language Theory and G.. (context) - Courcelle - 1996
6
Metric Interpretations of Infinite Trees and Semantics of No.. (context) - Arnold, Nivat - 1980
5
Notes on the Propositional -Calculus: Completeness and Relat.. (context) - Walukiewicz - 1995
2
A Simple Decision Method for the Linear Time Mu-Calculus
- Kaivola - 1995
2
Fixpoints for Rabin Tree Automata Make Complementation Easy (context) - Kaivola - 1996
2
Using Automata to Characterise Fixpoint Temporal Logics (context) - Kaivola - 1996
1
On Distributive Fixpoint Expressions
- Seidl, Niwinski - 1998
1
Short version in 18th Int (context) - Neumann, Seidl et al. - 1998
1
of Computer and System Sciences (context) - Fong, Ullman et al. - 1977
Documents on the same site (http://www.informatik.uni-trier.de/~neumann/papers-e.html):
Parsing and Querying XML Documents in SML - Neumann (1999)
(Correct)
fxp - Processing Structured Documents in SML - Neumann
(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