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

DOI10.1007/978-3-540-68746-7_15zbMath1143.68453OpenAlexW1597492784MaRDI QIDQ3510867

Jonathan Billington, Guy Edward Gallasch

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

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• Parametric Language Analysis of the Class of Stop-and-Wait Protocols
• An algorithmic technique for protocol verification
• Automated Technology for Verification and Analysis
• Lectures on Concurrency and Petri Nets
• Model Checking Software

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