scientific article; zbMATH DE number 1927562
From MaRDI portal
Publication:4484487
zbMATH Open1012.68525MaRDI QIDQ4484487FDOQ4484487
Publication date: 12 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210177.htm
Title of this publication is not available (Why is that?)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (6)
- Tableaux for realizability of safety specifications
- Infinite-state high-level MSCs: model-checking and realizability
- Realisability of pomsets
- Realizability of high-level message sequence charts: closing the gaps
- Pattern matching and membership for hierarchical message sequence charts
- Realizability and verification of MSC graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484487)
