Reachability problems on reliable and lossy queue automata
From MaRDI portal
Publication:825976
DOI10.1007/s00224-021-10031-2zbMath1503.68174OpenAlexW3174765282MaRDI QIDQ825976
Publication date: 18 December 2021
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-021-10031-2
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Undecidable verification problems for programs with unreliable channels
- Rational subsets of polycyclic monoids and valence automata
- Undecidable problems in unreliable computations.
- The monoid of queue actions
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Algorithmic analysis of programs with well quasi-ordered domains.
- Using forward reachability analysis for verification of lossy channel systems
- Verifying programs with unreliable channels
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Reachability problems on partially lossy queue automata
- Automated technology for verification and analysis. Third international symposium, ATVA 2005, Taipei, Taiwan, October 4--7, 2005. Proceedings.
- Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops
- On Communicating Finite-State Machines
- An Algorithm for the General Petri Net Reachability Problem
- The inclusion structure of partially lossy queue monoids and their trace submonoids
- Demystifying Reachability in Vector Addition Systems
- On free monoids partially ordered by embedding
- The Power of Priority Channel Systems
- Well-structured transition systems everywhere!
- Reachability analysis of pushdown automata: Application to model-checking
This page was built for publication: Reachability problems on reliable and lossy queue automata
