Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

FSTTCS
2005
Springer

favoriteEmaildiscussreport

106views Software Engineering» more FSTTCS 2005»

Fixpoint Logics on Hierarchical Structures

13 years 10 months ago

Fixpoint Logics on Hierarchical Structures

Download www.informatik.uni-bremen.de

Hierarchical graph deﬁnitions allow a modular description of graphs using modules for the speciﬁcation of repeated substructures. Beside this modularity, hierarchical graph deﬁnitions allow to specify graphs of exponential size using polynomial size descriptions. In many cases, this succinctness increases the computational complexity of decision problems. In this paper, the modelchecking problem for the modal µ-calculus and (monadic) least ﬁxpoint logic on hierarchically deﬁned graphs is investigated. In order to analyze the modal µ-calculus, parity games on hierarchically deﬁned graphs are studied.

Stefan Göller, Markus Lohrey

Real-time Traffic

Exponential Size | FSTTCS 2005 | Hierarchical Graph Deﬁnitions | Polynomial Size Descriptions |

claim paper

Related Content

» Fixpoint Logics over Hierarchical Structures

» A Solver for Modal Fixpoint Logics

» The Complexity of IndependenceFriendly Fixpoint Logic

» A fixpoint calculus for local and global program flows

» The Alternating Fixpoint of Logic Programs with Negation

» ModelChecking Games for Fixpoint Logics with Partial Order Models

» Monadic secondorder logic on treelike structures

» ModelChecking Hierarchical Structures

» Modal Expressiveness of Graph Properties

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	FSTTCS
Authors	Stefan Göller, Markus Lohrey

Comments (0)