Sciweavers

1024 search results - page 24 / 205
» Compositional Methods for Probabilistic Systems
Sort
View
FOSSACS
2009
Springer
15 years 9 months ago
Bisimulation for Demonic Schedulers
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
Konstantinos Chatzikokolakis, Gethin Norman, David...
ICML
2005
IEEE
16 years 3 months ago
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
Shaojun Wang, Shaomin Wang, Russell Greiner, Dale ...
FMOODS
2007
15 years 3 months ago
A Probabilistic Formal Analysis Approach to Cross Layer Optimization in Distributed Embedded Systems
We present a novel approach, based on probabilistic formal methods, to developing cross-layer resource optimization policies for resource limited distributed systems. One objective...
Minyoung Kim, Mark-Oliver Stehr, Carolyn L. Talcot...
TSMC
2002
112views more  TSMC 2002»
15 years 2 months ago
An efficient algorithm for automatically generating multivariable fuzzy systems by Fourier series method
By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set...
Liang Chen, Naoyuki Tokuda
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
15 years 28 days ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers