Interpreting message flow graphs
From MaRDI portal
Publication:1904641
DOI10.1007/BF01211629zbMATH Open0838.68075MaRDI QIDQ1904641FDOQ1904641
Authors: Peter B. Ladkin, Stefan Leue 
Publication date: 27 May 1996
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Recommendations
[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
Cites Work
- Title not available (Why is that?)
- The Esterel synchronous programming language: Design, semantics, implementation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Temporal logic can be more expressive
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recognizing safety and liveness
- Temporal logic and applications—a tutorial
- Synchronous programming with events and relations: The SIGNAL language and its semantics
- Hybrid dynamical systems theory and the Signal language
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- Title not available (Why is that?)
- Verifying temporal properties without temporal logic
- Title not available (Why is that?)
- Interpreting message flow graphs
- Formal definition and representation of interaction points
- Title not available (Why is that?)
Cited In (7)
- SMT-based scenario verification for hybrid systems
- Checking MSC specifications for timing inconsistency
- Interpreting message flow graphs
- A semantics for timed MSC
- A semantics of sequence diagrams.
- A theory of regular MSC languages
- Message sequence charts in the development process -- roles and limitations
Uses Software
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)
