Abstract games for infinite state processes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

In this paper we propose finding winning strategies of abstract games as an approach to verification problems which permits both a variable level of abstraction and on-the-fly exploration. We describe a generic algorithm which, when instantiated with certain functions specific to the concrete game, computes a winning strategy. We apply this technique to bisimulation and model-checking of value-passing processes, and to timed automata.
Original languageEnglish
Title of host publicationCONCUR'98 Concurrency Theory
Subtitle of host publication9th International Conference Nice, France, September 8–11, 1998 Proceedings
EditorsDavide Sangiorgi, Robert de Simone
PublisherSpringer-Verlag GmbH
Pages147-162
Number of pages16
ISBN (Print)978-3-540-64896-3
DOIs
Publication statusPublished - 1998

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
Volume1466
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Abstract games for infinite state processes'. Together they form a unique fingerprint.

Cite this