Verifying programs with unreliable channels
1996 (engelsk)Inngår i: Information and Computation, ISSN 0890-5401, Vol. 127, nr 2, s. 91-101Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]
We consider the verification of a particular class of infinite-state systems, namely systems consisting of finite-state processes that communicate via unbounded lossy FIFO channels. This class is able to model, e.g., link protocols such as the Alternating
sted, utgiver, år, opplag, sider
1996. Vol. 127, nr 2, s. 91-101
Emneord [en]
FINITE STATE MACHINES; AUTOMATIC VERIFICATION; SYSTEMS
Identifikatorer
URN: urn:nbn:se:uu:diva-27234DOI: doi:10.1006/inco.1996.0053OAI: oai:DiVA.org:uu-27234DiVA, id: diva2:55128
Merknad
Addresses: Abdulla PA, UNIV UPPSALA, DEPT COMP SYST, POB 325, S-75105 UPPSALA, SWEDEN.
2007-02-172007-02-172011-01-15