Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
WELL (AND BETTER) QUASI-ORDERED TRANSITION SYSTEMS PAROSH AZIZ ABDULLA
 

Summary: WELL (AND BETTER) QUASI-ORDERED TRANSITION SYSTEMS
PAROSH AZIZ ABDULLA
Abstract. In this paper, we give a step by step introduction to the theory of well
quasi-ordered transition systems. The framework combines two concepts, namely (i)
transition systems which are monotonic wrt. a well-quasi ordering; and (ii) a scheme
for symbolic backward reachability analysis. We describe several models with infinite-
state spaces, which can be analyzed within the framework, e.g., Petri nets, lossy channel
systems, timed automata, timed Petri nets, and multiset rewriting systems. We will also
present better quasi-ordered transition systems which allow the design of efficient symbolic
representations of infinite sets of states.
1. Introduction.
1.1. Background. Current capabilities in computer technology allow enor-
mously complicated implementations of such systems, making the task of pro-
ducing error-free products more and more difficult. Consequently, it is of great
practical and economical importance to develop methods which make the design
process less error-prone. In other words, there is a real need of techniques for
rigorous verification of software in order to complement testing and guarantee
a higher degree of reliability. It is now widely accepted that validation meth-
ods should be automatic; this would allow engineers to perform verification (like
they perform compilation) on programs without needing to be familiar with the

  

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

 

Collections: Computer Technologies and Information Sciences