Regularity of normed PA processes
From MaRDI portal
Recommendations
- Checking equality and regularity for normed BPA with silent moves
- Regularity for a large class of context-free processes is decidable
- scientific article; zbMATH DE number 1231554
- A short proof of the decidability of bisimulation for normed BPA- processes
- Comparing expressibility of normed BPA and normed BPP processes
Cites work
- Bisimulation collapse and the process taxonomy
- Bisimulation equivalence is decidable for one-counter processes
- Deciding bisimulation-like equivalences with finite-state processes
- Deciding finiteness of Petri nets up to bisimulation
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- Process Algebra
Cited in
(5)
This page was built for publication: Regularity of normed PA processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294692)