Stefan Göller - Veröffentlichungen allgemein

(1 - 13 von 15

)

Bisimilarity of One-Counter Processes Is PSPACE-CompleteSpringer

link.springer.com

von S Böhm · · Zitiert von: 24 — Stefan Göller &; Petr Jančar. Part of the book series: Lecture Notes ... Stefan Göller. Authors. Stanislav Böhm. View author publications. You can also ...

Springer

link.springer.com

von S Göller · · Zitiert von: 48 — Stefan Göller,; Christoph Haase,; Joël Ouaknine & … James Worrell.

On the Complexity of Reasoning About Dynamic PoliciesSpringer

link.springer.com

von S Göller · · Zitiert von: 6 — Stefan Göller. Part of the book series: Lecture Notes in Computer ... Stefan Göller. Authors. Stefan Göller. View author publications. You can also ...

30 STEFAN GÖLLER, MARKUS

www.yumpu.com

PDL WITH INTERSECTION AND CONVERSE - Institut für Informatik ...

Language Equivalence of Deterministic Real-Time One-Counter ...link.springer.com › chapter

link.springer.com

Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. Authors; Authors and affiliations. Stanislav Böhm; Stefan Göller.

Call for Presentations: Highlights of Logic, Games and Automata 2023my-wordpress-site-gdrjeux.apps.math.cnrs.fr › call-f...

my-wordpress-site-gdrjeux.apps.math.cnrs.fr

· The organisation chair is Stefan Göller. (new) The conference is now five days, tutorials included. (new) An early round of submissions is ...

On a Non-Context-Free Extension of PDL : Stefan Göller : Free...

archive.org

Over the last 25 years, a lot of work has been done on seeking for decidable non-regular extensions of Propositional Dynamic Logic (PDL).

Publications | Christoph Haase

www.cs.ox.ac.uk

Homepage of Christoph Haase

Stefan Göller - Deutsche Digitale Bibliothek

www.deutsche-digitale-bibliothek.de

Die Deutsche Digitale Bibliothek ist das zentrale Portal für Kultur und Wissen. Sie macht das kulturelle Erbe der Bundesrepublik über das Internet zugänglich.

Language Equivalence of Deterministic Real-Time One-Counter Automata...

link.springer.com

We prove that deciding language equivalence of deterministic real-time one-counter automata is NL-complete, in stark contrast to the inclusion problem which is...

Infinite State Model-Checking of Propositional Dynamic Logics |...

link.springer.com

Infinite State Model-Checking of Propositional Dynamic Logics. Authors; Authors and affiliations. Stefan Göller; Markus Lohrey. Stefan Göller. 1. Markus Lohrey.

PDL with Intersection and Converse Is 2 EXP-Complete | SpringerLink

link.springer.com

PDL with Intersection and Converse Is 2EXP-Complete. Authors; Authors and affiliations. Stefan Göller; Markus Lohrey; Carsten Lutz. Stefan Göller. 1.

Model Checking Succinct and Parametric One-Counter Automata |...

link.springer.com

We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct...

Verwandte Suchanfragen zu Stefan Göller

Guerino Mazzola
Markus Lohrey
Roger Fischlin

Jürgen Felsensteiner
Carsten Lutz
Arne Meier

Philipp Goller
Wolfgang Plechaty
Manfred Kofler

Person "Göller" (2)
Vorname "Stefan" (78868)
Name "Göller" (506)

sortiert nach Relevanz / Datum

Erweiterte Suche

Person-Suchen: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Veröffentlichungen allgemein Stefan Göller