FAST verification of the class of stop-and-wait protocols modelled by coloured Petri nets

zbMATH Open1087.68012MaRDI QIDQ3369934FDOQ3369934

Authors Jonathan Billington, Guy Edward Gallasch, Laure Petrucci

Publication date 6 February 2006

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Recommendations

• Lectures on Concurrency and Petri Nets
• Parametric Language Analysis of the Class of Stop-and-Wait Protocols
• Automated Technology for Verification and Analysis
• Model Checking Software
• Parametric model-checking of stopwatch Petri nets

Cited in

(5)

• Automated Technology for Verification and Analysis
• Performance analysis and functional verification of the stop-and-wait protocol in HOL
• Model Checking Software
• Lectures on Concurrency and Petri Nets
• Parametric Language Analysis of the Class of Stop-and-Wait Protocols

This page was built for publication: FAST verification of the class of stop-and-wait protocols modelled by coloured Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3369934)