Parametric Language Analysis of the Class of Stop-and-Wait Protocols

DOI10.1007/978-3-540-68746-7_15MaRDI QIDQ3510867zbMATH OpenOpenAlexFDO

Authors Guy Edward Gallasch, Jonathan Billington

Publication date 3 July 2008

Published in Applications and Theory of Petri Nets (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68746-7_15

Mathematics Subject Classification ID

Network protocols (68M12) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Automated Technology for Verification and Analysis
• Model Checking Software
• FAST verification of the class of stop-and-wait protocols modelled by coloured Petri nets
• Lectures on Concurrency and Petri Nets
• Parametric model-checking of stopwatch Petri nets

Cites work

• An algorithmic technique for protocol verification
• Automated Technology for Verification and Analysis
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• scientific article; zbMATH DE number 1049168 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• Lectures on Concurrency and Petri Nets
• Model Checking Software
• Parametric Language Analysis of the Class of Stop-and-Wait Protocols

Cited in

(5)

• FAST verification of the class of stop-and-wait protocols modelled by coloured Petri nets
• Parametric Language Analysis of the Class of Stop-and-Wait Protocols
• Automated Technology for Verification and Analysis
• Automated Technology for Verification and Analysis
• Model Checking Software

This page was built for publication: Parametric Language Analysis of the Class of Stop-and-Wait Protocols

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