English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs

MPS-Authors
/persons/resource/persons44322

Dimitrova,  Rayna
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons144534

Majumdar,  Rupak
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

External Resource

http://arxiv.org/pdf/1509.07202v1.pdf
(Any fulltext)

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

Dimitrova, R., & Majumdar, R. (2015). Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs. In J. Esparza, & E. Tronci (Eds.), Proceedings Sixth International Symposium on Games, Automata, Logics and Formal Verification (pp. 100-114).


Cite as: https://hdl.handle.net/11858/00-001M-0000-0029-7969-6
Abstract
There is no abstract available