English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Unboundedness Problems for Languages of Vector Addition Systems

MPS-Authors
/persons/resource/persons230970

Zetzsche,  Georg
Group G. Zetzsche, Max Planck Institute for Software Systems, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2018/9123/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Czerwinski, W., Hofman, P., & Zetzsche, G. (2018). Unboundedness Problems for Languages of Vector Addition Systems. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (pp. 1-15). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2018.119.


Cite as: https://hdl.handle.net/21.11116/0000-0003-21D8-4
Abstract
There is no abstract available