Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ICALP
2010
Springer

favoriteEmaildiscussreport

122views Programming Languages» more ICALP 2010»

Reachability Games on Extended Vector Addition Systems with States

13 years 9 months ago

Reachability Games on Extended Vector Addition Systems with States

Download www.fi.muni.cz

We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of deciding the winner in such games in undecidable in general, we identify several decidable and even tractable subcases of this problem obtained by restricting the number of counters and/or the sets of target conﬁgurations.

Tomás Brázdil, Petr Jancar, Anton&ia

Real-time Traffic

ICALP 2010 | Programming Languages | Two-player Turn-based Games | Vector Addition Systems | Zero-safety Objectives |

claim paper

Related Content

» Rewriting Systems for Reachability in Vector Addition Systems with Pairs

» The General Vector Addition System Reachability Problem by Presburger Inductive Invariants

» Mixing Coverability and Reachability to Analyze VASS with One ZeroTest

» Accurate hybridization of nonlinear systems

» A New Class of Decidable Hybrid Systems

» Verification of Liveness Properties Using Compositional Reachability Analysis

» Optimal filtering for uncertain linear stochastic systems

» Reachability in Unions of Commutative Rewriting Systems Is Decidable

» Linear Arithmetic with Stars

Post Info
More Details (n/a)

Added	19 Jul 2010
Updated	19 Jul 2010
Type	Conference
Year	2010
Where	ICALP
Authors	Tomás Brázdil, Petr Jancar, Antonín Kucera

Comments (0)