Interpreting message flow graphs

DOI10.1007/BF01211629zbMath0838.68075MaRDI QIDQ1904641

Stefan Leue, Peter B. Ladkin

Publication date: 27 May 1996

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

Büchi automatonmessage flow graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Related Items (7)

Interpreting message flow graphs ⋮ SMT-based scenario verification for hybrid systems ⋮ Message Sequence Charts in the Development Process — Roles and Limitations ⋮ A Semantics for Timed MSC ⋮ A theory of regular MSC languages ⋮ A semantics of sequence diagrams. ⋮ Checking MSC specifications for timing inconsistency

Uses Software

• Esterel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognizing safety and liveness
• Synchronous programming with events and relations: The SIGNAL language and its semantics
• The Esterel synchronous programming language: Design, semantics, implementation
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Interpreting message flow graphs
• Temporal logic can be more expressive
• Hybrid dynamical systems theory and the Signal language
• Verifying temporal properties without temporal logic
• Temporal logic and applications—a tutorial
• Formal definition and representation of interaction points

This page was built for publication: Interpreting message flow graphs