Results 1 
1 of
1
Hypergraphs and degrees of parallelism: A completeness result, in: I. Walukiewicz (Ed
 Proceedings of the 7th International Conference of Foundations of Software Science and Computation Structures – FOSSACS 2004
, 2004
"... Abstract. In order to study relative PCFdenability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [2, 4]). We introduce the notion of timed hypergraph morphism and show that it is: { Sound: if there exists a timed morphism from Hf to Hg then f is PCFde nab ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In order to study relative PCFdenability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [2, 4]). We introduce the notion of timed hypergraph morphism and show that it is: { Sound: if there exists a timed morphism from Hf to Hg then f is PCFde nable relatively to g. { Complete for subsequential functions: if f is PCFdenable relatively to g, and g is subsequential, then there exists a timed morphism from Hf to Hg. 1