Results 11 to 20 of about 35,955 (232)
A Hierarchy of Communication Models for Message Sequence Charts [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M A Reniers
exaly +6 more sources
An Algebraic Semantics of Basic Message Sequence Charts [PDF]
Message Sequence Charts are a widely used technique for the visualization of the communications between system components. We present a formal semantics of Basic Message Sequence Charts, exploiting techniques from process algebra. This semantics is based on the semantics of the full language as being proposed for standardization in the International ...
M A Reniers
exaly +3 more sources
Asynchronous Multiparty Session Type Implementability is Decidable - Lessons Learned from Message Sequence Charts [PDF]
Multiparty session types (MSTs) provide efficient means to specify and verify asynchronous message-passing systems. For a global type, which specifies all interactions between roles in a system, the implementability problem asks whether there are local ...
F. Stutz
semanticscholar +1 more source
Comparing Channel Restrictions of Communicating State Machines, High-level Message Sequence Charts, and Multiparty Session Types [PDF]
Communicating state machines provide a formal foundation for distributed computation. Unfortunately, they are Turing-complete and, thus, challenging to analyse.
F. Stutz, D. Zufferey
semanticscholar +1 more source
Realisability of Pomsets via Communicating Automata [PDF]
Pomsets are a model of concurrent computations introduced by Pratt. They can provide a syntax-oblivious description of semantics of coordination models based on asynchronous message-passing, such as Message Sequence Charts (MSCs). In this paper, we study
Roberto Guanciale Dr, Emilio Tuosto Dr
doaj +1 more source
Causal Message Sequence Charts [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gazagnaire, Thomas +4 more
openaire +4 more sources
Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems [PDF]
The model checking problem for propositional dynamic logic (PDL) over message sequence charts (MSCs) and communicating finite state machines (CFMs) asks, given a channel bound $B$, a PDL formula $\varphi$ and a CFM $\mathcal{C}$, whether every ...
Roy Mennicke
doaj +1 more source
Compositional Message Sequence Charts [PDF]
A message sequence chart (MSC) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication protocols. MSCs enjoy both a visual and a textual representation. High-level MSCs (HMSCs) allow specifying infinite scenarios and different choices.
Elsa L. Gunter +2 more
openaire +1 more source
Propositional Dynamic Logic for Message-Passing Systems [PDF]
We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an event.
Benedikt Bollig +2 more
doaj +1 more source

