Models for quantitative distributed systems and multi-valued logics

References

• Bollig , B. and Gastin , P. Weighted Versus Probabilistic Logics . Proceedings of the 13th International Conference on Developments in Language Theory (DLT 2009) . Vol. 5583 , pp. 18 – 38 . Berlin : Springer . LNCS
   Google Scholar
• Bollig , B. and Meinecke , I. Weighted Distributed Systems and their Logics . Symposium on Logical Foundations of Computer Science (LFCS 2007) . Vol. 4514 , pp. 54 – 68 . Berlin : Springer . LNCS
   Google Scholar
• Büchi , J. R. 1960 . Weak second-order arithmetic and finite automata . Zeitschr. f. math. Logik und Grundlagen d. Math. , 6 : 66 – 92 . (doi:10.1002/malq.19600060105)
   Google Scholar
• Cérin , C. and Petit , A. Speedup of Recognizable Trace Languages . Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science (MFCS 1993) . Vol. 711 , pp. 332 – 341 . Berlin : Springer . LNCS
   Google Scholar
• Chatterjee , K. , Doyen , L. and Henzinger , T. A. Quantitative Languages . Proceedings of the 22nd International Workshop on Computer Science Logic (CSL 2008) . Vol. 5213 , pp. 385 – 400 . Berlin : Springer . LNCS
   Google Scholar
• Diekert , V. and Métivier , Y. 1997 . “ Partial commutation and traces ” . In Handbook of Formal Languages , Edited by: Rozenberg , G. and Salomaa , A. Vol. 3 , 457 – 533 . Berlin : Springer .
   Google Scholar
• Diekert , V. and Rozenberg , G. 1995 . The Book of Traces , Edited by: Diekert , V. and Rozenberg , G. River Edge , NJ : World Scienific Publishing .
   Google Scholar
• Droste , M. and Gastin , P. 1999 . The Kleene–Schützenberger theorem for formal power series in partially commuting variables . Inform. Comput. , 153 : 47 – 80 . (doi:10.1006/inco.1999.2799)
   Web of Science ®Google Scholar
• Droste , M. and Gastin , P. 2009 . “ Weighted automata and weighted logics ” . In Handbook of Weighted Automata , Edited by: Droste , M. , Kuich , W. and Vogler , H. 175 – 211 . Berlin : Springer .
   Google Scholar
• Droste , M. , Kuich , W. and Vogler , H. 2009 . Handbook of Weighted Automata , Edited by: Droste , M. , Kuich , W. and Vogler , H. Berlin : Springer .
   Google Scholar
• Droste , M. and Meinecke , I. Describing Average- and Longtime-Behavior by Weighted MSO Logics . Proceedings of the 35th International Conference on Mathematical Foundations of Computer Science (MFCS 2010) . Vol. 6281 , pp. 537 – 548 . Berlin : Springer . LNCS
   Google Scholar
• Droste , M. and Meinecke , I. Regular Expressions on Average and in the Long Run . Proceedings of the 15th International Conference on Implementation and Application of Automata (CIAA 2010) . Edited by: Domaratzki , M. and Salomaa , K. Vol. 6482 , pp. 211 – 221 . Berlin : Springer . Lecture Notes in Computer Science
   Google Scholar
• Droste , M. and Vogler , H. Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices . Proceedings of the Developments in Language Theory (DLT 2010) . Vol. 6224 , pp. 162 – 172 . Berlin : Springer . LNCS
   Google Scholar
• Ebinger , W. and Muscholl , A. 1996 . Logical definability on infinite traces . Theor. Comput. Sci. , 154 : 67 – 84 . (doi:10.1016/0304-3975(95)00130-1)
   Web of Science ®Google Scholar
• Elgot , C. C. 1961 . Decision problems of finite automata design and related arithmetics . Trans. Amer. Math. Soc. , 98 : 21 – 52 . (doi:10.1090/S0002-9947-1961-0139530-9)
   Google Scholar
