output
19932026
most citedpandapower - an Open Source Python Tool for Convenient Modeling, Analysis and Optimization of Electric Power Systems

1.2k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.LOShow all

15 papers · 1 filter

cs.LO2026

Capturing Bisimulation-Invariant Exponential-Space Complexity Classes

Florian Bruse, David Kronenberger, Martin Lange

Otto's Theorem characterises the bisimulation-invariant PTIME queries over graphs as exactly those that can be formulated in the polyadic mu-calculus. This extends to a characteris…

cs.LO2025

Characterizing the Exponential-Space Hierarchy Via Partial Fixpoints

Florian Bruse, David Kronenberger, Martin Lange

The characterization of PSPACE-queries over ordered structures as exactly those expressible in first-order logic with partial fixpoints (Vardi'82) is one of the classical results i…

cs.LO2022

Capturing Bisimulation-Invariant Exponential-Time Complexity Classes

Florian Bruse, David Kronenberger, Martin Lange

Otto's Theorem characterises the bisimulation-invariant PTIME queries over graphs as exactly those that can be formulated in the polyadic mu-calculus, hinging on the Immerman-Vardi…

cs.LO2021

Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics

Eric Alsmann, Florian Bruse, Martin Lange

We investigate the expressive power of the two main kinds of program logics for complex, non-regular program properties found in the literature: those extending propositional dynam…

cs.LO2020

Local Higher-Order Fixpoint Iteration

Florian Bruse, Jörg Kreiker, Martin Lange +1

Local fixpoint iteration describes a technique that restricts fixpoint iteration in function spaces to needed arguments only. It has been studied well for first-order functions in…

cs.LO2018★ 13 cited

The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs

Arno Ehle, Norbert Hundeshagen, Martin Lange

The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic. Form…

cs.LO2016

A Canonical Model Construction for Iteration-Free PDL with Intersection

Florian Bruse, Daniel Kernberger, Martin Lange

We study the axiomatisability of the iteration-free fragment of Propositional Dynamic Logic with Intersection and Tests. The combination of program composition, intersection and te…

cs.LO2016★ 2 cited

Alternation Is Strict For Higher-Order Modal Fixpoint Logic

Florian Bruse

We study the expressive power of Alternating Parity Krivine Automata (APKA), which provide operational semantics to Higher-Order Modal Fixpoint Logic (HFL). APKA consist of ordinar…

cs.LO2015★ 1 cited

The Arity Hierarchy in the Polyadic -Calculus

Martin Lange

The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynom…

cs.LO2014★ 12 cited

The Fixpoint-Iteration Algorithm for Parity Games

Florian Bruse, Michael Falk, Martin Lange

It is known that the model checking problem for the modal mu-calculus reduces to the problem of solving a parity game and vice-versa. The latter is realised by the Walukiewicz form…

cs.LO2013★ 7 cited

Satisfiability Games for Branching-Time Logics

Oliver Friedmann, Martin Lange, Markus Latte

The satisfiability problem for branching-time temporal logics like CTL*, CTL and CTL+ has important applications in program specification and verification. Their computational comp…

cs.LO2012★ 2 cited

The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity

Julian Gutierrez, Felix Klaedtke, Martin Lange

It is known that the alternation hierarchy of least and greatest fixpoint operators in the mu-calculus is strict. However, the strictness of the alternation hierarchy does not nece…

cs.LO2012★ 1 cited

Model-Checking Process Equivalences

Martin Lange, Etienne Lozes, Manuel Vargas Guzmán

Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic…

cs.LO2012★ 5 cited

Model-Checking the Higher-Dimensional Modal mu-Calculus

Martin Lange, Etienne Lozes

The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property tha…

cs.LO2010★ 8 cited

Extended Computation Tree Logic

Roland Axelsson, Matthew Hague, Stephan Kreutzer +2

We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may…