Filters








52 Hits in 6.4 sec

Invisible Safety of Distributed Protocols [chapter]

Ittai Balaban, Amir Pnueli, Lenore D. Zuck
2006 Lecture Notes in Computer Science  
We demonstrate our techniques on several distributed protocols, including a variant on Luby's Maximal Independent Set protocol, the Leader Election protocol used in the IEEE 1394 (Firewire) distributed  ...  The method of "Invisible Invariants" has been applied successfully to protocols that assume a "symmetric" underlying topology, be it cliques, stars, or rings.  ...  Acknowledgement: We would like to thank Shuvendu Lahiri, who brought the Leader Election protocol to our attention, and Yi Fang who pointed out that our existing small model theorem can be applied to adjacency  ... 
doi:10.1007/11787006_45 fatcat:dn6srvixnfcjxj6b5kyjt7rkdq

Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol

Marta Kwiatkowska, Gethin Norman, Jeremy Sproston
2003 Formal Aspects of Computing  
We present a formal verification of the protocol using probabilistic model checking. Rather than analyze the functional aspects of the protocol, by asking such questions as "will a leader be elected?"  ...  The interplay of real-time and probability is crucial to the correctness of the IEEE 1394 FireWire root contention protocol.  ...  Formal verification of the IEEE 1394 root contention protocol has been performed in a number of previous works.  ... 
doi:10.1007/s001650300007 fatcat:j44aupeidjbfdexwe3eaxlzrsm

The Leader Election Protocol of IEEE 1394 in Maude⋆ ⋆Research supported by CICYT project Desarrollo Formal de Sistemas Distribuidos (TIC97-0669-C03-01)

Alberto Verdejo, Isabel Pita, Narciso Martí-Oliet
2000 Electronical Notes in Theoretical Computer Science  
In this paper we consider two descriptions in Maude of the leader election protocol from the IEEE 1394 serial multimedia bus. Particularly, the time aspects of the protocol are studied.  ...  As a final step for proving the correctness of the protocol we give a formal proof showing that the desirable properties of the protocol are always fulfilled.  ...  Acknowledgement We are very grateful to Carron Shankland for discussions about the leader election protocol, and in particular its time aspects.  ... 
doi:10.1016/s1571-0661(05)80133-1 fatcat:qm5qbbpdz5gx3hbr42xtptrfke

Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM

Conrado Daws, Marta Kwiatkowska, Gethin Norman
2004 International Journal on Software Tools for Technology Transfer (STTT)  
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time model-checker Kronos and the probabilistic  ...  We apply this technique to compute the minimal probability of a leader being elected before a deadline, for different deadlines, and study how this minimal probability is influenced by using a biased coin  ...  Acknowledgments We would like to thank Sergio Yovine for providing us the libraries of Kronos, Dave Parker for improving the model-building algorithms of Prism and the referees for their useful suggestions  ... 
doi:10.1007/s10009-003-0118-5 fatcat:7ixrtccnevg3dgrgzndlitzzs4

Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM⋆ ⋆Supported in part by the EPSRC grant GR/N22960

Conrado Daws, Marta Kwiatkowska, Gethin Norman
2002 Electronical Notes in Theoretical Computer Science  
We apply this technique to compute the minimal probability of a leader being elected before a deadline, for different deadlines, and study the influence of using a biased coin on this minimal probability  ...  We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos and the probabilistic  ...  Acknowledgement We thank Sergio Yovine for making Kronos' libraries available to us.  ... 
doi:10.1016/s1571-0661(04)80406-7 fatcat:ogsjr7atqbatjerks6t5qfz74i

Proved development of the real-time properties of the IEEE 1394 Root Contention Protocol with the event-B method

Joris Rehm
2009 International Journal on Software Tools for Technology Transfer (STTT)  
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety.  ...  Verification is done by proof using the event B method and its prover, we also have a way to model-check models.  ...  Devices are able to configure themselves by the IEEE 1394 leader election protocol. This protocol takes the network as an acyclic graph and orients edges to obtain a spanning tree rooted by a leader.  ... 
doi:10.1007/s10009-009-0130-5 fatcat:cnqfhhvw3bgh5ohst4csebztye

Semi-formal Development of a Fault-Tolerant Leader Election Protocol in Erlang [chapter]

Thomas Arts, Koen Claessen, Hans Svensson
2005 Lecture Notes in Computer Science  
We have applied our method to a commonly used open-source fault-tolerant leader election algorithm, and discovered two serious bugs.  ...  We present a semi-formal analysis method for fault-tolerant distributed algorithms written in the distributed functional programming language Erlang.  ...  For example, the formal verification of the IEEE 1394 leader election protocol [14] has results of that verification cannot be directly applied to our leader election protocol, since different assumptions  ... 
doi:10.1007/978-3-540-31848-4_10 fatcat:3lqha4wy3vdl3gjgqzkj6y43pe

Specification and Verification of the Tree Identify Protocol of IEEE 1394 in Rewriting Logic

