The mathematics of Petri nets
Inference of message sequence charts
Proceedings of the 22nd international conference on Software engineering
The Book of Traces
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Regular Collections of Message Sequence Charts
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Realizability and Verification of MSC Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The "Last" Decision Problem for Rational Trace Languages
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
HMSCs as Partial Specifications ... with PNs as Completions
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Model Checking of Message Sequence Charts
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Matching Specifications for Message Sequence Charts
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Synthesizing Distributed Finite-State Systems from MSCs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Extending Compositional Message Sequence Graphs
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Infinite-State High-Level MSCs: Model-Checking and Realizability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Safe Realizability of High-Level Message Sequence Charts
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Regular Sets of Pomsets with Autoconcurrency
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Regular sets of infinite message sequence charts
Information and Computation
Realizability of high-level message sequence charts: closing the gaps
Theoretical Computer Science
Realizability and verification of MSC graphs
Theoretical Computer Science - Automata, languages and programming
Infinite-state high-level MSCs: Model-checking and realizability
Journal of Computer and System Sciences
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Pomset Languages of Finite Step Transition Systems
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Causal Message Sequence Charts
Theoretical Computer Science
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Replaying play in and play out: synthesis of design models from scenarios by learning
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Products of message sequence charts
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
The synthesis problem of netcharts
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
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
A hierarchy of implementable MSC languages
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Global and local testing from Message Sequence Charts
Proceedings of the 27th Annual ACM Symposium on Applied Computing
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Local testing of message sequence charts is difficult
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Causal message sequence charts
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
High-level Message Sequence Charts are a well-established formalism to specify scenarios of communications in telecommunication protocols. In order to deal with possibly unbounded specifications, we focus on star-connected HMSCs. We relate this subclass with recognizability and MSO-definability by means of a new connection with Mazurkiewicz traces. Our main result is that we can check effectively whether a star-connected HMSC is realizable by a finite system of communicating automata with possibly unbounded channels.