Decidability of performance equivalence for basic parallel processes

DOI10.1016/j.tcs.2006.02.020zbMath1099.68070MaRDI QIDQ2503324

Sławomir Lasota

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.02.020

zbMATH Keywords

process algebra; equivalence checking; bisimulation equivalence; performance equivalence; basic parallel processes

Mathematics Subject Classification ID

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

03B25: Decidability of theories and sets of sentences

Related Items

Undecidability of performance equivalence of Petri nets, Non-interleaving bisimulation equivalences on basic parallel processes, A study on team bisimulation and H-team bisimulation for BPP nets, Team bisimilarity, and its associated modal logic, for BPP nets, Decidability of branching bisimulation on normed commutative context-free processes, Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes

Cites Work

• A theory of processes with durational actions
• Performance preorder and competitive equivalence
• A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
• On performance congruences for process algebras
• Timing and causality in process algebra
• Semigroups, Presburger formulas, and languages
• Rational sets in commutative monoids
• Graphes canoniques de graphes algébriques
• Mathematical Foundations of Computer Science 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item