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

Direct link
Ensuring completeness of symbolic verification methods for infinite-state systems
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. DEPARTMENT OF COMPUTER SYSTEMS.
2001 (English)In: THEORETICAL COMPUTER SCIENCE, ISSN 0304-3975, Vol. 256, no 1-2, 145-167 p.Article in journal (Refereed) Published
Abstract [en]

Over the last few years there has been an increasing research effort directed towards the automatic verification of infinite state systems. For different classes of such systems, e.g., hybrid automata, data-independent systems, relational automata, Petri

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 2001. Vol. 256, no 1-2, 145-167 p.
Keyword [en]
infinite-state systems; model checking; reachability analysis; symbolic verification; MODEL-CHECKING; UNRELIABLE CHANNELS; PROGRAMS; DECIDABILITY; FINITE
URN: urn:nbn:se:uu:diva-36477OAI: oai:DiVA.org:uu-36477DiVA: diva2:64376
Addresses: Abdulla PA, Univ Uppsala, Dept Comp Syst, POB 325, S-75105 Uppsala, Sweden. Univ Uppsala, Dept Comp Syst, S-75105 Uppsala, Sweden.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-13

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: 181 hits
ReferencesLink to record
Permanent link

Direct link