Approximating weak bisimulation on basic process algebras

DOI10.1007/3-540-48340-3_33MaRDI QIDQ4941915zbMATH OpenFDO

Authors Jitka Stříbrná

Publication date 19 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48340-3_33

zbMATH Keywords

basic process algebrasbisimulationsweak bisimilarity

Mathematics Subject Classification ID

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

Recommendations

• Approximating weak bisimilarity of basic parallel processes
• Weak Bisimulation Approximants
• Weak bisimilarity with infinite-state systems can be decided in polynomial time
• scientific article; zbMATH DE number 1759621
• scientific article; zbMATH DE number 1701362

Cited in

(13)

• Strong bisimilarity of simple process algebras: Complexity lower bounds
• New up-to techniques for weak bisimulation
• Extensions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time
• More on Weak Bisimilarity of Normed Basic Parallel Processes
• Weak Bisimulation Approximants
• An algebra of behavioural types
• scientific article; zbMATH DE number 2040321 (Why is no real title available?)
• scientific article; zbMATH DE number 4119652 (Why is no real title available?)
• Complexity of Weak Bisimilarity and Regularity for BPA and BPP
• Approximating weak bisimilarity of basic parallel processes
• Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
• scientific article; zbMATH DE number 7333244 (Why is no real title available?)
• A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces

This page was built for publication: Approximating weak bisimulation on basic process algebras

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