Abstract
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols,lossy channel systems (LCS) [AJ96b ] have been proposed.In an LCS the communication channels are modelled as FIFO buffers which are unbounded,but also unreliable in the sense that they can nondeterministically lose messages.
Recently,several attempts [BE99,ABIJ00 ]have been made to study probabilistic Lossy Channel Systems (PLCS) in which the probability of losing messages is taken into account.In this paper,we consider a variant of PLCS which is more realistic than those studied in [BE99,ABIJ00 ]. More precisely,we assume that during each step in the execution of the system,each message may be lost with a certain prede fined probability. We show that for such systems the following model checking problem is decidable: to verify whether a given property de finable by finite state ω -automata holds with probability one.We also consider other types of faulty behavior,such as corruption and duplication of messages,and insertion of new messages,and show that the decidability results extend to these models.
Chapter PDF
Similar content being viewed by others
References
Parosh Aziz Abdulla, Christel Baier, Purushothaman Iyer,and Bengt Jonsson.Reasoning about probabilistic lossy channel systems.In C. Palamidessi, editor,Proc. CONCUR 2000, 11th Int. Conf. on Concurrency Theory volume 1877 of Lecture Notes in Computer Science 2000.
Parosh Aziz Abdulla and Bengt Jonsson.Undecidable verification problems for programs with unreliable channels.Information and Computation, 130(1):71–90,1996.
Parosh Aziz Abdulla and Bengt Jonsson.Verifying programs with unreliable channels.Information and Computation 127(2):91–101,1996.
C. Baier and B. Engelen.Establishing qualitative properties for probabilistic lossy channel systems.In Katoen,editor,ARTS’99, Formal Methods for Real-Time and Probabilistic Systems, 5th Int. AMAST Workshop volume 1601 of Lecture Notes in Computer Science pages 34–52.Springer Verlag, 1999.
G.V. Bochman.Finite state description of communicating protocols.Computer Networks 2:361–371,1978.
N. Bertrand and Ph. Schnoebelen.Model checking lossy channels systems is probably decidable.In Proc. FOSSACS03, Conf. on Foundations of Software Science and Computation Structures 2003.
D. Brand and P. Zafiropulo.On communicating finite-state machines.Journal of the ACM 2(5):323–342,April 1983.
Gérard Cécé, Alain Finkel,and S. Purushothaman Iyer.Unreliable channels are easier to verify than perfect channels.Information and Computation 124(1):20–31,10 January 1996.
G. Higman.Ordering by divisibility in abstract algebras.Proc. London Math. Soc.2:326–336,1952.
J.G. Kemeny, J.L. Snell,and A.W. Knapp.Denumerable Markov Chains D Van Nostad Co.,1966.
W. Thomas.Automata on infinite objects.In Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics pages 133–192,1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdulla, P.A., Rabinovich, A. (2003). Verification of Probabilistic Systems with Faulty Communication. In: Gordon, A.D. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2003. Lecture Notes in Computer Science, vol 2620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36576-1_3
Download citation
DOI: https://doi.org/10.1007/3-540-36576-1_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00897-2
Online ISBN: 978-3-540-36576-1
eBook Packages: Springer Book Archive