A kleene theorem for a class of communicating automata with effective algorithms

Authors:
Blaise Genest;Anca Muscholl;Dietrich Kuske
Affiliations:
LIAFA, Université Paris 7, France;LIAFA, Université Paris 7, France;Institut für Algebra, Technische Universität Dresden, Germany
Venue:
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Year:
2004

Citing 19
Cited 10

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
The Book of Traces

The Book of Traces
Verifying lossy channel systems has nonprimitive recursive complexity

Information Processing Letters
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Specification and Verification of Message Sequence Charts

FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Infinite-State High-Level MSCs: Model-Checking and Realizability

ICALP '02 Proceedings of the 29th 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
Compositional Message Sequence Charts

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Recognizable Sets of Message Sequence Charts

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking of Message Sequence Charts

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Beyond Message Sequence Graphs

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical 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
Bounded MSC communication

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
Message-passing automata are expressively equivalent to EMSO logic

Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Unfolding synthesis of asynchronous automata

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Matching scenarios with timing constraints

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
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
Causal closure for MSC languages

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Communicating timed automata: the more synchronous, the more difficult to verify

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
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
On the expressiveness of asynchronous cellular automata

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existential bounded communication of a communicating finite-state machine means that runs can be scheduled in such a way that message channels are always bounded in size by a value that depends only on the machine. This notion leads to regular sets of representative executions, which allows to get effective algorithms. We show in this paper the equivalence of several formalisms over existentially bounded models: monadic second order logic, communicating automata and globally-cooperative compositional MSC-graphs.