Reachability problems on reliable and lossy queue automata
From MaRDI portal
(Redirected from Publication:825976)
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
- scientific article; zbMATH DE number 1670780 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 1232241 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Algorithmic analysis of programs with well quasi-ordered domains.
- An Algorithm for the General Petri Net Reachability Problem
- Automated technology for verification and analysis. Third international symposium, ATVA 2005, Taipei, Taiwan, October 4--7, 2005. Proceedings.
- Demystifying Reachability in Vector Addition Systems
- On Communicating Finite-State Machines
- On free monoids partially ordered by embedding
- Rational subsets of polycyclic monoids and valence automata
- Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
- Reachability analysis of pushdown automata: Application to model-checking
- Reachability problems on partially lossy queue automata
- Safety problems are NP-complete for flat integer programs with octagonal loops
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- The inclusion structure of partially lossy queue monoids and their trace submonoids
- The monoid of queue actions
- The power of priority channel systems
- Undecidable problems in unreliable computations.
- Undecidable verification problems for programs with unreliable channels
- Using forward reachability analysis for verification of lossy channel systems
- Verification of flat FIFO systems
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Verifying programs with unreliable channels
- Well-structured transition systems everywhere!
Cited in
(5)- scientific article; zbMATH DE number 1564050 (Why is no real title available?)
- Comparing channel restrictions of communicating state machines, high-level message sequence charts, and multiparty session types
- scientific article; zbMATH DE number 1754626 (Why is no real title available?)
- Queue Automata: Foundations and Developments
- scientific article; zbMATH DE number 1773081 (Why is no real title available?)
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)
