Realizability and verification of MSC graphs

DOI10.1016/j.tcs.2004.09.034zbMath1088.68097OpenAlexW2151369927MaRDI QIDQ1770427

Kousha Etessami, Mihalis Yannakakis, Rajeev Alur

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/cis_papers/94

zbMATH Keywords

Software specificationFormal verificationMessage sequence charts

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (13)

On deciding synchronizability for asynchronously communicating systems ⋮ Timed runtime monitoring for multiparty conversations ⋮ Branching Pomsets for Choreographies ⋮ Branching pomsets: design, expressiveness and applications to choreographies ⋮ Quantifying the Discord: Order Discrepancies in Message Sequence Charts ⋮ Unnamed Item ⋮ QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS ⋮ Infinite-state high-level MSCs: model-checking and realizability ⋮ Synthesis of Safe Message-Passing Systems ⋮ Realizable temporal logics for web service choreography ⋮ A centralized and a decentralized method to automatically derive choreography-conforming web service systems ⋮ A Calculus of Global Interaction based on Session Types ⋮ Checking MSC specifications for timing inconsistency

Cites Work

• Membership problems for regular and context-free trace languages
• The complexity of satisfiability problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Realizability and verification of MSC graphs