The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Minimum Flow and Transitive Reduction
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Pattern Matching and Membership for Hierarchical Message Sequence Charts
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Deciding Properties for Message Sequence Charts
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Move Rules and Trade-Offs in the Pebble Game
Proceedings of the 4th GI-Conference on Theoretical Computer Science
On implementation of global concurrent systems with local asynchronous controllers
CONCUR 2005 - Concurrency Theory
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
Mixing Lossy and Perfect Fifo Channels
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Quantifying the discord: order discrepancies in message sequence charts
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
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
Constructing exponential-size deterministic zielonka automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Compositional message sequence charts (CMSCs) are better to implement than MSCs
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
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
Reachability analysis of communicating pushdown systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Event clock message passing automata: a logical characterization and an emptiness checking algorithm
Formal Methods in System Design
| Hi-index | 0.00 |
Message sequence charts (MSCs) and high-level message sequence charts (HMSCs) are popular formalisms for the specification of communication protocols between asynchronous processes. An important concept in this context is the size of the communication buffers used between processes. Since real systems impose limitations on the capacity (or speed) of communication links, we ask whether a given HMSC can be implemented with respect to a given buffer size imposed by the environment. We introduce four different measures for buffer sizes and investigate for each of these measures the complexity of deciding whether a given MSC (or HMSC, or nested MSC) satisfies a given bound on the buffer size. The complexity of these problems varies between the classes P, NP, and coNP.