Using Parametric Automata for the Verification of the Stop-and-Wait Class of Protocols-Reference-Cited by-同舟云学术

Using Parametric Automata for the Verification of the Stop-and-Wait Class of Protocols

Published:2005 Issue: Volume: Page:457-473
ISSN:0302-9743
Container-title:Automated Technology for Verification and Analysis
language:
Short-container-title:

Author:

Gallasch Guy Edward,Billington Jonathan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11562948_34.pdf

Reference27 articles.

1. Aziz Abdulla, P., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using Forward Reachability Analysis for Verification of Lossy Channel Systems. Formal Methods in System Design 25(1), 39–65 (2004)

2. Lecture Notes in Computer Science;S. Bardin,2004

3. Barrett, W.A., Couch, J.D.: Compiler Construction: Theory and Practice. Science Research Associates (1979)

4. Billington, J.: Formal specification of protocols: Protocol Engineering. In: Encyclopedia of Microcomputers, vol. 7, pp. 299–314. Marcel Dekker, New York (1991)

5. Lecture Notes in Computer Science,1999

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Applications of Coloured Petri Nets for Functional Validation of Protocol Designs;Transactions on Petri Nets and Other Models of Concurrency VII;2013

2. Parametric Language Analysis of the Class of Stop-and-Wait Protocols;Applications and Theory of Petri Nets;2008

3. Analysis of the Datagram Congestion Control Protocol’s connection management procedures using the sweep-line method;International Journal on Software Tools for Technology Transfer;2007-09-04

4. A Parametric State Space for the Analysis of the Infinite Class of Stop-and-Wait Protocols;Model Checking Software;2006