Sciweavers

220 search results - page 27 / 44
» On Nets, Algebras and Modularity
Sort
View
ADAEUROPE
2001
Springer
14 years 7 days ago
Testing from Formal Specifications, a Generic Approach
Deriving test cases from specifications is now recognised as a major application of formal methods to software development. Several methods have been proposed for various formalism...
Marie-Claude Gaudel
ICA3PP
2010
Springer
14 years 16 days ago
Modular Resultant Algorithm for Graphics Processors
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
Pavel Emeliyanenko
ICALP
2010
Springer
14 years 16 days ago
Compositionality in Graph Transformation
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
Arend Rensink
ECEASST
2006
103views more  ECEASST 2006»
13 years 7 months ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco
IJAR
2011
86views more  IJAR 2011»
12 years 11 months ago
On open questions in the geometric approach to structural learning Bayesian nets
The basic idea of an algebraic approach to learning Bayesian network (BN) structures is to represent every BN structure by a certain uniquely determined vector, called the standar...
Milan Studený, Jirí Vomlel