Combinatorics on traces
Handbook of theoretical computer science (vol. B)
Asynchronous mappings and asynchronous cellular automata
Information and Computation
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Regular languages defined with generalized quantifiers
Information and Computation
Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Partial commutation and traces
Handbook of formal languages, vol. 3
Asynchronous cellular automata for promsets
Theoretical Computer Science
The Book of Traces
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
Asynchronous Cellular Automata and Asynchronous Automata for Pomsets
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Asynchronous Cellular Automata for Pomsets Without Auto-concurrency
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
An Exprssively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
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
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
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
Muller message-passing automata and logics
Information and Computation
Semantics of Deterministic Shared-Memory Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
MSO Logic for Unambiguous Shared-Memory Systems
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Causal Message Sequence Charts
Theoretical Computer Science
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Detecting races in ensembles of message sequence charts
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
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
Synthesis of safe message-passing systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Constructing exponential-size deterministic zielonka automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
The MSO theory of connectedly communicating processes
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Deciding properties of message sequence charts
SMTT'03 Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools
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
Analysis of communicating automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Causal message sequence charts
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
This paper resumes the study of regular sets of message sequence charts (MSC) initiated by Henriksen et al. [Technical Report, BRICS RS-99-52, 1999]. Differently from their results, we consider infinite MSCs. It is shown that for bounded sets of infinite MSCs, the notions of recognizability, axiomatizability in monadic second order logic, and acceptance by a deterministic message passing automaton with Muller acceptance condition coincide. We furthermore characterize the expressive power of first order logic and of its extension by modulo-counting quantifiers over bounded infinite MSCs. In order to prove our results, we exhibit a new connection to the theory of Mazurkiewicz traces using relabeling techniques.