Bounded Context Switching for Valence Systems
From MaRDI portal
Publication:5009426
DOI10.4230/LIPIcs.CONCUR.2018.12OpenAlexW2963249791MaRDI QIDQ5009426
Meyer Roland, Georg Zetzsche, Sebastian Muskalla
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1803.09703
Related Items (2)
Recent advances on reachability problems for valence systems (invited talk) ⋮ Reachability of scope-bounded multistack pushdown systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The submonoid and rational subset membership problems for graph groups.
- The monoid of queue actions
- Knapsack in graph groups
- The transformation monoid of a partially lossy queue
- The emptiness problem for valence automata over graph monoids
- Shortest Paths in One-Counter Systems
- Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
- MSO Decidability of Multi-Pushdown Systems via Split-Width
- A Perfect Model for Bounded Verification
- Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
- Controllers for the Verification of Communicating Multi-pushdown Systems
- Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems
- The Language Theory of Bounded Context-Switching
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
- Analyzing Timed Systems Using Tree Automata
- First-order logic with reachability for infinite-state systems
- Characterizations of the decidability of some problems for regular trace languages
- Data Multi-Pushdown Automata
- Towards an Efficient Tree Automata based technique for Timed Systems
- On the Complexity of Bounded Context Switching.
- Silent Transitions in Automata with Storage
- Automated Deduction – CADE-20
- The tree width of auxiliary storage
- Delay-bounded scheduling
- Context-Bounded Analysis of Concurrent Queue Systems
- A Note on "The Comparability Graph of a Tree"
- Bounded Algol-Like Languages
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Tools and Algorithms for the Construction and Analysis of Systems
- Reachability Analysis of Communicating Pushdown Systems
- Fine-grained complexity of safety verification
This page was built for publication: Bounded Context Switching for Valence Systems
