Pareto-rational verification

DOI10.4230/LIPICS.CONCUR.2022.33MaRDI QIDQ6587141zbMATH OpenFDO

Authors Véronique Bruyère, Jean-François Raskin, Clément Tamines

Publication date 13 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2022.33

zbMATH Keywords

\(\omega\)-regular objectivesmodel-checkingPareto-optimalityrational verification

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(4)

• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• As soon as possible but rationally
• Verification with common knowledge of rationality for graph games
• The non-cooperative rational synthesis problem for SPEs and -regular objectives

This page was built for publication: Pareto-rational verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587141)