(Enter summary)
Abstract: This dissertation deals with a number of algorithmic problems motivated by
computer aided formal verification of finite state systems. The goal of formal
verification is to enhance the design and development of complex systems by
providing methods and tools for specifying and verifying correctness of designs.
The success of formal methods in practice depends heavily on the degree
of automation of development and verification process. This motivates
development of efficient algorithms for... (Update)
Similar documents (at the sentence level):
9.9%: A Discrete Strategy Improvement Algorithm for Solving Parity.. - Jurdzinski, Vöge (2000)
(Correct)
7.1%: Small Progress Measures for Solving Parity Games - Jurdzinski (2000)
(Correct)
Similar documents based on text: More All
1.4: Topics in Semantics-based Program Manipulation - Grobauer (2001)
(Correct)
1.3: Worst Case Efficient Data Structures - Brodal (1997)
(Correct)
1.1: Efficient External-Memory Data Structures and Applications - Arge (1996)
(Correct)
BibTeX entry: (Update)
@misc{ jurdzinski-games,
author = "M. Jurdzinski",
title = "Games for Verification: Algorithmic Issues",
url = "citeseer.ist.psu.edu/jurdzinski00games.html" }
Citations not processed or no citations identified.
Documents on the same site (http://www.brics.dk/DS/Ref/BRICS-DS-Ref/BRICS-DS-Ref.html): More
Logics and Automata for Verification: Expressiveness and.. - Henriksen (2000)
(Correct)
Dynamic Computation - Husfeldt (1997)
(Correct)
Categorical Models for Concurrency: Independence, Fairness and.. - Hildebrandt (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC