Reachability problems on reliable and lossy queue automata
From MaRDI portal
Publication:825976
DOI10.1007/S00224-021-10031-2zbMATH Open1503.68174OpenAlexW3174765282MaRDI QIDQ825976FDOQ825976
Authors: Chris Köcher 
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
Recommendations
- Reachability problems on partially lossy queue automata
- scientific article; zbMATH DE number 1773081
- Queue Automata: Foundations and Developments
- Relating reachability problems in timed and counter automata
- scientific article; zbMATH DE number 7297846
- Reachability Problems for Hybrid Automata
- Reachability problems in piecewise FIFO systems
- On the relationship between reachability problems in timed and counter automata
- Reachability relations of timed pushdown automata
- Verification in loosely synchronous queue-connected discrete timed automata.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Communicating Finite-State Machines
- Undecidable problems in unreliable computations.
- 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
- Well-structured transition systems everywhere!
- Undecidable verification problems for programs with unreliable channels
- Reachability analysis of pushdown automata: Application to model-checking
- Automated technology for verification and analysis. Third international symposium, ATVA 2005, Taipei, Taiwan, October 4--7, 2005. Proceedings.
- An Algorithm for the General Petri Net Reachability Problem
- Title not available (Why is that?)
- On free monoids partially ordered by embedding
- Demystifying Reachability in Vector Addition Systems
- Title not available (Why is that?)
- Rational subsets of polycyclic monoids and valence automata
- The monoid of queue actions
- Reachability problems on partially lossy queue automata
- Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops
- Title not available (Why is that?)
- The inclusion structure of partially lossy queue monoids and their trace submonoids
- Title not available (Why is that?)
- The Power of Priority Channel Systems
Cited In (5)
This page was built for publication: Reachability problems on reliable and lossy queue automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q825976)
