Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement

DOI10.1145/566385.566386zbMath1365.68340OpenAlexW2055350841MaRDI QIDQ5738963

Mario Bravetti, Roberto Gorrieri

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/566385.566386

zbMATH Keywords

process algebraaxiomatizationaction refinementnoninterleaving semanticsST bisimulation

Mathematics Subject Classification ID

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

Related Items (9)

Unnamed Item ⋮ Reduction semantics in Markovian process algebra ⋮ A ground-complete axiomatisation of finite-state processes in a generic process algebra ⋮ Unnamed Item ⋮ Static Livelock Analysis in CSP ⋮ Action Refinement in Process Algebra and Security Issues ⋮ Vertical implementation ⋮ Stochastic and Real Time in Process Algebra: A Conceptual Overview ⋮ Extensions of Standard Weak Bisimulation Machinery: Finite-state General Processes, Refinable Actions, Maximal-progress and Time

This page was built for publication: Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement