scientific article; zbMATH DE number 2086660

zbMath1057.68625MaRDI QIDQ4737197

Helmut Seidl, Anca Muscholl, Blaise Genest, Marc Zeitoun

Publication date: 11 August 2004

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

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (8)

Realizability of high-level message sequence charts: closing the gaps ⋮ Regular sets of infinite message sequence charts ⋮ Propositional Dynamic Logic for Message-Passing Systems ⋮ Pattern matching and membership for hierarchical 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

This page was built for publication: