Weighted distributed systems and their logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4514 LNCS, Issue , 2007, Pages 54-68

  Bollig, Benedikt ^a   Meinecke, Ingmar ^b  

^a CNRS   (France)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS SEQUENTIAL LOGIC; CELLULAR AUTOMATA; COMMUNICATION; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY;

ASYNCHRONOUS CELLULAR AUTOMATA; LOGICAL CHARACTERIZATIONS; LOSSY CHANNEL SYSTEMS; WEIGHTED DISTRIBUTED SYSTEMS;

FORMAL LOGIC;

EID: 35448988045     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-72734-7_5     Document Type: Conference Paper

References (22)

1. C. Baier and M. Größer. Recognizing omega-regular languages with probabilistic automata. In Proceedings of LICS 2005. IEEE Computer Society Press, 2005.
2. B. Bollig. On the expressiveness of asynchronous cellular automata. In Proceedings of FCT 2005, volume 3623 of Lecture Notes in Comp. Sc., pages 528-539. Springer, 2005.
3. J. Büchi. Weak second order arithmetic and finite automata. Z. Math. Logik, Grundlag. Math., 5:66-62, 1960.
4. K. Culik and J. Kari. Image compression using weighted finite automata. Computer and Graphics, 17(3):305-313, 1993.
5. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
6. M. Droste and P. Gastin. The Kleene-Schützenberger theorem for formal power series in partially commuting variables. Inform, and Comp., 153:47-80, 1999.
7. M. Droste and P. Gastin. Weighted automata and weighted logics. In Proceedings of ICALP 2005, volume 3580 of Lecture Notes in Comp. Sc., pages 513-525. Springer, 2005.
8. M. Droste, P. Gastin, and D. Kuske. Asynchronous cellular automata for pomsets. Theoret. Comp. Sc., 247(1-2):1-38, 2000.
9. M. Droste and G. Rahonis. Weighted automata and weighted logics on infinite words. In 10th Int. Conf. on Developments in Language Theory (DLT), volume 4036 of Lecture Notes in Comp. Sc., pages 49-58. Springer, 2006.
10. M. Droste and H. Vogler. Weighted tree automata and weighted logics. Theoret. Comp. Sc., 366:228-247, 2006.
11. C. C. Elgot. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc., 98:21-52, 1961.
12. S. Jesi, G. Pighizzini, and N. Sabadini. Probabilistic asynchronous automata. Mathematical Systems Theory, 29(1):5-31, 1996.
13. W. Kuich. Semirings and Formal Power Series. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 9, pages 609-677. Springer, 1997.
14. D. Kuske. Emptiness is decidable for asynchronous cellular machines. In Proceedings of CONCUR 2000, volume 1877 of Lecture Notes in Comp. Sc., pages 536-551. Springer, 2000.
15. D. Kuske. Weighted asynchronous cellular automata. In Proceedings of STACS 2006, volume 3884 of Lecture Notes in Comp. Sc., pages 685-696. Springer, 2006.
16. I. Maurer. Weighted picture automata and weighted logics. In Proceedings of STACS 2006, volume 3884 of Lecture Notes in Comp. Sc., pages 313-324. Springer, 2006.
17. I. Meinecke. Weighted logics for traces. In Proceedings of CSR 2006, volume 3967 of Lecture Notes in Comp. Sc., pages 235-246. Springer, 2006.
18. M. Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2):269-311, 1997.
19. E. Ochmański. Regular behaviour of concurrent systems. Bulletin of the EATCS, 27:56-67, 1985.
20. Ph. Schnoebelen. The verification of probabilistic lossy channel systems. In Valid, of Stochastic Systems, volume 2925 of Lecture Notes in Comp. Sc., pages 445-465. Springer, 2004.
21. M.P. Schützenberger. On the definition of a family of automata. Information and Control, 4:245-270, 1961.
22. W. Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. -Informatique Théorique et Applications, 21, 1987.