Games for Counting Abstractions

Authors:
J. -F. Raskin;M. Samuelides;L. Van Begin
Affiliations:
Computer Science Department, University of Brussels, Belgium;Ecole Normale Supérieure de Cachan, France;Ecole Normale Supérieure de Cachan, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 5

Reasoning about systems with many processes

Journal of the ACM (JACM)
A theory of timed automata

Theoretical Computer Science
Well-structured transition systems everywhere!

Theoretical Computer Science
Pushdown Processes: Games and Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
General decidability theorems for infinite-state systems

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computation: finite and infinite machines

Computation: finite and infinite machines

Lossy counter machines decidability cheat sheet

RP'10 Proceedings of the 4th international conference on Reachability problems
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Concurrent games on VASS with inhibition

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Solving parity games on integer vectors

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Computable fixpoints in well-structured symbolic model checking

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been recently shown that monotonicity is not sufficient to obtain decidability results for two-player games. However, positive results can be obtained on restricted subclasses of monotonic two-player games. In this paper, we identify and study a subclass of monotonic two-player games that is useful for analysis of parametric (open) systems that can be modeled by using counting abstractions. Although the reachability game problem is undecidable in general for that subclass, we identify two interesting and decidable problems and show how to apply those results in parametric system analysis.