Extensions of Standard Weak Bisimulation Machinery: Finite-state General Processes, Refinable Actions, Maximal-progress and Time

DOI10.1016/j.entcs.2008.04.005zbMath1279.68250OpenAlexW1977555802MaRDI QIDQ2870192

Mario Bravetti

Publication date: 17 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.005

zbMATH Keywords

action refinementweak bisimulationCCSmaximal progresstimed actions

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• A complete axiomatisation for observational congruence of finite-state behaviours
• The theory of interactive generalized semi-Markov processes
• A process algebra for timed systems
• A Generic Process Algebra
• Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extensions of Standard Weak Bisimulation Machinery: Finite-state General Processes, Refinable Actions, Maximal-progress and Time