Regularity of normed PA processes

DOI10.1016/S0020-0190(99)00125-8zbMATH Open1338.68203OpenAlexW2078803155MaRDI QIDQ294692FDOQ294692

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

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

zbMATH Keywords

regularityconcurrencyprocess algebra

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Process Algebra
• Bisimulation equivalence is decidable for one-counter processes
• Title not available (Why is that?)
• Deciding bisimulation-like equivalences with finite-state processes
• Bisimulation collapse and the process taxonomy

Cited In (1)

• The regular viewpoint on PA-processes

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)