Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Theoretical Computer Science
Symbolic Verification of Communication Protocols with Infinite StateSpaces using QDDs
Formal Methods in System Design
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Well-structured transition systems everywhere!
Theoretical Computer Science
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Infinite-State High-Level MSCs: Model-Checking and Realizability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Recognizable Sets of Message Sequence Charts
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The Power of QDDs (Extended Abstract)
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Regular sets of infinite message sequence charts
Information and Computation
Information and Computation
Realizability of Concurrent Recursive Programs
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
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
Automata and logics for timed message sequence charts
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Propositional dynamic logic for message-passing systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Optimal Zielonka-type construction of deterministic asynchronous automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Taming distributed asynchronous systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Compositional synthesis of asynchronous automata
Theoretical Computer Science
SMA: the smyle modeling approach
CEE-SET'08 Proceedings of the Third IFIP TC 2 Central and East European conference on Software engineering techniques
Constructing exponential-size deterministic zielonka automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Analysis of communicating automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Reachability analysis of communicating pushdown systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Regular set of representatives for time-constrained MSC graphs
Information Processing Letters
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
Propositional dynamic logic with converse and repeat for message-passing systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A protocol development framework for SLA negotiations in cloud and service computing
GECON'12 Proceedings of the 9th international conference on Economics of Grids, Clouds, Systems, and Services
Event clock message passing automata: a logical characterization and an emptiness checking algorithm
Formal Methods in System Design
Note: A quadratic construction for Zielonka automata with acyclic communication structure
Theoretical Computer Science
Hi-index | 0.00 |
The behavior of a network of communicating automata is called existentially bounded if communication events can be scheduled in such a way that the number of messages in transit is always bounded by a value that depends only on the machine, not the run itself. We show a Kleene theorem for existentially bounded communicating automata, namely the equivalence between communicating automata, globally cooperative compositional message sequence graphs, and monadic second order logic. Our characterization extends results for universally bounded models, where for each and every possible scheduling of communication events, the number of messages in transit is uniformly bounded. As a consequence, we give solutions in spirit of Madhusudan (2001) for various model checking problems on networks of communicating automata that satisfy our optimistic restriction.