546 Hits in 5.8 sec

Quantitative analysis of probabilistic lossy channel systems

Alexander Rabinovich
2006 Information and Computation  
Recently, several attempts have been made to study probabilistic lossy channel systems (PLCS) in which the probability of losing messages is taken into account and the following qualitative model checking  ...  To capture the behaviour of such protocols, lossy channel systems (LCS) have been proposed.  ...  We thank Parosh Abdulla, Daniéle Beauquier, Philippe Schnoebelen, and Anatol Slissenko for fruitful discussions and their useful comments.  ... 
doi:10.1016/j.ic.2005.11.004 fatcat:3ucu6odz3jbjfap24w5qem2ese

Verification of probabilistic systems with faulty communication

P.A. Abdulla, N. Bertrand, A. Rabinovich, Ph. Schnoebelen
2005 Information and Computation  
Recently, several attempts have been made to study Probabilistic Lossy Channel Systems (PLCS's) in which the probability of losing messages is taken into account.  ...  To capture the behavior of such protocols, Lossy Channel Systems (LCS's) have been proposed.  ...  Probabilistic lossy channel systems A probabilistic lossy channel system (PLCS) L is of the form (S, C, M, T, , w), where (S, C, M, T) is an LCS, ∈ (0, 1), and w is a mapping from T to the positive natural  ... 
doi:10.1016/j.ic.2005.05.008 fatcat:kwwsxk3cdzcu7byso6ivylofj4

Preface to the special issue on Probabilistic Model Checking

Christel Baier, Marta Kwiatkowska
2013 Formal methods in system design  
properties for Markov chains and Markov decision processes.  ...  Probabilistic model checking aims to achieve automated analysis of probabilistic models against specifications given in temporal logic, and involves an intricate combination of conventional model checking  ...  This work has applications to the verification of probabilistic lossy channel systems.  ... 
doi:10.1007/s10703-013-0194-4 fatcat:neeu3chulzhtthtdlvatjawmxy

Quantitative analysis of distributed randomized protocols

Christel Baier, Frank Ciesinski, Marcus Groesser
2005 Proceedings of the 10th international workshop on Formal methods for industrial critical systems - FMICS '05  
, parallelism, a probabilistic choice operator and lossy channels.  ...  While traditional model checking techniques for non-probabilistic systems aim to establish properties stating that all (or some) computations fulfill a certain condition, the verification problem for randomized  ...  Thus, verifying probabilistic systems against quantitative properties is even harder than the purely qualitative verification problem for non-probabilistic system.  ... 
doi:10.1145/1081180.1081182 fatcat:d422wyoapncotpdnuzlgstdu2m

Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
2007 ACM Transactions on Computational Logic  
Lossy channel systems (LCSs) are systems of finite state automata that communicate via unreliable unbounded fifo channels.  ...  While all variants of the qualitative LTL model checking problem for the full class of history-dependent schedulers are undecidable, the same questions for finite-memory scheduler can be solved algorithmically  ...  from interpretations of probabilistic lossy channel systems by Markov chains.  ... 
doi:10.1145/1297658.1297663 fatcat:e3gju5ehc5fb7axb2jfbjse35m

Formal analysis techniques for gossiping protocols

Rena Bakhshi, Francois Bonnet, Wan Fokkink, Boudewijn Haverkort
2007 ACM SIGOPS Operating Systems Review  
We present properties of interest for gossiping protocols and discuss how various formal evaluation techniques can be employed to predict them.  ...  We give a survey of formal verification techniques that can be used to corroborate existing experimental results for gossiping protocols in a rigorous manner.  ...  Schnoebelen [67] surveyed several proposals for modelling probabilistic lossy channel systems with Markov chains and the verification techniques they support.  ... 
doi:10.1145/1317379.1317385 fatcat:ppg5garcsrbr3b7ugdijxvs3mu

Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness [chapter]

C. Baier, N. Bertrand, Ph. Schnoebelen
2006 Lecture Notes in Computer Science  
NPLCS's are a new model for nondeterministic channel systems where unreliable communication is modeled by probabilistic message losses.  ...  We show that, for ω-regular linear-time properties and finite-memory schedulers, qualitative model-checking is decidable.  ...  For eventually properties with the satisfaction criteria "with positive probability", decidability relies on the computation of iterative predecessors in (non-probabilistic) lossy channel systems: For  ... 
doi:10.1007/11888116_17 fatcat:q3cnl2ejnfe4rbdpltbpyw4due

Computable fixpoints in well-structured symbolic model checking

