Ingmar Meinecke

According to our database1, Ingmar Meinecke authored at least 17 papers between 2003 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Parameterized model checking of weighted networks.
Theor. Comput. Sci., 2014

2012
Weighted automata and weighted MSO logics for average and long-time behaviors.
Inf. Comput., 2012

2011
Construction of tree automata from regular expressions.
RAIRO Theor. Informatics Appl., 2011

Weighted Automata and Regular Expressions over Valuation Monoids.
Int. J. Found. Comput. Sci., 2011

A Cascade Decomposition of Weighted Finite Transition Systems.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Valuations of Weighted Automata: Doing It in a Rational Way.
Proceedings of the Algebraic Foundations in Computer Science, 2011

Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics.
Proceedings of the Algebraic Foundations in Computer Science, 2011

2010
Propositional Dynamic Logic for Message-Passing Systems
Log. Methods Comput. Sci., 2010

Regular Expressions on Average and in the Long Run.
Proceedings of the Implementation and Application of Automata, 2010

Describing Average- and Longtime-Behavior by Weighted MSO Logics.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
A Weighted µ-Calculus on Words.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2007
Weighted Distributed Systems and Their Logics.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

2006
Weighted Logics for Traces.
Proceedings of the Computer Science, 2006

2005
The Hadamard Product of Sequential-Parallel Series.
J. Autom. Lang. Comb., 2005

Gewichtete verzweigende Automaten.
Proceedings of the 35. Jahrestagung der Gesellschaft für Informatik, 2005

2004
Branching automata with costs - a way of reflecting parallelism in costs star.
Theor. Comput. Sci., 2004

2003
Branching Automata with Costs - A Way of Reflecting Parallelism in Costs.
Proceedings of the Implementation and Application of Automata, 2003


  Loading...