<p>In today's computer engineering, requirements for generally high reliability have pushed the notion of testing to its limits. Many disciplines are moving, or have already moved, to more formal methods to ensure correctness. This is done by comparing the behavior of the system as it is implemented against a set of requirements. The ultimate goal is to create methods and tools that are able to perform this kind of verfication <i>automatically</i>: this is called <i>Model Checking</i>.</p><p>Although the notion of model checking has existed for two decades, adoption by the industry has been hampered by its poor applicability to complex systems. During the 90's, researchers have introduced an approach to cope with large (even infinite) state spaces: <i>Symbolic Model Checking</i>. The key notion is to represent large (possibly infinite) sets of states by a small formula (as opposed to enumerating all members). In this thesis, we investigate applying symbolic methods to different types of systems:</p><p><b>Parameterized systems.</b> We work whithin the framework of <i>Regular Model Chacking</i>. In regular model checking, we represent a global state as a word over a finite alphabet. A transition relation is represented by a regular length-preserving transducer. An important operation is the so-called transitive closure, which characterizes composing a transition relation with itself an arbitrary number of times. Since completeness cannot be achieved, we propose methods of computing closures that work as often as possible.</p><p><b>Games on infinite structures.</b> Infinite-state systems for which the transition relation is monotonic with respect to a well quasi-ordering on states can be analyzed. We lift the framework of well quasi-ordered domains toward games. We show that monotonic games are in general undecidable. We identify a subclass of monotonic games: downward-closed games. We propose an algorithm to analyze such games with a winning condition expressed as a safety property.</p><p><b>Probabilistic systems.</b> We present a framework for the quantitative analysis of probabilistic systems with an infinite state-space: given an initial state <i>s</i><i>init</i>, a set <i>F</i> of final states, and a rational <i>Θ</i> > 0, compute a rational ρ such that the probability of reaching <i>F</i> form <i>s</i><i>init</i> is between ρ and ρ + <i>Θ</i>. We present a generic algorithm and sufficient conditions for termination.</p>
| Identifer | oai:union.ndltd.org:UPSALLA/oai:DiVA.org:uu-3753 |
| Date | January 2003 |
| Creators | d'Orso, Julien |
| Publisher | Uppsala University, Department of Information Technology, Uppsala : Acta Universitatis Upsaliensis |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Doctoral thesis, comprehensive summary, text |
| Relation | Uppsala Dissertations from the Faculty of Science and Technology, 1104-2516 ; 50 |
Page generated in 0.0125 seconds