Algorithmic Analysis of Lossy Channel Machines Using Small Models
Verification of infinite-state systems is in general an undecidable problem, but nevertheless, solid correctness results are important in many real-life applications. It is commonly the case that such algorithms rely on unbounded buffers for their operation, communication protocols being a typical e...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Uppsala universitet, Institutionen för informationsteknologi
2016
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-301502 |