Sciweavers

391 search results - page 11 / 79
» Compositionality for Probabilistic Automata
Sort
View
SCP
2010
126views more  SCP 2010»
13 years 7 months ago
Component simulation-based substitutivity managing QoS and composition issues
Several scientic bottlenecks have been identied in existing component-based approaches. em, we focus on the identication of a relevant abstraction for the component expression ...
Pierre-Cyrille Héam, Olga Kouchnarenko, J&e...
ICALP
2010
Springer
14 years 1 months ago
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
Hugo Gimbert, Youssouf Oualhadj
ICWS
2007
IEEE
13 years 10 months ago
Automated Choreographer Synthesis for Web Services Composition Using I/O Automata
We study the problem of synthesis of a choreogrpher in Web service composition for a given set of services and a goal. Services and goal are represented using i/o automata which c...
Saayan Mitra, Ratnesh Kumar, Samik Basu
ICTAI
2003
IEEE
14 years 1 months ago
Genetic Algorithm Calibration of Probabilistic Cellular Automata for Modeling Mining Permit Activity
We use a genetic algorithm to calibrate a spatially and temporally resolved cellular automata to model mining activity on public land in Idaho and western Montana. The genetic alg...
Sushil J. Louis, Gary L. Raines
ENTCS
2006
117views more  ENTCS 2006»
13 years 8 months ago
Probabilistic and Nondeterministic Aspects of Anonymity
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi