Sciweavers

294 search results - page 35 / 59
» diagrams 2006
Sort
View
FMSD
2000
86views more  FMSD 2000»
13 years 9 months ago
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
We review a number of formal verification techniques supported by STeP, the Stanford Temporal Prover, describing how the tool can be used to verify properties of several versions o...
Nikolaj Bjørner, Anca Browne, Michael Col&o...
IJWGS
2006
125views more  IJWGS 2006»
13 years 9 months ago
Compiling business processes: untangling unstructured loops in irreducible flow graphs
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
Wei Zhao, Rainer Hauser, Kamal Bhattacharya, Barre...
AIM
2006
13 years 11 months ago
Increasing the benefit of analysis: The case of systems that support communication
: Researchers in academia and practitioners in the field are concluding that object orientation (OO) supports well the stages of technical design and programming but not the stages...
Dov Te'eni, Roy Gelbard, Matti Sade
IJAR
2006
89views more  IJAR 2006»
13 years 9 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
MST
2006
120views more  MST 2006»
13 years 9 months ago
Exploiting Regularities for Boolean Function Synthesis
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...