History-deterministic vector addition systems

Cites work

scientific article; zbMATH DE number 7471692 (Why is no real title available?)
scientific article; zbMATH DE number 3310089 (Why is no real title available?)
scientific article; zbMATH DE number 7649927 (Why is no real title available?)
scientific article; zbMATH DE number 7799616 (Why is no real title available?)
A bit of nondeterminism makes pushdown automata expressive and succinct
Bisimulation equivalence and regularity for real-time one-counter automata
Deterministic one-counter automata
History-deterministic Parikh automata
History-deterministic timed automata
History-deterministic timed automata are not determinizable
Language inclusion for boundedly-ambiguous vector addition systems is decidable
Nonprimitive recursive complexity and undecidability for Petri net equivalences
On Büchi one-counter automata
On history-deterministic one-counter nets
On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets
Parallel program schemata
Petri nets and regular languages
Petri nets and regular processes
Reachability in Petri nets with inhibitor arcs
Reachability in vector addition systems is Ackermann-complete
Relating word and tree automata
Remarks on blind and partially blind one-way multicounter machines
Simulation problems over one-counter nets
Solving Games Without Determinization
The Theory of Stabilisation Monoids and Regular Cost Functions
The covering and boundedness problems for vector addition systems
The reachability problem for Petri nets is not primitive recursive
Token games and history-deterministic quantitative automata
Trace inclusion for one-counter nets revisited
Undecidability of two-dimensional robot games

This page was built for publication: History-deterministic vector addition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967330)