Linear equations for unordered data vectors in [D]^k\to{}Z^d
From MaRDI portal
Publication:5060183
Recommendations
Cites work
- Approaching the coverability problem continuously
- Context-free languages over infinite alphabets
- Continuous reachability for unordered data Petri nets is in PTime
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
- Depth boundedness in multiset rewriting systems with name binding
- Finite-memory automata
- Free Choice Petri Nets
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 1755138 (Why is no real title available?)
- scientific article; zbMATH DE number 7297813 (Why is no real title available?)
- Linear equations with ordered data
- Minimal solutions of linear diophantine systems : bounds and algorithms
- Nets with tokens which carry data
- Reducibility among combinatorial problems
- Solving linear programs in the current matrix multiplication time
- Special section on coloured Petri nets
- Turing machines with atoms
- What makes Petri nets harder to verify: stack or data?
Cited in
(3)
This page was built for publication: Linear equations for unordered data vectors in $[D]^k\to{}Z^d$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060183)
