Ingmar Meinecke: Publications

Please contact me if you have trouble downloading the files.

Books & book chapters

• I. Fichtner, D. Kuske, and I. Meinecke. Traces, Series-Parallel Posets, and Pictures: A Weighted Study.
  In M. Droste, W. Kuich, and H. Vogler, editors, Handbook of Weighted Automata. Springer, 2009.

Fully refereed papers

• M. Droste and I. Meinecke. Weighted Automata and Regular Expressions over Valuation Monoids.
  Intern. J. of Foundations of Comp. Science, 22(8): 1829-1844, 2011.
  electronic edition
  

• D. Kuske and I. Meinecke. Construction of Tree Automata from Regular Expressions.
  RAIRO-Theor. Inf. Appl., 45(3): 347-370, 2011.
  

• B. Bollig, D. Kuske, and I. Meinecke. Propositional Dynamic Logic for Message-Passing Systems.
  Logical Methods in Computer Science, 6(3): 1-31, 2010.
  electronic edition
  

• I. Meinecke. The Hadamard Product of Sequential-Parallel Series.
  Journal of Automata, Languages and Combinatorics, Special issue "Selected papers of the workshop Weighted Automata: Theory and Applications (Dresden, June 1-5 2004)", 10(2/3): 313-346, 2005.

• D. Kuske and I. Meinecke. Branching automata with costs - a way of reflecting parallelism in costs.
  Theoretical Computer Science 328: 53-75, 2004.
  electronic edition
  

• F. Bracho, M. Droste, and I. Meinecke. On minimal event and concrete data structures.
  In: "Domain Theory, Logic and Computations" (eds. J. Lawson, G.-Q. Zhang, Y.-M. Liu, M.-K. Luo), Semantic Structures in Computation, vol. 3, Kluwer Academic Publ., 2003, pp. 161 - 178.
  buy proceedings, pdf, TR
  

Refereed conference papers

• I. Meinecke. Valuations of weighted automata: Doing it in a rational way.
  In: W. Kuich, G. Rahonis (eds.). "Algebraic Foundations in Computer Science", Lecture Notes in Computer Sciences, vol. 7020, Springer, 2011, pp. 309-346.
  

• M. Droste, D. Götze, S. Märcker, I. Meinecke. Weighted tree automata over valuation monoids and their characterizations by weighted logics.
  In: W. Kuich, G. Rahonis (eds.). "Algebraic Foundations in Computer Science", Lecture Notes in Computer Sciences, vol. 7020, Springer, 2011, pp. 30-55.
  

• M. Droste, I. Meinecke, B. Seselja, and A. Tepavcevic. A cascade decomposition of weighted finite transition systems.
  In: "Non-Classical Models of Automata and Applications (NCMA 2011)", Österreichische Computer Gesellschaft, 2011, pp. 137-152.
  Abstract in: G. Mauri and A. Leporati (eds.). "Developments in Language Theory (DLT 2011)", Lecture Notes in Computer Science, vol. 6795, Springer, 2011, pp. 472-473.
  

• M. Droste and I. Meinecke. Regular expressions on average and in the long run.
  In: "International Conference on Implementation and Application of Automata (CIAA 2010)", Lecture Notes in Computer Science, vol. 6482, Springer, 2011, pp. 211-221.
  

• M. Droste and I. Meinecke. Describing average- and longtime-behavior by weighted MSO logics.
  In: "Mathematical Foundations of Computer Science (MFCS 2010)", Lecture Notes in Computer Science, vol. 6281, Springer, 2010, pp. 537-548.
  

• I. Meinecke. A weighted mu-calculus on words.
  In: "Developments in Language Theory (DLT 2009)", Lecture Notes in Computer Science, vol. 5583, Springer, 2009, pp. 384-395.
  Springer link, pdf
  

• D. Kuske and I. Meinecke. Construction of tree automata from regular expressions.
  In: "Developments in Language Theory (DLT 2008)", Lecture Notes in Computer Science, vol. 5257, Springer, 2008, pp. 491-503.
  Springer link, pdf
  

• B. Bollig, D. Kuske, and I. Meinecke. Propositional Dynamic Logic for Message-Passing Systems.
  In: " Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2007)", Lecture Notes in Computer Science, vol. 4855, Springer, 2007, pp. 303-315.
  Springer link, pdf
  

• B. Bollig and I. Meinecke. Weighted Distributed Systems and Their Logics.
  In: "Symposium on Logical Foundations of Computer Science (LFCS 2007)", Lecture Notes in Computer Science, vol. 4514, Springer, 2007, pp. 54-68.
  Springer link, pdf
  

• I. Meinecke. Weighted Logics for Traces.
  In: "Computer Science - Theory and Applications: First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg", Lecture Notes in Computer Science, vol. 3967, Springer, 2006, pp. 235-246.
  Springer link, pdf
  

• D. Kuske and I. Meinecke. Branching automata with costs - a way of reflecting parallelism in costs.
  In: "Proc. of CIAA 2003", Lecture Notes in Computer Science, vol. 2759, Springer, 2003, pp. 150-162.
  Springer link, pdf
  

PhD thesis

• I. Meinecke. Weighted Branching Automata - Combininig Concurrency and Weights. Dissertation, Technische Universität Dresden, 2004.
  

Master thesis

• I. Meinecke. Von konkreten Bereichen zu konkreten Datenstrukturen. Diplomarbeit, Technische Universität Dresden, Institut für Algebra, 2000.