Program for Tuesday, September 8th: Talk View

Organizers

HIGHLIGHTS26: HIGHLIGHTS 2026

Overview Scope OpenProblems Venue Submissions Important Dates Attendance Invited Speakers Tutorials Travel Accommodation Committee CREW HESS Registration Sponsors PROGRAM AUTHORS KEYWORDS

PROGRAM FOR TUESDAY, SEPTEMBER 8TH: TALK VIEW

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

09:00-10:00

K. S. Thejaswini

10:00-10:30 Coffee Break

10:30-10:42

Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches

Sven Manthe

10:42-10:54

Layered automata: A canonical model for automata over infinite words

Igor Walukiewicz

10:54-11:06

History-deterministic Büchi automata are succinct

Keya Prakash

11:06-11:18

A simple algorithmic framework for disambiguation of finite automata

Martín Muñoz

11:18-11:30

Decomposition of Automata recognizing Ideals

Mathias Berry

11:30-11:42

Regular Languages Out of Order: An Algebraic View of Streaming Space

Sebastien Labbe

11:42-11:54

Asymptotic Hausdorff and Language Similarity

Dana Fisman

11:54-12:06

Hierarchical-Alphabet Automata: Extendable Acceptors for Languages of Nested Words

Patrick Van der Spiegel

12:06-12:18

Computing Measures: Fixed Points Beyond Lattices

Damian Niwinski

10:30-10:42

Dicey Games: Shared Sources of Randomness in Distributed Systems

Léonard Brice

10:42-10:54

Verification of Equilibria in Probabilistic Concurrent Multiplayer Reachability Games

Senthil Rajasekaran

10:54-11:06

Don't Start From Zero: Optimizing Value Iteration in MDPs After Action Removal

Shrisha Rao

11:06-11:18

Tractable Hyperproperties for MDPs

Tobias Winkler

11:18-11:30

Sure-almost-sure Window Mean Payoff in Markov Decision Processes

Pranshu Gaba

11:30-11:42

Stopping Criterion for Strategy Improvement on Concurrent Stochastic Games

Marta Grobelna

11:42-11:54

Randomise Alone, Reach as a Team (CAV26 Paper)

Ali Shafiee

11:54-12:06

Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives

Ali Asadi

12:30-14:30 Lunch Break

14:30-14:42

Representations: a general theory

Paul Brunet

14:42-14:54

Program Logics via Distributive Monoidal Categories

Elena Di Lavore

14:54-15:06

The Magmoid of Normalized Stochastic Kernels

Mario Román

15:06-15:18

Languages and Recognition in a Category with Factorisation

Mike Cruchten

15:18-15:30

Polynomial Algebras of Logical Structures

Matthieu Vermeil

15:30-15:42

Register Automata in a Category

Killian Barbé

15:42-15:54

Alternating Kleene Algebra

Prabhat Jha

14:30-14:42

Opacity problems in multi-energy timed automata

Lydia Bakiri

14:42-14:54

Best-Effort Safety Control of Multi-Mode Systems

Marco Faella

14:54-15:06

(In)aproximability of weighted timed games

Isa Vialard

15:06-15:18

Scalable Current-State Estimation of Discrete-Timed Automata

Julian Klein

15:18-15:30

Back in Time: Bringing a Classical Theory of Compositional Verification to Timed Automata

Mehran Moeini Jam

15:30-15:42

Efficiently computable temporal robustness for a practical STL fragment

Mohammed Foughali

16:00-16:30 Coffee Break

Disclaimer | Powered by EasyChair Smart Program