Logotyp: till Uppsala universitets webbplats

uu.sePublikationer från Uppsala universitet
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Undecidable verification problems for programs with unreliable channels
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för datorteknik.
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för datorteknik.
1996 (Engelska)Ingår i: Automata, Languages and Programming: Proceedings of ICALP 94 / [ed] Serge Abiteboul, Eli Shamir, 1996, Vol. 130, nr 1, s. 71-90Konferensbidrag, Publicerat paper (Refereegranskat)
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 Bit Protocol and HDLC. In an earlier paper, we showed that several interesting verification problems are decidable for this class of systems, namely (1) the reachability problem: is a set of states reachable from some other state of the system, (2) safety property over traces formulated as regular sets of allowed finite traces, and (3) eventuality properties: do all computations of a system eventually reach a given set of states. In this paper, we show that the following problems are undecidable, namely

  • The model checking problem in propositional temporal logics such as Propositional Linear Time Logic (PTL) and Computation Tree Logic (CTL).

  • The problem of deciding eventuality properties with fair channels: do all computations eventually reach a given set of states if the unreliable channels are fair in the sense that they deliver infinitely many messages if infinitely many messages are transmitted. This problem can model the question of whether a link protocol, such as HDLC, will eventually reliably transfer messages across a medium that is not permanently broken.

The results are obtained through a reduction from a variant of Post's Correspondence Problem.

Ort, förlag, år, upplaga, sidor
1996. Vol. 130, nr 1, s. 71-90
Serie
Lecture Notes in Computer Science, ISSN 03 ; 820
Nyckelord [en]
CONTEXT-FREE PROCESSES; FINITE STATE MACHINES; AUTOMATIC VERIFICATION; SYSTEMS
Nationell ämneskategori
Teknik och teknologier
Identifikatorer
URN: urn:nbn:se:uu:diva-27215DOI: 10.1007/3-540-58201-0_78ISBN: 978-3-540-58201-4 (tryckt)ISBN: 978-3-540-48566-7 (tryckt)OAI: oai:DiVA.org:uu-27215DiVA, id: diva2:55109
Konferens
21st International Colloquium, ICALP 94 Jerusalem, Israel, July 11–14, 1994
Tillgänglig från: 2008-10-17 Skapad: 2008-10-17 Senast uppdaterad: 2013-10-03Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Person

Abdulla, Parosh AzizJonsson, Bengt

Sök vidare i DiVA

Av författaren/redaktören
Abdulla, Parosh AzizJonsson, Bengt
Av organisationen
Institutionen för datorteknik
Teknik och teknologier

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 886 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf