Mikkel L. Pedersen

According to our database, Mikkel L. Pedersen authored at least 8 papers between 2010 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2013

Abstract Probabilistic Automata.

Benoît Delahaye, Joost-Pieter Katoen, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Falak Sher, Andrzej Wasowski

Inf. Comput., 2013

2012

New results for Constraint Markov Chains.

Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski

Perform. Evaluation, 2012

Consistency and refinement for Interval Markov Chains.

Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski

J. Log. Algebraic Methods Program., 2012

2011

Constraint Markov Chains.

Benoît Caillaud, Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski

Theor. Comput. Sci., 2011

APAC: A Tool for Reasoning about Abstract Probabilistic Automata.

Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski

Proceedings of the Eighth International Conference on Quantitative Evaluation of Systems, 2011

Decision Problems for Interval Markov Chains.

Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski

Proceedings of the Language and Automata Theory and Applications, 2011

New Results on Abstract Probabilistic Automata.

Benoît Delahaye, Joost-Pieter Katoen, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Falak Sher, Andrzej Wasowski

Proceedings of the 11th International Conference on Application of Concurrency to System Design, 2011

2010

Compositional Design Methodology with Constraint Markov Chains.

Benoît Caillaud, Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski

Proceedings of the QEST 2010, 2010