Sciweavers

2006 search results - page 79 / 402
» Testing with Respect to Concerns
Sort
View
JLP
2007
91views more  JLP 2007»
13 years 8 months ago
Non-bisimulation-based Markovian behavioral equivalences
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is th...
Marco Bernardo
SFM
2007
Springer
107views Formal Methods» more  SFM 2007»
14 years 3 months ago
A Survey of Markovian Behavioral Equivalences
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches ...
Marco Bernardo
ICDAR
1999
IEEE
14 years 1 months ago
On the Evaluation of Document Analysis Components by Recall, Precision, and Accuracy
In document analysis, it is common to prove the usefulness of a component by an experimental evaluation. By applying the respective algorithms to a test sample, some effectiveness...
Markus Junker, Andreas Dengel, Rainer Hoch
AGP
1998
IEEE
14 years 1 months ago
Narrowing the Gap between Set-Constraints and CLP(SET)-Constraints
We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint ...
Agostino Dovier, Carla Piazza, Gianfranco Rossi
DLOG
2006
13 years 10 months ago
PSPACE Automata for Description Logics
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
Jan Hladik, Rafael Peñaloza