Sequential Relational Decomposition

DOI10.1145/3209108.3209203zbMath1497.68173arXiv1903.01368OpenAlexW2798787028MaRDI QIDQ5094122

Joël Ouaknine, Axel Legay, Dror Fried, Moshe Y. Vardi

Publication date: 2 August 2022

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

synthesisdecompositionpositivitycompositionautomatic relations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of computing (68Q01) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items

Adapting behaviors via reactive synthesis, Functional synthesis via input-output separation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Languages represented by Boolean formulas
• General quantitative specification theories with modal transition systems
• Reachability problems for Markov chains
• Automata, logics, and infinite games. A guide to current research
• Automatic structures
• Succinct representations of graphs
• Some natural decision problems in automatic graphs
• BDD-Based Boolean Functional Synthesis
• A note on succinct representations of graphs
• Communication Complexity
• Reducibility among Combinatorial Problems
• On the Positivity Problem for Simple Linear Recurrence Sequences,
• An axiomatic basis for computer programming
• The NP-completeness column: An ongoing guide