Causality versus true-concurrency

DOI10.1016/J.TCS.2007.07.007MaRDI QIDQ2465026zbMATH OpenOpenAlexFDO

Authors Sibylle Fröschle, Sławomir Lasota

Publication date 19 December 2007

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

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

zbMATH Keywords

event structurescausal treeshistory preserving bisimulation

Mathematics Subject Classification ID

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

Recommendations

• Causality versus true-concurrency
• scientific article; zbMATH DE number 6708360
• scientific article; zbMATH DE number 3905836
• Causal trees, finally
• A note on causal trees and their applications to CCS

Cites work

• scientific article; zbMATH DE number 17804 (Why is no real title available?)
• scientific article; zbMATH DE number 1231616 (Why is no real title available?)
• scientific article; zbMATH DE number 1304990 (Why is no real title available?)
• scientific article; zbMATH DE number 821282 (Why is no real title available?)
• scientific article; zbMATH DE number 1418351 (Why is no real title available?)
• Bisimulation from open maps
• Minimal transition systems for history-preserving bisimulation
• Observing behaviour categorically
• On relating some models for concurrency
• Refinement of actions in event structures and causal trees
• Undecidability of domino games and hhp-bisimilarity.

Cited in

(5)

• Causal trees, finally
• Causal Atomicity
• Causality versus true-concurrency
• Revisiting causality, coalgebraically
• An introduction to timed automata

This page was built for publication: Causality versus true-concurrency

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