Pattern matching and membership for hierarchical message sequence charts
From MaRDI portal
Publication:927396
DOI10.1007/s00224-007-9054-1zbMath1140.68038MaRDI QIDQ927396
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
68Q60: Specification and verification (program logics, model checking, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
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