Semirings and formal power series: their relevance to formal languages and automata
Handbook of formal languages, vol. 1
The Kleene-Schützenberger theorem for formal power series in partially commuting variables
Information and Computation
Asynchronous cellular automata for promsets
Theoretical Computer Science
The Book of Traces
Emptiness Is Decidable for Asynchronous Cellular Machines
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Finite-state transducers in language and speech processing
Computational Linguistics
Recognizing ?-regular Languages with Probabilistic Automata
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Weighted tree automata and weighted logics
Theoretical Computer Science
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Weighted picture automata and weighted logics
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Weighted asynchronous cellular automata
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Weighted automata and weighted logics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the expressiveness of asynchronous cellular automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
MSO logics for weighted timed automata
Formal Methods in System Design
Models for quantitative distributed systems and multi-valued logics
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Weighted automata and multi-valued logics over arbitrary bounded lattices
Theoretical Computer Science
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
| Hi-index | 0.00 |
We provide a model of weighted distributed systems and give a logical characterization thereof. Distributed systems are represented as weighted asynchronous cellular automata. Running over directed acyclic graphs, Mazurkiewicz traces, or (lossy) message sequence charts, they allow for modeling several communication paradigms in a unifying framework, among them probabilistic shared-variable and probabilistic lossy-channel systems. We show that any such system can be described by a weighted existential MSO formula and, vice versa, any formula gives rise to a weighted asynchronous cellular automaton.