Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Better is Better than Well: On Efficient Verification of
 

Summary: Better is Better than Well:
On Efficient Verification of
Infinite­State Systems
(Extended Abstract)
Parosh Aziz Abdulla Aletta Nyl'en
Department of Computer Systems, Uppsala University
P.O.Box 325, 751 05 Uppsala, Sweden
phone: +46 18 471 31 63, fax: +46 18 55 02 25,
email: fparosh, alettag@docs.uu.se
Abstract
Many existing algorithms for model checking of infinite­state systems op­
erate on constraints which are used to represent (potentially infinite) sets of
states. A general powerful technique which can be employed for proving ter­
mination of these algorithms is that of well quasi­orderings. Several method­
ologies have been proposed for derivation of new well quasi­ordered constraint
systems. However, many of these constraint systems suffer from a ``constraint
explosion problem'', as the number of the generated constraints grows expo­
nentially with the size of the problem. In this paper, we demonstrate that
a refinement of the theory of well quasi­orderings, called the theory of better
quasi­orderings is more appropriate for symbolic model checking, since it allows

  

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences