Regularity is decidable for normed PA processes in polynomial time

DOI10.1007/3-540-62034-6_42MaRDI QIDQ6567761zbMATH OpenFDO

Authors Antonin Kučera

Publication date 5 July 2024

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Regularity of normed PA processes
• Regularity is decidable for normed BPA and normed BPP processes in polynomial time
• Checking equality and regularity for normed BPA with silent moves
• scientific article; zbMATH DE number 2102747
• scientific article; zbMATH DE number 1231554

Cites work

• scientific article; zbMATH DE number 4035115 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 2102771 (Why is no real title available?)
• scientific article; zbMATH DE number 1414283 (Why is no real title available?)
• A short proof of the decidability of bisimulation for normed BPA- processes
• Bisimulation collapse and the process taxonomy
• Regularity is decidable for normed PA processes in polynomial time

Cited in

(2)

• Regularity is decidable for normed BPA and normed BPP processes in polynomial time
• Regularity is decidable for normed PA processes in polynomial time

This page was built for publication: Regularity is decidable for normed PA processes in polynomial time

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