Z-reachability problem for games on 2-dimensional vector addition systems with states is in P*

Fundamenta Informaticae

Volumn 123, Issue 1, 2013, Pages 15-42

  Chaloupka, Jakub ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EXPTIME; INFINITE GAME; UPPER BOUND; VECTOR ADDITION SYSTEMS;

VECTORS;

PETRI NETS;

EID: 84876240763     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2013-798     Document Type: Conference Paper

References (8)

1. P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and J. Srba. Infinite runs in weighted timed automatawith energy constraints. In Proc. Formal Modeling and Analysis of Timed Systems, pages 33-47. Springer,2008
2. T. Bŕazdil, P. Jancar, and A. Kucera. Reachability games on extended vector addition systems with states.In Proc. International Colloquium on Automata, Languages and Programming, LNCS. Springer, 2010
3. L. Brim, J. Chaloupka, L. Doyen, R. Gentilini, and J.F. Raskin. Faster algorithms for mean-payoff games.Formal Methods in System Design, 38(2):97-118, 2011
4. A. Chakrabarti, L. de Alfaro, T. Henzinger, and M. Stoelinga. Resource interfaces. In Proc. EmbeddedSoftware, volume 2855 of LNCS, pages 117-133. Springer, 2003
5. J. E. Hopcroft and J.-J. Pansiot. On the reachablility problem for 5-dimensional vector addition systems.Theoretical Computer Science, 8(2):135-159, 1979
6. P. Jancar. Undecidability of bisimilarity for petri nets and related problems. Theoretical Computer Science,148:281-301, 1995
7. P. Jancar. Decidability of bisimilarity for one-counter processes. Information and Computation, 158:1-17,2000
8. W. Reisig. Petri Nets - An Introduction. Springer, 1985