• Fichtner , I. , Kuske , D. and Meinecke , I. 2009 . “ Traces, series-parallel posets, and pictures: A weighted study ” . In Handbook of Weighted Automata , Edited by: Droste , M. , Kuich , W. and Vogler , H. 397 – 441 . Berlin : Springer .
   Google Scholar
• Genest , B. , Kuske , D. and Muscholl , A. 2007 . On communicating automata with bounded channels . Fundamenta Informaticae , 80 : 147 – 167 .
   Web of Science ®Google Scholar
• Huschenbett , M. “ Models for quantitative distributed systems and multi-valued logics ” . Master's thesis, Universität Leipzig, 2010. Available at http://lips.informatik.uni-leipzig.de/pub/2010-12.
   Google Scholar
• Huschenbett , M. 2011 . A Kleene-Schützenberger theorem for trace series over bounded lattices . Fundamenta Informaticae , 112 : 171 – 191 .
   Web of Science ®Google Scholar
• Huschenbett , M. Models for Quantitative Distributed Systems and Multi-Valued Logics . Proceedings of the 5th International Conference on Language and Automata Theory and Applications (LATA 2011) . Vol. 6638 , pp. 310 – 322 . Berlin : Springer . LNCS
   Google Scholar
• Kleene , S. C. 1956 . “ Representation of events in nerve nets and finite automata ” . In Automata Studies , Edited by: Shannon , C. E. and McCarthy , J. 3 – 42 . Princeton , NJ : Princeton University Press . Chap. 1
   Google Scholar
• Krob , D. 1994 . The equality problem for rational series with multiplicities in the tropical semiring is undecidable . Int. J. Algebra Comput. , 4 : 405 – 425 . (doi:10.1142/S0218196794000063)
   Google Scholar
• Kupferman , O. and Lustig , Y. Lattice Automata . Proceedings of 8th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2007) . Vol. 4349 , pp. 199 – 213 . Berlin : Springer . LNCS
   Google Scholar
• Kuske , D. 2007 . Weighted asynchronous cellular automata . Theor. Comput. Sci. , 374 : 127 – 148 . (doi:10.1016/j.tcs.2006.11.031)
   Web of Science ®Google Scholar
• Kuske , D. 2009 . Weighted and unweighted trace automata . Acta Cybernetica , 19 : 393 – 410 .
   Google Scholar
• Meinecke , I. Weighted logics for traces . Proceedings of First International Symposium on Computer Science – Theory and Applications (CSR 2006), in Russia, St. Petersburg . Vol. 3976 , pp. 235 – 246 . Berlin : Springer . LNCS
   Google Scholar
• Ochmańsky , E. 1985 . Regular behaviour of concurrent systems . Bull. Eur. Assoc. Theor. Comput. Sci. (EATCS) , 27 : 56 – 67 .
   Google Scholar
• Ochmańsky , E. 1995 . “ Recognizable trace languages ” . In The Book of Traces , Edited by: Diekert , V. and Rozenberg , G. 167 – 204 . River Edge , NJ : World Scienific Publishing .
   Google Scholar
• Schützenberger , M. P. 1961 . On the definition of a family of automata . Inform. Control , 4 : 245 – 270 . (doi:10.1016/S0019-9958(61)80020-X)
   Google Scholar
• Thomas , W. 1990 . “ On logical definability of trace languages ” . 172 – 182 . ASMICS-Workshop ‘Free Partially Commutative Monoids’, Rep. TUM-I9002, TU München
   Google Scholar
• Zielonka , W. 1987 . Notes on finite asynchronus automata . RAIRO – Informatique Théoretique et Applications , 21 : 99 – 135 .
   Web of Science ®Google Scholar
• Zielonka , W. 1995 . “ Asynchronous automata ” . In The Book of Traces , Edited by: Diekert , V. and Rozenberg , G. 205 – 247 . River Edge , NJ : World Scienific Publishing .
   Google Scholar