Verifying unboundedness via amalgamation
From MaRDI portal
Cites work
- A characterization for decidable separability by piecewise testable languages
- A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
- A structure to decide reachability in Petri nets
- Algorithmic analysis of programs with well quasi-ordered domains.
- An approach to computing downward closures
- An Approach to Regular Separability in Vector Addition Systems
- Approximating Petri net reachability along context-free traces
- Bounded Algol-Like Languages
- Bounded Parikh automata
- Computing downward closures for stacked counter automata
- Cost Automata, Safe Schemes, and Downward Closures
- Counter machines with infrequent reversals
- Coverability Is undecidable in one-dimensional pushdown vector addition systems with resets
- Deciding piecewise testable separability for regular tree languages
- Demystifying Reachability in Vector Addition Systems
- Effective constructions in well-partially-ordered free monoids
- Finding the growth rate of a regular or context-free language in polynomial time
- Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
- Forward analysis and model checking for trace bounded WSTS
- scientific article; zbMATH DE number 3978429 (Why is no real title available?)
- scientific article; zbMATH DE number 4030997 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 10087 (Why is no real title available?)
- scientific article; zbMATH DE number 7439739 (Why is no real title available?)
- scientific article; zbMATH DE number 7204383 (Why is no real title available?)
- On Context-Free Languages
- On free monoids partially ordered by embedding
- On functions weakly computable by pushdown Petri nets and related systems
- On the coverability problem for pushdown vector addition systems in one dimension
- On the density of context-free and counter languages
- Ordering by Divisibility in Abstract Algebras
- Petri net algorithms in the theory of matrix grammars
- Priority downward closures
- Reachability in Petri nets with inhibitor arcs
- Recent advances on reachability problems for valence systems (invited talk)
- Recursive Petri nets
- Regular separability of one counter automata
- Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
- Separability by piecewise testable languages and downward closures beyond subwords
- Separability of reachability sets of vector addition systems
- Separating regular languages by piecewise testable and unambiguous languages
- Sequential grammars and automata with valences
- The complexity of bidirected reachability in valence systems
- The Complexity of the Diagonal Problem for Recursion Schemes
- The covering and boundedness problems for vector addition systems
- The diagonal problem for higher-order recursion schemes is decidable
- The downward-closure of Petri net languages
- The emptiness problem for valence automata over graph monoids
- The power of priority channel systems
- The theory of well-quasi-ordering: a frequently discovered concept
- Unboundedness and downward closures of higher-order pushdown automata
- Unboundedness for recursion schemes: a simpler type system
- Unboundedness problems for languages of vector addition systems
- Unboundedness problems for machines with reversal-bounded counters
- Undecidable problems in unreliable computations.
- Unreliable channels are easier to verify than perfect channels
- Vector addition systems reachability problem (a simpler solution)
- Verifying unboundedness via amalgamation
- Well-structured languages
- Well-structured transition systems everywhere!
Cited in
(5)
This page was built for publication: Verifying unboundedness via amalgamation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970280)
