Interpreting message flow graphs

DOI10.1007/BF01211629MaRDI QIDQ1904641zbMATH OpenFDO

Authors Peter B. Ladkin, Stefan Leue

Publication date 27 May 1996

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

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=B%EF%BF%BD%EF%BF%BDchi+automaton&go=Go B��chi automaton]message flow graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2081110
• Publication:3489466
• scientific article; zbMATH DE number 1701776
• Lectures on Concurrency and Petri Nets
• The theory of message sequence charts
• scientific article; zbMATH DE number 1980918

Cites work

• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 42431 (Why is no real title available?)
• scientific article; zbMATH DE number 48402 (Why is no real title available?)
• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• scientific article; zbMATH DE number 579921 (Why is no real title available?)
• scientific article; zbMATH DE number 710624 (Why is no real title available?)
• scientific article; zbMATH DE number 755678 (Why is no real title available?)
• scientific article; zbMATH DE number 763725 (Why is no real title available?)
• Formal definition and representation of interaction points
• Hybrid dynamical systems theory and the Signal language
• Interpreting message flow graphs
• Recognizing safety and liveness
• Synchronous programming with events and relations: The SIGNAL language and its semantics
• Temporal logic and applications—a tutorial
• Temporal logic can be more expressive
• The Esterel synchronous programming language: Design, semantics, implementation
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Verifying temporal properties without temporal logic

Cited in

(7)

• Checking MSC specifications for timing inconsistency
• A semantics for timed MSC
• A theory of regular MSC languages
• Message sequence charts in the development process -- roles and limitations
• A semantics of sequence diagrams.
• SMT-based scenario verification for hybrid systems
• Interpreting message flow graphs

Describes a project that uses

Uses Software

• Esterel

This page was built for publication: Interpreting message flow graphs

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