Sciweavers

391 search results - page 26 / 79
» Compositionality for Probabilistic Automata
Sort
View
ESOP
2007
Springer
14 years 2 months ago
Probabilistic Anonymity Via Coalgebraic Simulations
There is a growing concern on anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, importance of probabilis...
Ichiro Hasuo, Yoshinobu Kawabe
ENTCS
2010
99views more  ENTCS 2010»
13 years 8 months ago
Describing Secure Interfaces with Interface Automata
Interface automata are a model that allows for the representation of stateful interfaces. In this paper we introduce a variant of interface automata, which we call interface struc...
Matias Lee, Pedro R. D'Argenio
FASE
2011
Springer
13 years 3 days ago
Automated Learning of Probabilistic Assumptions for Compositional Reasoning
Probabilistic verification techniques have been applied to the formal modelling and analysis of a wide range of systems, from communication protocols such as Bluetooth, to nanosca...
Lu Feng, Marta Z. Kwiatkowska, David Parker
ICALP
2010
Springer
14 years 1 months ago
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor W...
SEW
2006
IEEE
14 years 2 months ago
Integrating Probability with Time and Shared-Variable Concurrency
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P....