410 search results - page 30 / 82 » Symbolic Representations and Analysis of Large Probabilistic... |
FMCO
2005
Springer
15 years 5 months ago
2005
Springer
babilistic Chemical Abstract Machine and the Expressiveness of Linda Languages Alessandra Di Pierro1 , Chris Hankin2 , and Herbert Wiklicky2 1 Dipartimento di Informatica, Universi...
128
click to vote
AIIA
1991
Springer
15 years 3 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
105
click to vote
FORMATS
2009
Springer
15 years 3 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
AUTOMATICA
2007
14 years 12 months ago
2007
This paper is devoted to the generic observability analysis for structured bilinear systems using a graph-theoretic approach. On the basis of a digraph representation, we express ...
HPDC
2002
IEEE
15 years 4 months ago
2002
IEEE
We describe a decentralized, adaptive mechanism for replica location in wide-area distributed systems. Unlike traditional, hierarchical (e.g, DNS) and more recent (e.g., CAN, Chor...