Process languages for rooted eager bisimulation

DOI10.1007/3-540-44618-4_21MaRDI QIDQ4536608zbMATH OpenFDO

Authors Irek Ulidowski, Shoji Yuen

Publication date 25 June 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44618-4_21

Mathematics Subject Classification ID

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

Recommendations

• Ordered SOS process languages for branching and eager bisimulations
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
• (Bi)simulations up-to characterise process semantics
• Priority rewrite systems for OSOS process languages.
• Bisimulation and divergence

Cited in

(8)

• Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
• Ordered SOS process languages for branching and eager bisimulations
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
• Ensuring liveness properties of distributed systems: open problems
• Eager functions as processes
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• Divide and congruence. III: Stability \& divergence
• On cool congruence formats for weak bisimulations

This page was built for publication: Process languages for rooted eager bisimulation

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