Partially-Commutative Context-Free Processes

DOI10.1007/978-3-642-04081-8_18MaRDI QIDQ3184678zbMATH OpenOpenAlexFDO

Authors Wojciech Czerwiński, Sibylle Fröschle, Sławomir Lasota

Publication date 22 October 2009

Published in CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04081-8_18

Mathematics Subject Classification ID

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

Recommendations

• Partially-commutative context-free processes: expressibility and tractability
• Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
• Fast equivalence-checking for normed context-free processes
• Bisimulation equivalence is decidable for all context-free processes
• scientific article; zbMATH DE number 4035115

Cites work

• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
• Bisimulation equivalence is decidable for all context-free processes
• Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
• scientific article; zbMATH DE number 1045405 (Why is no real title available?)
• scientific article; zbMATH DE number 1405656 (Why is no real title available?)
• Normed BPA vs. Normed BPP Revisited
• Normed processes, unique decomposition, and complexity of bisimulation equivalences
• Verification on infinite structures.

Cited in

(2)

• An elementary bisimulation decision procedure for arbitrary context-free processes
• Partially-commutative context-free processes: expressibility and tractability

This page was built for publication: Partially-Commutative Context-Free Processes

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