Realizability of high-level message sequence charts: closing the gaps

DOI10.1016/J.TCS.2003.08.002zbMath1070.68091OpenAlexW2079013910MaRDI QIDQ1884911

Markus Lohrey

Publication date: 27 October 2004

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

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

zbMATH Keywords

ComplexityVerificationMessage sequence charts

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Timed runtime monitoring for multiparty conversations ⋮ Unnamed Item ⋮ Message-passing automata are expressively equivalent to EMSO logic

Cites Work

• On Communicating Finite-State Machines
• Notes on finite asynchronous automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Realizability of high-level message sequence charts: closing the gaps