Transitive closures of regular relations for verifying infinite-state systems
2000 (English)In: TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, ISSN 0302-9743, Vol. 1785, 220-234 p.Article in journal (Refereed) Published
We consider a model for representing infinite-state and parameterized systems, in which states are represented as strings over a finite alphabet. Actions are transformations on strings, in which the change can be characterised by an arbitrary finite-state
Place, publisher, year, edition, pages
SPRINGER-VERLAG BERLIN , 2000. Vol. 1785, 220-234 p.
IdentifiersURN: urn:nbn:se:uu:diva-36516OAI: oai:DiVA.org:uu-36516DiVA: diva2:64415
Addresses: Jonsson B, Dept Comp Syst, POB 325, S-75105 Uppsala, Sweden. Dept Comp Syst, S-75105 Uppsala, Sweden.2008-10-172008-10-172011-01-14