uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Transitive closures of regular relations for verifying infinite-state systems
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology.
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
Abstract [en]

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.
Keyword [en]
URN: 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.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-14

Open Access in DiVA

No full text

By organisation
Department of Information Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 158 hits
ReferencesLink to record
Permanent link

Direct link