scientific article

zbMath0978.68549MaRDI QIDQ2769610

Elsa L. Gunter, Anca Muscholl, Doron A. Peled

Publication date: 5 February 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2031/20310496

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Realizability of high-level message sequence charts: closing the gaps ⋮ Reasoning about layered message passing systems ⋮ Causal message sequence charts ⋮ Quantitative Analysis of Communication Scenarios ⋮ Realisability of pomsets ⋮ A Kleene theorem and model checking algorithms for existentially bounded communicating automata ⋮ Specification and Verification using Message Sequence Charts ⋮ Timed Semantics of Message Sequence Charts Based on Timed Automata

This page was built for publication: