[Settfa] Fwd: Seminar on Applied Mathematical Logic -- Manfred Droste (20 November)

[David Bradley-Williams]

Dear all,

Our visitor Manfred Droste (speaking this morning in our seminar) is 
also giving a talk tomorrow at the Institute of Computer Science CAS as 
detailed in the announcement below, which I'm forwarding in case of 
interest.

Best wishes,

David

-------- Original Message --------
Subject: Seminar on Applied Mathematical Logic -- Manfred Droste (20 
November)
Date: 2024-11-16 12:12
 From: Igor Sedlár <sedlar at cs.cas.cz>
To: logics at cs.cas.cz

Dear colleagues,

The next meeting of the Seminar on Applied Mathematical Logic at the 
Institute of Computer Science CAS will take place on Wednesday 20 
November at 4pm. The speaker is Manfred Droste (Institute of Computer 
Science of the University of Leipzig).

The meeting will be hybrid, that is, the talk will be given live in room 
318 at the ICS and streamed via Zoom. The abstract and the streaming 
details are attached below.

Information about the seminar is available at 
http://www.cs.cas.cz/logics/seminar.html.

Best wishes,
Zuzana Haniková and Igor Sedlár


---------------------------------------------------------------------------------------------
Manfred Droste (Institute of Computer Science of the University of 
Leipzig): Weighted Automata and Quantitative Logics

Quantitative models and quantitative analysis in Computer Science are 
receiving increased attention. The goal of this talk is to investigate 
quantitative automata and quantitative logics. Weighted automata on 
finite words have already been investigated in seminal work of 
Schützenberger (1961). They consist of classical finite automata in 
which the transitions carry weights. These weights may model, e.g., the 
cost, the consumption of resources, or the reliability or probability of 
the successful execution of the transitions. This concept soon developed 
a flourishing theory. We investigate weighted automata and their 
relationship to weighted logics. For this, we present syntax and 
semantics of a quantitative logic; the semantics counts ‘how often’ a 
formula is true in a given word. Our main result, extending the 
classical result of Büchi, shows that if the weights are taken from an 
arbitrary semiring, then weighted automata and a syntactically defined 
fragment of our weighted logic are expressively equivalent. A 
corresponding result holds for infinite words. Moreover, this extends to 
quantitative automata investigated by Henzinger et al. with 
(non-semiring) average-type behaviors, or with discounting or limit 
average objectives for infinite words.

Topic: Seminar on Applied Mathematical Logic
Time: 20 November, 4pm (This is a recurring meeting)

Link: 
https://cesnet.zoom.us/j/91027253611?pwd=UXgrWGo4Tm5lT056Mm1SVFZ0TWFWUT09

Meeting ID: 910 2725 3611
Passcode: 081741
---------------------------------------------------------------------------------------------

-- 
David Bradley-Williams PhD
Department of Abstract Analysis
Institute of Mathematics, Czech Academy of Sciences
Žitná 25
115 67 Praha 1
Czech Republic

Tel: +420-222 090 743

Url: http://davidbw.sdf.org/