Reachability analysis of reversal-bounded automata on series-parallel graphs
From MaRDI portal
Publication:1741900
DOI10.1007/s00236-016-0290-1zbMath1390.68385DBLPjournals/acta/DimitrovaM18arXiv1509.07202OpenAlexW2285849266WikidataQ59470834 ScholiaQ59470834MaRDI QIDQ1741900
Rupak Majumdar, Rayna Dimitrova
Publication date: 10 April 2018
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.07202
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
Cites Work
- Language, culture, computation. Computing -- theory and technology. Essays dedicated to Yaacov Choueka on the occasion of his 75th birthday, Part I
- The complexity of decision problems for finite-turn multicounter machines
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- A Perfect Model for Bounded Verification
- Explicit State Model Checking for Graph Grammars
- A Temporal Graph Logic for Verification of Graph Transformation Systems
- Two-Way Counter Machines and Diophantine Equations
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Handbook of Graph Grammars and Computing by Graph Transformation
- On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
- CONCUR 2004 - Concurrency Theory
- The tree width of auxiliary storage
- Automata with Reversal-Bounded Counters: A Survey
- Reachability Analysis of Communicating Pushdown Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reachability analysis of reversal-bounded automata on series-parallel graphs
