scientific article; zbMATH DE number 1754636

zbMath0986.68061MaRDI QIDQ4535064

P. Madhusudan

Publication date: 12 June 2002

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

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (8)

Quantitative Analysis of Communication Scenarios ⋮ Unnamed Item ⋮ 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 ⋮ Specification and Verification using Message Sequence Charts ⋮ A theory of regular MSC languages

This page was built for publication: