scientific article; zbMATH DE number 7439747

zbMath1478.68179arXiv1511.09450MaRDI QIDQ5015286

Leander Tentrup, Alexander Weinert, Martín G. Zimmermann

Publication date: 7 December 2021

Full work available at URL: https://arxiv.org/abs/1511.09450

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (1)

Parameterized linear temporal logics meet costs: still not costlier than LTL

Uses Software

• Acacia+

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal bounds in parametric LTL games
• Antichains and compositional algorithms for LTL synthesis
• Symbolic bounded synthesis
• From liveness to promptness
• Automata, logics, and infinite games. A guide to current research
• Parametric temporal logic for “model measuring”
• Solving Parity Games in Big Steps
• Safraless Compositional Synthesis

This page was built for publication: