Search Results

Documents authored by Cano, Filip

Artifact
Software
DOI: 10.4230/artifacts.27673
filipcano/monitoring-discounted-sum-properties

Authors: Filip Cano, Thomas A. Henzinger, Konstantin Kueffner, and N. Ege Saraç

Abstract
Cite as

Filip Cano, Thomas A. Henzinger, Konstantin Kueffner, N. Ege Saraç. filipcano/monitoring-discounted-sum-properties (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-27673,
   title = {{filipcano/monitoring-discounted-sum-properties}}, 
   author = {Cano, Filip and Henzinger, Thomas A. and Kueffner, Konstantin and Sara\c{c}, N. Ege},
   note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:cb99396415f279c985cd05206b44320227f64245;origin=https://github.com/filipcano/monitoring-discounted-sum-properties;visit=swh:1:snp:39532024513dbfa02dfb3dc789fdc75651e6d1d9;anchor=swh:1:rev:ad5bae8ff127ae93f6a5c3238d4f0b4217d10338}{\texttt{swh:1:dir:cb99396415f279c985cd05206b44320227f64245}} (visited on 2026-08-24)},
   url = {https://github.com/filipcano/monitoring-discounted-sum-properties},
   doi = {10.4230/artifacts.27673},
}
Document
DOI: 10.4230/LIPIcs.CONCUR.2026.22
Monitoring Discounted Sum Properties

Authors: Filip Cano, Thomas A. Henzinger, Konstantin Kueffner, and N. Ege Saraç

Published in: LIPIcs, Volume 391, 37th International Conference on Concurrency Theory (CONCUR 2026)

Abstract
Runtime monitoring of quantitative signals faces a fundamental trade-off between volatility and over-aggregation: instantaneous observations are noisy, while long-run averages obscure local structure. Localisation measures such as discounted averages offer a principled middle ground, yet remain poorly understood in runtime verification. This paper studies discounted sums from a monitoring perspective, in both deterministic and stochastic settings. We formalize the discounted monitoring problem and show that exact, sound monitoring of discounted sums cannot be achieved with finite memory. To overcome this impossibility, we introduce ε-approximately sound monitoring, deriving explicit bounds on memory and observation requirements. We then extend the framework to stochastic processes via expected discounted sums, defining pointwise and uniform (ε,δ)-soundness notions, establishing statistical optimality, and proving impossibility beyond a precision threshold. We also formalize the resource complexity of deterministic discounted monitoring via affine register machines and prove a tight worst-case lower bound. Finally, we present a specification language for arithmetic expressions over multiple discounted sums with synchronous and asynchronous semantics, and evaluate our approach on practical scenarios including algorithmic fairness.
Cite as

Filip Cano, Thomas A. Henzinger, Konstantin Kueffner, and N. Ege Saraç. Monitoring Discounted Sum Properties. In 37th International Conference on Concurrency Theory (CONCUR 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 391, pp. 22:1-22:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{cano_et_al:LIPIcs.CONCUR.2026.22,
  author =	{Cano, Filip and Henzinger, Thomas A. and Kueffner, Konstantin and Sara\c{c}, N. Ege},
  title =	{{Monitoring Discounted Sum Properties}},
  booktitle =	{37th International Conference on Concurrency Theory (CONCUR 2026)},
  pages =	{22:1--22:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-447-5},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{391},
  editor =	{Sokolova, Ana and Totzke, Patrick},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2026.22},
  URN =		{urn:nbn:de:0030-drops-273533},
  doi =		{10.4230/LIPIcs.CONCUR.2026.22},
  annote =	{Keywords: Runtime Verification, Probabilistic Systems, Quantitative Verification, Approximate Monitoring}
}
Document
DOI: 10.4230/DagRep.14.2.95
Safety Assurance for Autonomous Mobility (Dagstuhl Seminar 24071)

Authors: Jyotirmoy Deshmukh, Bettina Könighofer, Dejan Ničković, and Filip Cano

Published in: Dagstuhl Reports, Volume 14, Issue 2 (2024)

Abstract
This report documents the program and the outcomes of the Dagstuhl Seminar "Safety Assurance for Autonomous Mobility" (24071). The seminar brought together an interdisciplinary group of researchers and practitioners from the fields of formal methods, cyber-physical systems, and artificial intelligence, with a common interest in autonomous mobility. Through a series of talks, working groups, and open problem discussions, participants explored the challenges and opportunities associated with ensuring the safety of autonomous systems in various domains, including industrial automation, automotive, railways, and aerospace. Key topics addressed included the need for industrial-grade autonomous products to operate reliably in safety-critical environments, highlighting the lack of standardized procedures for obtaining safety certifications for AI-based systems. Recent advancements in the verification and validation (V&V) of autonomous mobility systems were presented, focusing on requirements verification, testing, certification, and correct-by-design approaches. Overall, the seminar provided a comprehensive overview of the current state and future directions in safe autonomous mobility, emphasizing the need for interdisciplinary collaboration and innovation to address the complex challenges in this rapidly evolving field.
Cite as

Jyotirmoy Deshmukh, Bettina Könighofer, Dejan Ničković, and Filip Cano. Safety Assurance for Autonomous Mobility (Dagstuhl Seminar 24071). In Dagstuhl Reports, Volume 14, Issue 2, pp. 95-119, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{deshmukh_et_al:DagRep.14.2.95,
  author =	{Deshmukh, Jyotirmoy and K\"{o}nighofer, Bettina and Ni\v{c}kovi\'{c}, Dejan and Cano, Filip},
  title =	{{Safety Assurance for Autonomous Mobility (Dagstuhl Seminar 24071)}},
  pages =	{95--119},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2024},
  volume =	{14},
  number =	{2},
  editor =	{Deshmukh, Jyotirmoy and K\"{o}nighofer, Bettina and Ni\v{c}kovi\'{c}, Dejan and Cano, Filip},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.2.95},
  URN =		{urn:nbn:de:0030-drops-205009},
  doi =		{10.4230/DagRep.14.2.95},
  annote =	{Keywords: aerospace, automotive, autonomy, formal methods, railway}
}
Document
Invited Talk
DOI: 10.4230/LIPIcs.FSCD.2024.2
Abstraction-Based Decision Making for Statistical Properties (Invited Talk)

Authors: Filip Cano, Thomas A. Henzinger, Bettina Könighofer, Konstantin Kueffner, and Kaushik Mallik

Published in: LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)

Abstract
Sequential decision-making in probabilistic environments is a fundamental problem with many applications in AI and economics. In this paper, we present an algorithm for synthesizing sequential decision-making agents that optimize statistical properties such as maximum and average response times. In the general setting of sequential decision-making, the environment is modeled as a random process that generates inputs. The agent responds to each input, aiming to maximize rewards and minimize costs within a specified time horizon. The corresponding synthesis problem is known to be PSPACE-hard. We consider the special case where the input distribution, reward, and cost depend on input-output statistics specified by counter automata. For such problems, this paper presents the first PTIME synthesis algorithms. We introduce the notion of statistical abstraction, which clusters statistically indistinguishable input-output sequences into equivalence classes. This abstraction allows for a dynamic programming algorithm whose complexity grows polynomially with the considered horizon, making the statistical case exponentially more efficient than the general case. We evaluate our algorithm on three different application scenarios of a client-server protocol, where multiple clients compete via bidding to gain access to the service offered by the server. The synthesized policies optimize profit while guaranteeing that none of the server’s clients is disproportionately starved of the service.
Cite as

Filip Cano, Thomas A. Henzinger, Bettina Könighofer, Konstantin Kueffner, and Kaushik Mallik. Abstraction-Based Decision Making for Statistical Properties (Invited Talk). In 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 299, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{cano_et_al:LIPIcs.FSCD.2024.2,
  author =	{Cano, Filip and Henzinger, Thomas A. and K\"{o}nighofer, Bettina and Kueffner, Konstantin and Mallik, Kaushik},
  title =	{{Abstraction-Based Decision Making for Statistical Properties}},
  booktitle =	{9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)},
  pages =	{2:1--2:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-323-2},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{299},
  editor =	{Rehof, Jakob},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.2},
  URN =		{urn:nbn:de:0030-drops-203310},
  doi =		{10.4230/LIPIcs.FSCD.2024.2},
  annote =	{Keywords: Abstract interpretation, Sequential decision making, Counter machines}
}

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact