Realizability and verification of MSC graphs
type: Item
instance of: scholarly article
title: Realizability and verification of MSC graphs
zbMATH Open document ID: 1088.68097
author: Rajeev Alur
author: Kousha Etessami
author: Mihalis Yannakakis
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
full work available at URL: https://repository.upenn.edu/cis_papers/94
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2153219
zbMATH Keywords: Formal verification
zbMATH Keywords: Software specification
zbMATH Keywords: Message sequence charts
MaRDI profile type: Publication
OpenAlex ID: W2151369927
cites work: Membership problems for regular and context-free trace languages
cites work: Q2754187
cites work: Q4484487
cites work: Q4736868
cites work: Q4941891
cites work: The complexity of satisfiability problems
DOI: 10.1016/J.TCS.2004.09.034
Recommended article: Q4535063
Recommended article: Realizability of graph specifications: characterizations and algorithms
Recommended article: Realizability of graphs
Recommended article: Realizability of Graphs and Linkages
Recommended article: Practical algorithms for MSO model-checking on tree-decomposable graphs
Recommended article: Realizability Criteria for Compositional MSC
Recommended article: Q5190778
Recommended article: Realizability of fault-tolerant graphs
Recommended article: Realizability and uniqueness in graphs
description: scientific article; zbMATH DE number 2153219