Model Checking Lossy Channels Systems Is Probably Decidable.

Abstract : Lossy channel systems (LCS's) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these systems, where losses of messages are seen as faults occurring with some given probability, and where the internal behavior of the system remains nondeterministic, giving rise to a reactive Markov chains semantics. We then investigate the verification of linear-time properties on this new model.
Type de document :
Communication dans un congrès
6th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'03), Apr 2003, Warsaw, Poland. Springer, 2620, pp.120-135, 2003, LNCS
Liste complète des métadonnées

https://hal.inria.fr/inria-00424339
Contributeur : Nathalie Bertrand <>
Soumis le : jeudi 15 octobre 2009 - 11:09:06
Dernière modification le : jeudi 11 janvier 2018 - 06:20:13

Identifiants

  • HAL Id : inria-00424339, version 1

Collections

Citation

Nathalie Bertrand, Philippe Schnoebelen. Model Checking Lossy Channels Systems Is Probably Decidable.. 6th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'03), Apr 2003, Warsaw, Poland. Springer, 2620, pp.120-135, 2003, LNCS. 〈inria-00424339〉

Partager

Métriques

Consultations de la notice

61