A hierarchy of implementable MSC languages

Authors:
Benedikt Bollig;Martin Leucker
Affiliations:
Lehrstuhl für Informatik II, RWTH Aachen, Germany;Institut für Informatik, TU Munich, Germany
Venue:
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Year:
2005

Citing 9
Cited 0

Inference of message sequence charts

Proceedings of the 22nd international conference on Software engineering
Regular Collections of Message Sequence Charts

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Infinite-State High-Level MSCs: Model-Checking and Realizability

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Further Step towards a Theory of Regular MSC Languages

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Recognizable Sets of Message Sequence Charts

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
A Trace Consistent Subset of PTL

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Regular sets of infinite message sequence charts

Information and Computation
A theory of regular MSC languages

Information and Computation
A kleene theorem for a class of communicating automata with effective algorithms

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a unifying theory of message-passing automata (MPAs) and MSC languages. We study several variants of regular as well as product MSC languages, their closure under finite union and their intersection. Furthermore, we analyse the expressive power of several variants of MPAs and characterize the language classes of interest by the corresponding classes of MPAs.