Causality versus true-concurrency

DOI10.1016/J.TCS.2007.07.007zbMATH Open1143.68052OpenAlexW2040823548MaRDI QIDQ2465026FDOQ2465026

Sławomir Lasota, Sibylle Fröschle

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

Recommendations

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

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)

Cites Work

• Undecidability of domino games and hhp-bisimilarity.
• Bisimulation from open maps
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal transition systems for history-preserving bisimulation
• Refinement of actions in event structures and causal trees
• On relating some models for concurrency
• Title not available (Why is that?)
• Observing behaviour categorically

Cited In (3)

• Causal Atomicity
• An Introduction to Timed Automata
• Causal Trees, Finally

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)