Symbolic bounded synthesis
type: Item
instance of: scholarly article
title: Symbolic bounded synthesis
zbMATH Open document ID: 1247.68163
author: Rüdiger Ehlers
published in: Formal Methods in System Design
publication date: 2012-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 6087632
zbMATH Keywords: synthesis from LTL
zbMATH Keywords: bounded synthesis
zbMATH Keywords: Safraless synthesis
zbMATH Keywords: safety games
zbMATH Keywords: binary decision diagrams
describes a project that uses: NuSMV
describes a project that uses: LTL2BA
describes a project that uses: CUDD
MaRDI profile type: Publication
full work available at URL: s10703-011-0137-x
OpenAlex ID: W2023329406
cites work: Symbolic computational techniques for solving games
cites work: Model checking and boolean graphs
cites work: SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Symbolic model checking: \(10^{20}\) states and beyond
cites work: Q4804909
cites work: A linear-time model-checking algorithm for the alternation-free modal mu- calculus
cites work: Binary decision diagrams in theory and practice
cites work: An Antichain Algorithm for LTL Realizability
cites work: Compositional Algorithms for LTL Synthesis
cites work: Synthesis of Asynchronous Systems
cites work: Q4551134
cites work: Selective Approaches for Solving Weak Games
cites work: Solving Games Without Determinization
cites work: Revisiting Synthesis of GR(1) Specifications
cites work: Q2754078
cites work: Q4817542
cites work: On Locally Checkable Properties
cites work: Q3141897
cites work: From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Q4205072
cites work: Bounded Synthesis
cites work: Q4804886
cites work: Reasoning about infinite computations
cites work: Branching Programs and Binary Decision Diagrams
DOI: 10.1007/S10703-011-0137-X
Recommended article: Bounded Synthesis
Recommended article: Unbeast: Symbolic Bounded Synthesis
Recommended article: Encodings of Bounded Synthesis
Recommended article: A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
Recommended article: Symbolic bisimulations
Recommended article: Correct Hardware Design and Verification Methods
Recommended article: Towards specifying symbolic computation
description: scientific article; zbMATH DE number 6087632