Sökning: id:"swepub:oai:DiVA.org:uu-72660" >
A Survey of Regular...
A Survey of Regular Model Checking.
-
- Abdulla, Parosh (författare)
- Uppsala universitet,Institutionen för informationsteknologi,Datorteknik,datorteknik
-
- Jonsson, Bengt (författare)
- Uppsala universitet,Institutionen för informationsteknologi,Datorteknik,datorteknik
-
- Nilsson, Marcus (författare)
- Uppsala universitet,Institutionen för informationsteknologi,Datorteknik,datorteknik
-
visa fler...
-
- Saksena, Mayank (författare)
- Uppsala universitet,Institutionen för informationsteknologi,Datorteknik,datorteknik
-
visa färre...
-
(creator_code:org_t)
- 2004
- 2004
- Engelska.
-
Ingår i: CONCUR 2004 - Concurrency Theory. - 354022940X ; , s. 35-48
- Relaterad länk:
-
https://urn.kb.se/re...
Abstract
Ämnesord
Stäng
- Regular model checking is being developed for algorithmic verification of several classes of infinite-state systems whose configurations can be modeled as words over a finite alphabet. Examples include parameterized systems consisting of an arbitrary number of homogeneous finite-state processes connected in a linear or ring-formed topology, and systems that operate on queues, stacks, integers, and other linear data structures. The main idea is to use regular languages as the representation of sets of configurations, and finite-state transducers to describe transition relations. In general, the verification problems considered are all undecidable, so the work has consisted in developing semi-algorithms, and decidability results for restricted cases. This paper provides a survey of the work that has been performed so far, and some of its applications.
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas