Bounded context switching for valence systems

DOI10.4230/LIPICS.CONCUR.2018.12MaRDI QIDQ5009426zbMATH OpenOpenAlexFDO

Authors Meyer Roland, Sebastian Muskalla, Georg Zetzsche

Publication date 4 August 2021

Full work available at URL https://arxiv.org/abs/1803.09703

zbMATH Keywords

bounded context switchinggraph monoidsvalence systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Recent advances on reachability problems for valence systems (invited talk)
• Scope-Bounded Reachability in Valence Systems
• On the Complexity of Bounded Context Switching.
• Context-Bounded Analysis of Concurrent Queue Systems
• The language theory of bounded context-switching

Cites work

• A Note on "The Comparability Graph of a Tree"
• A perfect model for bounded verification
• Analyzing Timed Systems Using Tree Automata
• Automated Deduction – CADE-20
• Bounded Algol-Like Languages
• Characterizations of the decidability of some problems for regular trace languages
• Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
• Context-Bounded Analysis of Concurrent Queue Systems
• Controllers for the verification of communicating multi-pushdown systems
• Data multi-pushdown automata
• Delay-bounded scheduling
• Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
• Fine-grained complexity of safety verification
• First-order logic with reachability for infinite-state systems
• Knapsack in graph groups
• Monoids as storage mechanisms
• MSO decidability of multi-pushdown systems via split-width
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
• On bounded reachability analysis of shared memory systems
• On the Complexity of Bounded Context Switching.
• On the Reachability Analysis of Acyclic Networks of Pushdown Systems
• Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
• Reachability analysis of communicating pushdown systems
• Reachability of multistack pushdown systems with scope-bounded matching relations
• Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
• Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
• Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
• Silent transitions in automata with storage
• The emptiness problem for valence automata over graph monoids
• The language theory of bounded context-switching
• The monoid of queue actions
• The submonoid and rational subset membership problems for graph groups.
• The transformation monoid of a partially lossy queue
• The tree width of auxiliary storage
• Tools and Algorithms for the Construction and Analysis of Systems
• Towards an Efficient Tree Automata based technique for Timed Systems
• What's decidable about availability languages?

Cited in

(5)

• Reachability of scope-bounded multistack pushdown systems
• Recent advances on reachability problems for valence systems (invited talk)
• On the Complexity of Bounded Context Switching.
• Scope-Bounded Reachability in Valence Systems
• The complexity of bidirected reachability in valence systems

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Bounded context switching for valence systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009426)