Reachability analysis of reversal-bounded automata on series-parallel graphs

Dimitrova, R. and Majumdar, R. (2015) Reachability analysis of reversal-bounded automata on series-parallel graphs. In: Esparza, J. and Tronci, E., (eds.) Electronic Proceedings in Theoretical Computer Science. 6th International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2015), 21-22 Sep 2015, Genoa, Italy. Open Publishing Association , pp. 100-114.



  • Dimitrova, R.
  • Majumdar, R.
Copyright, Publisher and Additional Information: © 2015 The Author(s). This is an Open Access article distributed under the terms of the Creative Commons Attribution Licence (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • Published (online): 23 September 2015
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 11 Feb 2020 12:53
Last Modified: 11 Feb 2020 13:34
Published Version:
Status: Published online
Publisher: Open Publishing Association
Refereed: Yes
Identification Number:


Share / Export