Causal message sequence charts

DOI10.1016/J.TCS.2009.06.013zbMath1187.68081OpenAlexW2095101151MaRDI QIDQ843103

Shaofa Yang, Loïc Hélouët, Thomas Gazagnaire, Blaise Genest, P. S. Thiagarajan

Publication date: 29 September 2009

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

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

zbMATH Keywords

modelingdistributed systemspartial ordersscenario languages

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (3)

Quantitative Analysis of Communication Scenarios ⋮ Diagnosis from scenarios ⋮ Interface theories for concurrency and data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modeling concurrency with partial orders
• Regular sets of infinite message sequence charts
• Infinite-state high-level MSCs: model-checking and realizability
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• A theory of regular MSC languages
• Causal Message Sequence Charts
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Fundamentals of Computation Theory

This page was built for publication: Causal message sequence charts