Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Undecidable verification problems for programs with unreliable channels
Information and Computation
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
The Book of Traces
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Recognizable Sets of Message Sequence Charts
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract)
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Regular sets of infinite message sequence charts
Information and Computation
Information and Computation
A theory of regular MSC languages
Information and Computation
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)
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Quasi-Static Scheduling of Communicating Tasks
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Quasi-static scheduling of communicating tasks
Information and Computation
Models for quantitative distributed systems and multi-valued logics
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
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
| Hi-index | 0.00 |
We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels. These results rely on the theory of Mazurkiewicz traces. We investigate the question whether channel bound conditions are decidable for a given communicating finite-state machine.