Safe realizability of high-level message sequence charts

DOI10.1007/3-540-45694-5_13MaRDI QIDQ4484487zbMATH OpenFDO

Authors Markus Lohrey

Publication date 12 June 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2421/24210177.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Realizability of high-level message sequence charts: closing the gaps
• Infinite-state high-level MSCs: model-checking and realizability
• Strong Safe Realizability of Message Sequence Chart Specifications
• Realizability and verification of MSC graphs
• scientific article; zbMATH DE number 2086413

Cited in

(8)

• Realizability and verification of MSC graphs
• Realizability of high-level message sequence charts: closing the gaps
• Realisability of pomsets
• Infinite-state high-level MSCs: model-checking and realizability
• Strong Safe Realizability of Message Sequence Chart Specifications
• scientific article; zbMATH DE number 2086660 (Why is no real title available?)
• Tableaux for realizability of safety specifications
• Pattern matching and membership for hierarchical message sequence charts

This page was built for publication: Safe realizability of high-level message sequence charts

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