Publication:4941891
From MaRDI portal
zbMath0955.68084MaRDI QIDQ4941891
Publication date: 19 March 2000
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Permutation rewriting and algorithmic verification, Pattern matching and membership for hierarchical message sequence charts, Realizability and verification of MSC graphs, Bounded time-stamping in message-passing systems, Bounded MSC communication, Realizability of high-level message sequence charts: closing the gaps, Regular sets of infinite message sequence charts, 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, A theory of regular MSC languages, Quantifying the Discord: Order Discrepancies in Message Sequence Charts, Realizability of Concurrent Recursive Programs