N. Bertrand, P. Schnoebelen
2012 Formal methods in system design  
This has immediate applications for the verification of wellstructured systems, where a main issue is the computability of fixpoint expressions, and in particular for game-theoretical properties and probabilistic  ...  systems where nesting and alternation of least and greatest fixpoints are common.  ...  Probabilistic lossy channel systems Our general finite convergence theorem has applications to qualitative probabilistic modelchecking problems for well-structured transition systems.  ... 
doi:10.1007/s10703-012-0168-y fatcat:4tbjrq4btnhfjnty6agtszkosu

A note on the attractor-property of infinite-state Markov chains

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
2006 Information Processing Letters  
As an application, we obtain a direct proof that some probabilistic channel systems combining message losses with duplication and insertion errors have a finite attractor.  ...  In this paper, we establish a sufficient criterion for the existence of an attractor.  ...  aspects: probabilistic pushdown systems and probabilistic lossy channel systems.  ... 
doi:10.1016/j.ipl.2005.09.011 fatcat:bsq43f7h6vclncnzcwdenl6btu

Model Checking Linear-Time Properties of Probabilistic Systems [chapter]

Christel Baier, Marcus Größer, Frank Ciesinski
2009 Monographs in Theoretical Computer Science  
In randomized algorithms, cointossing is used as an explicit probabilistic algorithmic concept.  ...  In this chapter, Markov decision processes are used as an operational model for "probabilistic systems".  ... 
doi:10.1007/978-3-642-01492-5_13 fatcat:n3qjkl2ojreypn7sxc4e7zfvs4

When are Stochastic Transition Systems Tameable? [article]

Nathalie Bertrand and Patricia Bouyer and Thomas Brihaye and Pierre Carlier
2018 arXiv   pre-print
We next provide algorithms for qualitative model-checking, and generic approximation procedures for quantitative model-checking.  ...  We further design a generic construction which will be useful for the analysis of ω-regular properties, when a finite attractor exists, either in the system (if it is denumerable), or in a sound denumerable  ...  Probabilistic lossy channel systems.  ... 
arXiv:1703.04806v2 fatcat:f6dtadcml5he3dl3orhage77kq

Epidemic algorithms for reliable content-based publish-subscribe: an evaluation

P. Costa, M. Migliavacca, G.P. Picco, G. Cugola
2004 24th International Conference on Distributed Computing Systems, 2004. Proceedings.  
In this paper, we evaluate the effectiveness of an approach based on epidemic algorithms.  ...  Nevertheless, currently available systems usually do not provide reliability guarantees, which hampers their use in dynamic and unreliable scenarios, notably including mobile ones.  ...  Independently from the scheme adopted, the probabilistic and decentralized nature of epidemic algorithms yields a number of desirable properties.  ... 
doi:10.1109/icdcs.2004.1281622 dblp:conf/icdcs/CostaMPC04 fatcat:2kpki67dynfs7i2mbgij44lhky

Taming denumerable Markov decision processes with decisiveness [article]

Nathalie Bertrand and Patricia Bouyer and Thomas Brihaye and Paulin Fournier
2020 arXiv   pre-print
simple qualitative and approximate quantitative model checking algorithms to exist.  ...  Decisiveness has proven to be an elegant concept for denumerable Markov chains: it is general enough to encompass several natural classes of denumerable Markov chains, and is a sufficient condition for  ...  We first establish an undecidability result for the supremum probability of MDPs given as non-deterministic and probabilistic lossy channel system (NPLCS).  ... 
arXiv:2008.10426v1 fatcat:6adhqfurabhafe4f5ptndjd5ni

Impact FD: An Unreliable Failure Detector Based on Process Relevance and Confidence in the System

Anubis Graciela de Moraes Rossetto, Cláudio F R Geyer, Luciana Arantes, Pierre Sens
2018 Computer journal  
Communication Channels/Links The behavior of the communication channels is an important issue in the definition of a distributed system model.  ...  for these sites when compared to an AS system.  ...  Appendix 1 Impact FD on an Anonymous System Considering that processes are anonymous (i.e., non identifiable) and both the membership and the cardinality of the system are unknown, the timer-based Algorithm  ... 
doi:10.1093/comjnl/bxy041 fatcat:nkusonkfdrhkzp3k7if22ihsmq

Information processing in living systems [article]

Gašper Tkačik, William Bialek
2014 arXiv   pre-print
Many of these analyses are motivated by the idea that biological systems may have evolved to optimize the gathering and representation of information, and we review the experimental evidence for this optimization  ...  Systems of interest range from single molecules (the sequence diversity in families of proteins) to groups of organisms (the distribution of velocities in flocks of birds), and all scales in between.  ...  Acknowledgments We thank our many collaborators and colleagues, whose names appear in the references, for teaching us so much and for making the exploration of these ideas so pleasurable.  ... 
arXiv:1412.8752v1 fatcat:barmp4co7nfapknqlal3rrpwfy
« Previous Showing results 1 — 15 out of 546 results