Stefan Göller

Available identifiers

zbMath Open goller.stefanMaRDI QIDQ959056

List of research outcomes

Publication	Date of Publication	Type
The Reachability Problem for Two-Dimensional Vector Addition Systems with States	2022-12-08	Paper
Bisimulation Finiteness of Pushdown Systems Is Elementary	2021-01-21	Paper
On long words avoiding Zimin patterns	2019-08-27	Paper
https://portal.mardi4nfdi.de/entity/Q4553282	2018-11-02	Paper
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete	2018-04-23	Paper
Games with bound guess actions	2018-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q4636612	2018-04-19	Paper
On Long Words Avoiding Zimin Patterns	2018-04-19	Paper
A polynomial-time algorithm for reachability in branching VASS in dimension one	2017-12-19	Paper
https://portal.mardi4nfdi.de/entity/Q5278398	2017-07-19	Paper
Bisimilarity of Pushdown Automata is Nonelementary	2017-07-03	Paper
The Complexity of Decomposing Modal and First-Order Theories	2017-05-16	Paper
https://portal.mardi4nfdi.de/entity/Q2958531	2017-02-02	Paper
On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two	2017-01-26	Paper
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems	2015-09-17	Paper
The Complexity of Decomposing Modal and First-Order Theories	2015-09-17	Paper
Equivalence of deterministic one-counter automata is NL-complete	2014-08-07	Paper
The First-Order Theory of Ground Tree Rewrite Graphs	2014-03-24	Paper
Bisimulation equivalence and regularity for real-time one-counter automata	2014-02-13	Paper
Branching-Time Model Checking of One-Counter Processes and Timed Automata	2013-09-25	Paper
Reachability in Register Machines with Polynomial Updates	2013-09-20	Paper
A Comparison of Succinctly Represented Finite-State Systems	2012-09-25	Paper
The First-Order Theory of Ground Tree Rewrite Graphs	2012-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q2904757	2012-08-23	Paper
Branching-Time Model Checking of Parametric One-Counter Automata	2012-06-22	Paper
Branching-time model checking of one-counter processes	2012-01-23	Paper
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems	2011-09-02	Paper
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete	2011-08-17	Paper
Fixpoint logics over hierarchical structures	2011-04-01	Paper
Model Checking Succinct and Parametric One-Counter Automata	2010-09-07	Paper
Bisimilarity of One-Counter Processes Is PSPACE-Complete	2010-08-31	Paper
Reachability on prefix-recognizable graphs	2010-06-09	Paper
https://portal.mardi4nfdi.de/entity/Q3393869	2009-08-27	Paper
PDL with intersection and converse: satisfiability and infinite-state model checking	2009-03-25	Paper
Infinite State Model-Checking of Propositional Dynamic Logics	2009-03-12	Paper
On the Complexity of Reasoning About Dynamic Policies	2009-03-05	Paper
A note on an extension of PDL	2008-12-11	Paper
PDL with Intersection and Converse Is 2EXP-Complete	2007-09-07	Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science	2006-11-14	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Stefan Göller