Sciweavers

4341 search results - page 12 / 869
» Quantitative Model checking
Sort
View
147
Voted
QEST
2007
IEEE
15 years 8 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin
143
Voted
CAV
2012
Springer
251views Hardware» more  CAV 2012»
13 years 4 months ago
A Model Checker for Hierarchical Probabilistic Real-Time Systems
Real-life systems are usually hard to control, due to their complicated structures, quantitative time factors and even stochastic behaviors. In this work, we present a model checke...
Songzheng Song, Jun Sun 0001, Yang Liu 0003, Jin S...
141
Voted
PERCOM
2004
ACM
16 years 1 months ago
Ontology Based Context Modeling and Reasoning using OWL
In this paper we propose an OWL encoded context ontology (CONON) for modeling context in pervasive computing environments, and for supporting logicbased context reasoning. CONON p...
Xiaohang Wang, Daqing Zhang, Tao Gu, Hung Keng Pun...
133
Voted
ENTCS
2006
134views more  ENTCS 2006»
15 years 2 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
129
Voted
ESORICS
2010
Springer
15 years 3 months ago
On Bounding Problems of Quantitative Information Flow
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
Hirotoshi Yasuoka, Tachio Terauchi