See this document in CiteSeerX!

Treewidth in Verification: Local vs. Global  (Make Corrections)  
Andrea Ferrara, Guoqiang Pan, Moshe Y. Vardi



  Home/Search   Context   Related

 
View or download:
rice.edu/~vardi/papers...lpar052.pdf.gz


From:  rice.edu/~vardi/papers/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper concurrent transition systems, where communication between concurrent components is modeled explicitly. Assuming boundedness of the treewidth of the communication graph, which we refer to as local treewidth, is reasonable, since the topology of communication in concurrent systems is often constrained physically (Update)

Active bibliography (related documents):   More   All
0.5:   Conjunctive Query Evaluation by Search Tree - Revisited - Atserias   (Correct)
0.5:   Algorithmic Aspects of Herbrand Models Represented by Ground .. - Gramlich, Pichler (2002)   (Correct)
0.5:   Computing Small Search Numbers in Linear Time - Bodlaender, Hans (1998)   (Correct)

Similar documents based on text:   More   All
0.2:   Automata-Theoretic Approach to Planning for Temporally.. - De Giacomo, Vardi (1999)   (Correct)
0.2:   View-based Query Processing and Constraint Satisfaction - Calvanese, De Giacomo.. (2000)   (Correct)
0.2:   Rewriting of Regular Path Queries - Calvanese, De Giacomo, Lenzerini..   (Correct)

BibTeX entry:   (Update)

@misc{ ferrara-treewidth,
  author = "Andrea Ferrara and Guoqiang Pan and Moshe Y. Vardi",
  title = "Treewidth in Verification: Local vs. Global",
  url = "citeseer.ist.psu.edu/734457.html" }
Citations (may not include all citations):
1726   Graph-based algorithms for boolean-function manipulation - Bryant - 1986
828   Model Checking - Clarke, Grumberg et al. - 2000  ACM   DBLP
603   Kluwer Academic Publishers (context) - McMillan, Checking - 1993
267   Network-based heuristics for constraint-satisfaction problem.. (context) - Dechter, Pearl - 1987  ACM   DBLP
173   the complexity of VLSI implementations and graph representat.. - Bryant - 1991
143   algorithmic aspects of treewidth (context) - Robertson, Seymour et al. - 1986
127   arboretum of graphs with bounded treewidth (context) - Bodlaender, k- - 1998
108   Symbolic model checking using SAT procedures instead of BDDs - Biere, Cimatti et al. - 1999  ACM   DBLP
106   An algebraic definition of simulation between programs (context) - Milner - 1971  ACM   DBLP
97   A tourist guide through treewidth - Bodlaender - 1993  DBLP
86   An automata-theoretic approach to branchingtime model checki.. - Kupferman, Vardi et al. - 2000
82   Treewidth: Algorithmic techniques and results - Bodlaender - 1997
53   Sometimes and not never revisited: On the branching versus l.. (context) - Emerson, Halpern - 1986
39   Methodology and system for practical formal verification of .. - Beer, Ben-David et al. - 1994  ACM   DBLP
32   tree structured constraint satisfaction problems (context) - Freuder, k- - 1990
17   Clarendon Press (context) - Prior, Present - 1967
13   the complexity of verifying concurrent transition systems - Harel, Kupferman et al. - 2002
9   Why is ATPG easy (context) - Prasad, Chong et al. - 1999
8   Journal of Combinatorial Theory Series B (context) - Robertson, Seymour et al. - 1983
8   Number 173 in Graduate Texts in Mathematics (context) - Diestel - 2000
4   Using cutwidth to improve symbolic simulation and boolean sa.. - Wang, Clarke et al. - 2001
3   Fast mu-calculus model checking when tree-width is bounded - Obdrzalek - 2003  DBLP
2   Hypergraphs in model checking: Acyclicity and hypertree-widt.. (context) - Gottlob, Pichler - 2004  DBLP
2   A polynomial time algorithm for the cutwidth of bounded degr.. - Thilikos, Serna et al. - 2001  ACM   DBLP
2   Constraint propagation as a proof system - Atserias, Kolaitis et al. - 2004
1   Guiding sat diagnosis with tree decompositions - Bjesse, Kukula et al. - 2004  DBLP
1   Using DPLL for efficient OBDD construction (context) - Huang, Darwiche - 2004
1   Deciding the winner in partity games is in UP # co-UP (context) - Jurdzinski - 1998
1   A note on CSP graph parameters - Schiex - 1999

Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html):   More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994)   (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994)   (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (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