Local Testing of Message Sequence Charts Is Difficult

DOI10.1007/978-3-540-74240-1_8MaRDI QIDQ5444949zbMATH OpenOpenAlexFDO

Authors Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar

Publication date 26 February 2008

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74240-1_8

Mathematics Subject Classification ID

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

Recommendations

• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Realizability and verification of MSC graphs
• scientific article; zbMATH DE number 1754635
• Causal Message Sequence Charts
• scientific article; zbMATH DE number 1954389

Cited in

(3)

• Implied scenario detection in the presence of behaviour constraints
• Low Rate Is Insufficient for Local Testability
• scientific article; zbMATH DE number 1956500 (Why is no real title available?)

This page was built for publication: Local Testing of Message Sequence Charts Is Difficult

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