scientific article; zbMATH DE number 1954389

MaRDI QIDQ4415260zbMATH OpenFDO

Authors Martin Leucker, Parthasarathy Madhusudan, Supratik Mukhopadhyay

Publication date 28 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2556/25560253.htm

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2081110
• The theory of message sequence charts
• Realizability of Dynamic MSC Languages
• A hierarchy of communication models for message sequence charts
• scientific article; zbMATH DE number 1754636

Cited in

(12)

• An automaton over data words that captures EMSO logic
• Causal Message Sequence Charts
• scientific article; zbMATH DE number 2081110 (Why is no real title available?)
• scientific article; zbMATH DE number 1754636 (Why is no real title available?)
• The theory of message sequence charts
• Dynamic communicating automata and branching high-level MSCs
• Foundations of Software Science and Computation Structures
• CONCUR 2004 - Concurrency Theory
• Local Testing of Message Sequence Charts Is Difficult
• Propositional Dynamic Logic for Message-Passing Systems
• Lectures on Concurrency and Petri Nets
• Causal message sequence charts

This page was built for publication:

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