Alberto Verdejo, Isabel Pita, Narciso Mart�-Oliet
2003 Formal Aspects of Computing  
We present three descriptions, at different abstract levels, of the tree identify protocol from the IEEE 1394 serial multimedia bus standard.  ...  Then, we give a formal proof showing that the desirable properties of the protocol are always fulfilled by any network, provided that the network is connected and acyclic.  ...  We thank Carron Shankland for discussions about the tree identify protocol and its time aspects, and PeterÖlveczky for suggestions about how to introduce time in our specifications.  ... 
doi:10.1007/s001650300003 fatcat:ptzv6ovrzjhhjow5wyinfqwggi

Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic [chapter]

Danièle Beauquier, Tristan Crolard, Evguenia Prokofieva
2004 Lecture Notes in Computer Science  
The paper presents a verification of the IEEE Root Contention Protocol as an illustration of a new and innovative approach for the verification of real-time distributed systems.  ...  FOTL is undecidable, however the protocol we study is in a decidable class of practical interest.  ...  study of formal verification methods applied to the IEEE 1394 RCP.  ... 
doi:10.1007/978-3-540-24730-2_29 fatcat:i2m4udorezg7xf73mf7eedh7kq

An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols

Douglas Graham, Muffy Calder, Alice Miller
2009 Electronical Notes in Theoretical Computer Science  
We demonstrate our technique via a case study (a randomised leader election protocol) specified using the PRISM modelling language.  ...  We present a technique to tackle the parameterised probabilistic model checking problem for a particular class of randomised distributed systems, which we model as Markov Decision Processes.  ...  Acknowledgement Douglas Graham was supported by a University of Glasgow scholarship.  ... 
doi:10.1016/j.entcs.2009.08.007 fatcat:a2og4zspgzfa3mgv3zv5ob3pai

PRISM 2.0: a tool for probabilistic model checking

M. Kwiatkowska, G. Norman, D. Parker
2004 First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings.  
This paper gives a brief overview of version 2.0 of PRISM, a tool for the automatic formal verification of probabilistic systems, and some of the case studies to which it has already been applied.  ...  , Zeroconf, IEEE 802.3 CSMA/CD and IEEE 802.11 wireless LANs. • Verification of probabilistic security protocols for anonymity (Crowds protocol, synchronous batching), contract signing, fair exchange and  ...  PRISM code for many of them is also distributed with the tool itself. • Analysis of quality of service (QoS) properties of several real-time communication protocols, including IEEE 1394 FireWire root contention  ... 
doi:10.1109/qest.2004.1348048 dblp:conf/qest/KwiatkowskaNP04 fatcat:lmeds6kb2zbwvix4fh7j7tawwi

PRISM: A Tool for Automatic Verification of Probabilistic Systems [chapter]

Andrew Hinton, Marta Kwiatkowska, Gethin Norman, David Parker
2006 Lecture Notes in Computer Science  
PRISM is a probabilistic model checking tool which has already been successfully deployed in a wide range of application domains, from real-time communication protocols to biological signalling pathways  ...  Probabilistic model checking is an automatic formal verification technique for analysing quantitative properties of systems which exhibit stochastic behaviour.  ...  Examples include analysis of the performance, reliability or correctness of: -real-time communication protocols, including IEEE 1394 FireWire, Bluetooth, Zeroconf, IEEE 802.3 CSMA/CD and IEEE 802.11 wireless  ... 
doi:10.1007/11691372_29 fatcat:qksgy2exbnhnfao2vxq75l6j5q

Approximated Context-Sensitive Analysis for Parameterized Verification [chapter]

Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine
2009 Lecture Notes in Computer Science  
The aim of this paper is to extend these works by giving a simple and efficient method to prove safety properties for systems with treelike architectures.  ...  Compared to traditional methods for parameterized verification of systems with tree topologies, our method does not require the manipulation of tree transducers, hence its simplicity and efficiency.  ...  Based on the method, we have implemented a prototype which works well on several tree-based protocols such as the percolate, leader election, Tree-arbiter, and the IEEE 1394 Tree identity protocols.  ... 
doi:10.1007/978-3-642-02138-1_3 fatcat:jrrmnk2e3jh73houmjj2jcc53u

Parameterized Tree Systems [chapter]

Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, Frédéric Haziza, Ahmed Rezine
2008 Lecture Notes in Computer Science  
The aim of this paper is to extend these works by giving a simple and efficient method to prove safety properties for systems with treelike architectures.  ...  Compared to traditional methods for parameterized verification of systems with tree topologies, our method does not require the manipulation of tree transducers, hence its simplicity and efficiency.  ...  Based on the method, we have implemented a prototype which works well on several tree-based protocols such as the percolate, leader election, Tree-arbiter, and the IEEE 1394 Tree identity protocols.  ... 
doi:10.1007/978-3-540-68855-6_5 fatcat:ocnf573udvfdxgnyp37jp5evxe

Finite countermodels for safety verification of parameterized tree systems [article]

Alexei Lisitsa
2011 arXiv   pre-print
The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which further resolved by a generic finite model finding procedure.  ...  In this paper we deal with verification of safety properties of parameterized systems with a tree topology.  ...  Acknowledgments The author is grateful to anonymous referees of FMCAD 2011 conference who provided with many helpful comments on the previous version of this paper.  ... 
arXiv:1107.5142v1 fatcat:jluqdti7ojghzpsqvhtphjmul4
« Previous Showing results 1 — 15 out of 52 results