Regularity of normed PA processes

DOI10.1016/S0020-0190(99)00125-8MaRDI QIDQ294692zbMATH OpenOpenAlexFDO

Authors Antonin Kučera

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019099001258?np=y

zbMATH Keywords

concurrencyprocess algebraregularity

Mathematics Subject Classification ID

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

Recommendations

• Checking equality and regularity for normed BPA with silent moves
• scientific article; zbMATH DE number 2102747
• 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
• 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?)
• Process Algebra

Cited in

(5)

• scientific article; zbMATH DE number 1304991 (Why is no real title available?)
• Checking equality and regularity for normed BPA with silent moves
• The regular viewpoint on PA-processes
• 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 of normed PA processes

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