Interpreting message flow graphs
type: Item
instance of: scholarly article
title: Interpreting message flow graphs
zbMATH Open document ID: 0838.68075
DOI: 10.1007/BF01211629
author: Peter B. Ladkin
author: Stefan Leue
published in: Formal Aspects of Computing
publication date: 1996-05-27T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 829874
zbMATH Keywords: message flow graphs
zbMATH Keywords: Büchi automaton
describes a project that uses: Esterel
MaRDI profile type: Publication
cites work: Recognizing safety and liveness
cites work: Verifying temporal properties without temporal logic
cites work: The Esterel synchronous programming language: Design, semantics, implementation
cites work: Hybrid dynamical systems theory and the Signal language
cites work: Synchronous programming with events and relations: The SIGNAL language and its semantics
cites work: Formal definition and representation of interaction points
cites work: Temporal logic and applications—a tutorial
cites work: Using partial orders for the efficient verification of deadlock freedom and safety properties
cites work: Q3777424
cites work: Q3997282
cites work: Q3771629
cites work: Q3992568
cites work: Q4002642
cites work: Q4292252
cites work: Q4835262
cites work: Q3995087
cites work: Q4319638
cites work: Q4698335
cites work: Temporal logic can be more expressive
Recommended article: Q4474224
Recommended article: Q3489466
Recommended article: Q2769610
Recommended article: Lectures on Concurrency and Petri Nets
Recommended article: The Theory of Message Sequence Charts
Recommended article: Q4428292
description: scientific article; zbMATH DE number 829874