Pushdown automata, multiset automata, and Petri nets

68Q45: Formal languages and automata

Related Items

Reaction automata, On the properties of language classes defined by bounded reaction automata, Reachability is decidable for weakly extended process rewrite systems, Decomposition and factorization of chemical reaction transducers, Petri nets are less expressive than state-extended PA

Cites Work

Undecidability of bisimilarity for Petri nets and some related problems
On the regular structure of prefix rewriting
CCS expressions, finite state processes, and three problems of equivalence
Algebra of communicating processes with abstraction
The theory of ends, pushdown automata, and second-order logic
A calculus of communicating systems
Petri nets and regular languages
A short proof of the decidability of bisimulation for normed BPA- processes
Unique decomposition of processes
Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
Undecidable equivalences for basic process algebra
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Bisimulation equivalence is decidable for all context-free processes
Petri nets and regular processes
Decidability of bisimulation equivalence for process generating context-free languages
Graphes canoniques de graphes algébriques
An elementary bisimulation decision procedure for arbitrary context-free processes
Three Partition Refinement Algorithms
The equivalence problem for deterministic pushdown automata is decidable
A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
A fast algorithm to decide on the equivalence of stateless DPDA
Infinite results
Decidability of bisimulation equivalence for normed pushdown processes
Bisimulation collapse and the process taxonomy
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item