Sciweavers

1117 search results - page 14 / 224
» Equivalent Representations of Set Functions
Sort
View
APAL
2008
104views more  APAL 2008»
13 years 7 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
APAL
2006
118views more  APAL 2006»
13 years 7 months ago
Final coalgebras and the Hennessy-Milner property
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas that has the Hennessy-Milner property of distinguishing co...
Robert Goldblatt
FPL
2006
Springer
223views Hardware» more  FPL 2006»
13 years 11 months ago
From Equation to VHDL: Using Rewriting Logic for Automated Function Generation
This paper presents a novel tool flow combining rewriting logic with hardware synthesis. It enables the automated generation of synthesizable VHDL code from mathematical equations...
Carlos Morra, M. Sackmann, Sunil Shukla, Jürg...
IJAR
2002
109views more  IJAR 2002»
13 years 7 months ago
Belief function independence: I. The marginal case
In this paper, we study the notion of marginal independence between two sets of variables when uncertainty is expressed by belief functions as understood in the context of the tra...
Boutheina Ben Yaghlane, Philippe Smets, Khaled Mel...
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
14 years 25 days ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag