scientific article; zbMATH DE number 1927562
From MaRDI portal
Publication:4484487
zbMath1012.68525MaRDI QIDQ4484487
Publication date: 12 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210177.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Realizability of high-level message sequence charts: closing the gaps ⋮ Pattern matching and membership for hierarchical message sequence charts ⋮ Realisability of pomsets ⋮ Realizability and verification of MSC graphs ⋮ Infinite-state high-level MSCs: model-checking and realizability
This page was built for publication:
