Program for Thursday, September 20th: Talk View

PROGRAM FOR THURSDAY, SEPTEMBER 20TH: TALK VIEW

Days:

previous day

next day

all days

View: with abstracts session overview

9:00

9:30

10:00

10:30

11:00

11:30

12:00

12:30

13:00

13:30

14:00

14:30

15:00

15:30

16:00

16:30

17:00

17:30

18:00

18:30

19:00

09:00-10:00

Constant Delay Enumeration of Query Results

Nicole Schweikardt

10:30-10:40

Continuous-Time Markov Decisions based on Partial Exploration

Pranav Ashok

10:40-10:50

Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes

Tobias Meggendorfer

10:50-11:00

Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes

Raphaël Berthon

11:00-11:10

David Purser

10:30-10:40

Pointlike sets for varieties determined by groups

Samuel J. V. Gool

10:40-10:50

Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid

Chris Köcher

10:50-11:00

A new hierarchy for automaton semigroups

Thibault Godin

11:00-11:10

A Ramsey Theorem for semigroups

Ismaël Jecker

10:30-10:40

The Reachability Problem for Vector Addition Systems is Not Elementary

Wojciech Czerwiński

10:40-10:50

Polynomial Vector Addition Systems With States

Jérôme Leroux

10:50-11:00

Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS

Florian Zuleger

11:00-11:10

Unboundedness problems for languages of vector addition systems

Georg Zetzsche

11:20-12:00

Nonarchimedean Convex Programming and Its Relation to Mean-Payoff Games

Stéphane Gaubert

13:30-14:10

Efficient analysis of probabilistic systems that accumulate quantities

Stefan Kiefer

14:10-14:50

Probabilistic Model Checking: Advances and Applications

David Parker

15:20-15:30

The Containment Problem for Unambiguous Register Automata

Karin Quaas

15:30-15:40

Polynomial-time equivalence testing for deterministic fresh-register automata

Nikos Tzevelekos

15:40-15:50

Weak Cost Register Automata are Still Powerful

Michaël Cadilhac

15:50-16:00

Pumping lemmas for weighted automata

Filip Mazowiecki

16:00-16:10

What can you expect of a weighted automaton?

Jakub Michaliszyn

15:20-15:30

Reachability for Branching Concurrent Stochastic Games

Emanuel Martinov

15:30-15:40

Towards Partial Order Reductions for Strategic Ability

Wojtek Jamroga

15:40-15:50

Beyond Admissibility: Rationality in Quantitative Games

Marie Van Den Bogaard

15:50-16:00

Reasoning about Knowledge and Strategies

Bastien Maubert

16:00-16:10

Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean

Aline Goeminne

15:20-15:30

Reachability and Distances under Multiple Changes

Nils Vortmeier

15:30-15:40

Counting Triangles under Updates in Worst-Case Optimal Time

Ahmet Kara

15:40-15:50

Answering UCQs under updates

Jens Keppeler

15:50-16:00

Characterization of non-associative circuits using automata, and applications

Pierre Ohlmann

16:00-16:10

The Linear Space Hypothesis and Its Close Connection to Two-Way Finite Automata

Tomoyuki Yamakami

16:20-16:30

Synthesizing Optimally Resilient Controllers

Martin Zimmermann

16:30-16:40

Strix: Explicit Reactive Synthesis Strikes Back!

Philipp J. Meyer

16:40-16:50

Automatic Synthesis of Systems with Data

Léo Exibard

16:50-17:00

Observation synthesis for games with imperfect information

Nathan Lhote

17:00-17:10

Graph Planning with Expected Finite Horizon

Laurent Doyen

16:20-16:30

Safe and Optimal Scheduling of Hard and Soft Tasks

Shibashis Guha

16:30-16:40

Symbolic Approximation of Weighted Timed Games

Damien Busatto-Gaston

16:40-16:50

Costs and Rewards in Priced Timed Automata

Mahsa Shirmohammadi

16:50-17:00

Reachability in timed automata with diagonal constraints

B Srivathsan

17:00-17:10

Universal Safety for Timed Petri Nets is PSPACE-complete

Patrick Totzke

16:20-16:30

Regular separability of WSTS

Sebastian Muskalla

16:30-16:40

Decidability in data Petri nets — a conjecture.

Radosław Piórkowski

16:40-16:50

DEEPSEC: Deciding Equivalence Properties in Security Protocols Theory and Practice

Vincent Cheval

17:10-18:00 Poster session

10:00-10:30 Coffee break

12:00-13:30 Lunch break

14:50-15:20 Coffee break

18:00-19:00 Football game (in Tiergarten)