Sciweavers

1830 search results - page 87 / 366
» Workshop on Graph Computation Models
Sort
View
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
15 years 6 months ago
Implication of assertion graphs in GSTE
- We address the problem of implication of assertion graphs that occur in generalized symbolic trajectory evaluation (GSTE). GSTE has demonstrated its powerful capacity in formal v...
Guowu Yang, Jin Yang, William N. N. Hung, Xiaoyu S...
ENTCS
2008
72views more  ENTCS 2008»
15 years 4 months ago
Towards a Notion of Transaction in Graph Rewriting
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
Paolo Baldan, Andrea Corradini, Fernando Luí...
BIRD
2008
Springer
158views Bioinformatics» more  BIRD 2008»
15 years 6 months ago
A Computational Method for Reconstructing Gapless Metabolic Networks
Abstract. We propose a computational method for reconstructing metabolic networks. The method utilizes optimization techniques and graph traversal algorithms to discover a set of b...
Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko ...
ICOIN
2007
Springer
15 years 10 months ago
Inter-Domain Access Volume Model: Ranking Autonomous Systems
Exploring topological structure at Autonomous System (AS) level is indispensable for understanding most issues in Internet services. Previous models of AS graph involve address or ...
Yixuan Wang, Ye Wang, Maoke Chen, Xing Li
LICS
2009
IEEE
15 years 11 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...