Markus Latte

According to our database, Markus Latte authored at least 9 papers between 2010 and 2021.

Collaborative distances:

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

2021

Branching-time logics and fairness, revisited.

Markus Latte

Math. Struct. Comput. Sci., 2021

2015

Definability by Weakly Deterministic Regular Expressions with Counters is Decidable.

Markus Latte, Matthias Niewerth

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Branching-time logics with path relativisation.

Markus Latte, Martin Lange

J. Comput. Syst. Sci., 2014

2013

Satisfiability Games for Branching-Time Logics.

Oliver Friedmann, Markus Latte, Martin Lange

Log. Methods Comput. Sci., 2013

2012

Branching Time? Pruning Time!

Markus Latte, Martin Lange

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011

Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages

Markus Latte

Proceedings of Second International Symposium on Games, 2011

2010

A CTL-Based Logic for Program Abstractions.

Martin Lange, Markus Latte

Proceedings of the Logic, 2010

Extended Computation Tree Logic.

Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

A Decision Procedure for CTL^* Based on Tableaux and Automata.

Oliver Friedmann, Markus Latte, Martin Lange

Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010