1830 search results - page 159 / 366 » Workshop on Graph Computation Models |
136
Voted
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
199
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
156
click to vote
PARLE
1987
15 years 8 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
147
Voted
GG
2008
Springer
15 years 6 months ago
2008
Springer
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...
152
click to vote
ICMT
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Pattern-based model-to-model transformation is a new approach for specifying transformations in a declarative, relational and formal style. The language relies on pattern...