Published: 17th November 2009
DOI: 10.4204/EPTCS.10
ISSN: 2075-2180

EPTCS 10

Proceedings International Workshop on
Verification of Infinite-State Systems
Bologna, Italy, 31th August 2009

Edited by: Axel Legay
Preface
Axel Legay and Azadeh Farzan		1
Dense-choice Counter Machines revisited
Florent Bouchy, Alain Finkel and Pierluigi San Pietro		3
On external presentations of infinite graphs
Christophe Morvan		23
Automated Predicate Abstraction for Real-Time Models
Bahareh Badban, Stefan Leue and Jan-Georg Smaus		36
An Inverse Method for Policy-Iteration Based Algorithms
Laurent Fribourg and Etienne André		44
A Tighter Bound for the Determinization of Visibly Pushdown Automata
Nguyen Van Tang		62

Preface

This volume contains the preliminary proceedings of the 11th International Workshop on Verification of Infinite-State Systems (INFINITY'09). The workshop was held in Bologna, Italy on August 31, 2009, as a satellite event to the 20th International Conference on Concurrency Theory (CONCUR'09). The aim of the INFINITY workshop is to provide a forum for researchers interested in the development of formal methods and algorithmic techniques for the analysis of systems with infinitely many states, and their application in automated verification of complex software and hardware systems.

The program committee of INFINITY'09 consisted of

Each paper was refereed by 2 reviewers. The papers were refereed by the program committee and by several external referees (Faouzi Atig, Jonathan Cederberg, Lukas Holik, Mihaela Sighireanu), whose help is gratefully acknowledged.

The invited speakers at the workshop were

For the nineth time, INFINITY was organized as a satellite event to CONCUR. We are very grateful to the CONCUR organizers for taking care of all the local organization and for accommodating all our special requests.

Axel Legay and Azadeh Farzan