Pattern matching and membership for hierarchical message sequence charts

DOI10.1007/S00224-007-9054-1zbMath1140.68038OpenAlexW4300790099MaRDI QIDQ927396

Blaise Genest, Anca Muscholl

Publication date: 6 June 2008

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9054-1

zbMATH Keywords

ComplexityMSCHierarchical specifications

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS ⋮ The complexity of compressed membership problems for finite automata ⋮ COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA

Cites Work

• Statecharts: a visual formalism for complex systems
• Efficient solution of some problems in free partially commutative monoids
• Foundations of Software Science and Computation Structures
• Uniqueness Theorems for Periodic Functions
• The complexity of satisfiability problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pattern matching and membership for hierarchical message sequence charts