Stefan Göller

61 papers A* 10A 6B 12Journal 26Unranked 6
YearRankTypeTitle / Venue / Authors
2024 J jnl
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete.
Theory Comput. Syst.
Stefan Göller, Mathieu Hilaire
2024 A conf
The AC⁰-Complexity of Visibly Pushdown Languages.
STACS
Stefan Göller, Nathan Grosshans
2023 J jnl
The AC
CoRR
Stefan Göller, Nathan Grosshans
2023 A* conf
Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete.
SODA
Stefan Göller, Pawel Parys
2021 A conf
Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete.
STACS
Stefan Göller, Mathieu Hilaire
2021 J jnl
The Reachability Problem for Two-Dimensional Vector Addition Systems with States.
J. ACM
Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
2020 A* conf
Bisimulation Finiteness of Pushdown Systems Is Elementary.
LICS
Stefan Göller, Pawel Parys
2020 J jnl
Bisimulation Finiteness of Pushdown Systems Is Elementary.
CoRR
Stefan Göller, Pawel Parys
2020 J jnl
Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete.
CoRR
Stefan Göller, Mathieu Hilaire
2019 J jnl
On Long Words Avoiding Zimin Patterns.
Theory Comput. Syst.
Arnaud Carayol, Stefan Göller
2019 J jnl
On long words avoiding Zimin patterns.
CoRR
Arnaud Carayol, Stefan Göller
2018 J jnl
The Complexity of Bisimulation and Simulation on Finite Systems.
CoRR
Moses Ganardi, Stefan Göller, Markus Lohrey
2018 J jnl
The Complexity of Bisimulation and Simulation on Finite Systems.
Log. Methods Comput. Sci.
Moses Ganardi, Stefan Göller, Markus Lohrey
2017 A conf
On Büchi One-Counter Automata.
STACS
Stanislav Böhm, Stefan Göller, Simon Halfon, Piotr Hofman
2017 A conf
On Long Words Avoiding Zimin Patterns.
STACS
Arnaud Carayol, Stefan Göller
2016 A* conf
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.
ICALP
Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke
2016 J jnl
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.
CoRR
Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke
2016 A* conf
Games with bound guess actions.
LICS
Thomas Colcombet, Stefan Göller
2016 B conf
On the Parallel Complexity of Bisimulation on Finite Systems.
CSL
Moses Ganardi, Stefan Göller, Markus Lohrey
2015 A* conf
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete.
LICS
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
2015 J jnl
The Complexity of Decomposing Modal and First-Order Theories.
ACM Trans. Comput. Log.
Stefan Göller, Jean Christoph Jung, Markus Lohrey
2014 J jnl
Bisimulation equivalence and regularity for real-time one-counter automata.
J. Comput. Syst. Sci.
Stanislav Böhm, Stefan Göller, Petr Jancar
2014 J jnl
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete.
CoRR
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
2014 J jnl
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems.
ACM Trans. Comput. Log.
Stefan Göller, Anthony Widjaja Lin
2014 J jnl
The First-Order Theory of Ground Tree Rewrite Graphs
Log. Methods Comput. Sci.
Stefan Göller, Markus Lohrey
2013 A* conf
Bisimilarity of Pushdown Automata is Nonelementary.
LICS
Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski
2013 J jnl
Branching-Time Model Checking of One-Counter Processes and Timed Automata.
SIAM J. Comput.
Stefan Göller, Markus Lohrey
2013 J jnl
Equivalence of Deterministic One-Counter Automata is NL-complete
CoRR
Stanislav Böhm, Stefan Göller, Petr Jancar
2013 A* conf
Equivalence of deterministic one-counter automata is NL-complete.
STOC
Stanislav Böhm, Stefan Göller, Petr Jancar
2013 B conf
Reachability in Register Machines with Polynomial Updates.
MFCS
Alain Finkel, Stefan Göller, Christoph Haase
2013 B conf
The Fixed-Parameter Tractability of Model Checking Concurrent Systems.
CSL
Stefan Göller
2012 B conf
A Comparison of Succinctly Represented Finite-State Systems.
CONCUR
Romain Brenguier, Stefan Göller, Ocan Sankur
2012 J jnl
Bisimilarity of Pushdown Systems is Nonelementary
CoRR
Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski
2012 B conf
Branching-Time Model Checking of Parametric One-Counter Automata.
FoSSaCS
Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell
2012 A conf
Concurrency Makes Simple Theories Hard.
STACS
Stefan Göller, Anthony Widjaja Lin
2012 — conf
On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two.
FSTTCS
Christopher H. Broadbent, Stefan Göller
2012 A* conf
The Complexity of Decomposing Modal and First-Order Theories.
LICS
Stefan Göller, Jean Christoph Jung, Markus Lohrey
2012 J jnl
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
CoRR
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss
2012 B conf
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers.
Advances in Modal Logic
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß
2011 J jnl
Fixpoint Logics over Hierarchical Structures.
Theory Comput. Syst.
Stefan Göller, Markus Lohrey
2011 B conf
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete.
MFCS
Stanislav Böhm, Stefan Göller
2011 B conf
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems.
CONCUR
Stefan Göller, Anthony Widjaja Lin
2011 A* conf
The Complexity of Verifying Ground Tree Rewrite Systems.
LICS
Stefan Göller, Anthony Widjaja Lin
2011 — conf
The First-Order Theory of Ground Tree Rewrite Graphs.
FSTTCS
Stefan Göller, Markus Lohrey
2010 B conf
Bisimilarity of One-Counter Processes Is PSPACE-Complete.
CONCUR
Stanislav Böhm, Stefan Göller, Petr Jancar
2010 A conf
Branching-time Model Checking of One-counter Processes.
STACS
Stefan Göller, Markus Lohrey
2010 — conf
Model Checking Succinct and Parametric One-Counter Automata.
ICALP (2)
Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell
2009 J jnl
Branching-time model checking of one-counter processes
CoRR
Stefan Göller, Markus Lohrey
2009 J jnl
Branching-time model checking of one-counter processes
CoRR
Stefan Göller, Markus Lohrey
2009 A* conf
On the Computational Complexity of Verifying One-Counter Processes.
LICS
Stefan Göller, Richard Mayr, Anthony Widjaja To
2009 J jnl
PDL with intersection and converse: satisfiability and infinite-state model checking.
J. Symb. Log.
Stefan Göller, Markus Lohrey, Carsten Lutz
2008 J jnl
A note on an extension of PDL.
J. Appl. Log.
Stefan Göller, Dirk Nowotka
2008 — —
Computational complexity of propositional dynamic logics.
Stefan Göller
2008 J jnl
Reachability on prefix-recognizable graphs.
Inf. Process. Lett.
Stefan Göller
2007 J jnl
On a Non-Context-Free Extension of PDL
CoRR
Stefan Göller, Dirk Nowotka
2007 B conf
On the Complexity of Reasoning About Dynamic Policies.
CSL
Stefan Göller
2007 B conf
PDL with Intersection and Converse Is 2 EXP-Complete.
FoSSaCS
Stefan Göller, Markus Lohrey, Carsten Lutz
2007 — conf
PDL with Intersection and Converse is 2EXP-complete.
Algorithmic-Logical Theory of Infinite Structures
Stefan Göller, Markus Lohrey, Carsten Lutz
2006 B conf
Infinite State Model-Checking of Propositional Dynamic Logics.
CSL
Stefan Göller, Markus Lohrey
2005 — conf
Fixpoint Logics on Hierarchical Structures.
FSTTCS
Stefan Göller, Markus Lohrey
2003 — conf
Composition on Distributed RUBATO by Affine Transformations and Deformations of Musical Structures.
ICMC
Stefan Göller, Gérard Milmeister