Strong Safe Realizability of Message Sequence Chart Specifications

DOI10.1007/978-3-540-75698-9_22zbMath1141.68480OpenAlexW4234319972MaRDI QIDQ3508538

Abdolmajid Mousavi, Armin Eberlein, Behrouz Heidari, Behrouz Homayoun Far

Publication date: 1 July 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-75698-9_22

zbMATH Keywords

emergent scenariosStrong safe realizabilitystuck states

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication: Strong Safe Realizability of Message Sequence Chart Specifications