scientific article; zbMATH DE number 1418329

zbMath0955.68084MaRDI QIDQ4941891

Doron A. Peled, Anca Muscholl

Publication date: 19 March 2000

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

zbMATH Keywords

message sequence chartscommunication protocols

Mathematics Subject Classification ID

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

Related Items (22)

Realizability of concurrent recursive programs ⋮ Bounded MSC communication ⋮ Realizability of high-level message sequence charts: closing the gaps ⋮ Regular sets of infinite message sequence charts ⋮ Causal message sequence charts ⋮ Permutation rewriting and algorithmic verification ⋮ Quantitative Analysis of Communication Scenarios ⋮ Quantifying the Discord: Order Discrepancies in Message Sequence Charts ⋮ Knapsack in graph groups ⋮ Regular set of representatives for time-constrained MSC graphs ⋮ Pattern matching and membership for hierarchical message sequence charts ⋮ Diagnosis from scenarios ⋮ Realizability and verification of MSC graphs ⋮ Infinite-state high-level MSCs: model-checking and realizability ⋮ A Kleene theorem and model checking algorithms for existentially bounded communicating automata ⋮ Message-passing automata are expressively equivalent to EMSO logic ⋮ Realizability of Concurrent Recursive Programs ⋮ Weighted asynchronous cellular automata ⋮ Specification and Verification using Message Sequence Charts ⋮ A theory of regular MSC languages ⋮ Bounded time-stamping in message-passing systems ⋮ Checking conformance for time-constrained scenario-based specifications

This page was built for publication: