Towards Efficient Parameterized Synthesis

DOI10.1007/978-3-642-35873-9_9zbMath1426.68051OpenAlexW2195048259MaRDI QIDQ2926642

Roderick Bloem, Ayrat Khalimov, Swen Jacobs

Publication date: 3 November 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35873-9_9

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (13)

Parameterized model checking of rendezvous systems ⋮ Verification of agent navigation in partially-known environments ⋮ Compositional verification of smart contracts through communication abstraction ⋮ Unnamed Item ⋮ Tableaux for realizability of safety specifications ⋮ Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis ⋮ Encodings of Bounded Synthesis ⋮ Distributed synthesis for parameterized temporal logics ⋮ Synthesizing adaptive test strategies from temporal logic specifications ⋮ Practical synthesis of reactive systems from LTL specifications via parity games ⋮ Parameterized synthesis of self-stabilizing protocols in symmetric networks ⋮ Vacuity in synthesis ⋮ Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings

This page was built for publication: Towards Efficient Parameterized Synthesis