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
The Book of Traces
Languages and Logical Definability in Concurrency Monoids
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Weighted asynchronous cellular automata
Theoretical Computer Science
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Weighted Distributed Systems and Their Logics
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Weighted versus Probabilistic Logics
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Handbook of Weighted Automata
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Describing average- and longtime-behavior by weighted MSO logics
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Weighted tree automata over valuation monoids and their characterization by weighted logics
Algebraic Foundations in Computer Science
Weighted automata and weighted MSO logics for average and long-time behaviors
Information and Computation
| Hi-index | 0.00 |
We investigate weighted asynchronous cellular automata with weights in valuation monoids. These automata form a distributed extension of weighted finite automata and allow us to model concurrency. Valuation monoids are abstract weight structures that include semirings and (non-distributive) bounded lattices but also offer the possibility to model average behaviors. We prove that weighted asynchronous cellular automata and weighted finite automata which satisfy an I-diamond property are equally expressive. The main result of this paper gives a characterization of this expressiveness by weighted MSO logics.