Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Ensuring Completeness of Symbolic Verification Methods
 

Summary: Ensuring Completeness of
Symbolic Verification Methods
for Infinite­State Systems \Lambda
Parosh Aziz Abdulla
Dept. Computer Systems
Uppsala University
P.O.Box 325
751 05 Uppsala, Sweden
parosh@docs.uu.se
Bengt Jonsson
Dept. Computer Systems
Uppsala University
P.O.Box 325,
751 05 Uppsala, Sweden
bengt@docs.uu.se
Abstract
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 nets, and lossy chan­

  

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

 

Collections: Computer Technologies and Information Sciences