Synthesis for Structure Rewriting Systems

DOI10.1007/978-3-642-03816-7_36MaRDI QIDQ3182943zbMATH OpenOpenAlexFDO

Authors Łukasz Kaiser

Publication date 16 October 2009

Published in Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03816-7_36

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic in computer science (03B70)

Recommendations

• Computer Science Logic
• Games for synthesis of controllers with partial observation.
• Synthesizing structured reactive programs via deterministic tree automata
• scientific article; zbMATH DE number 2163041
• A compositional framework for controller synthesis

Cites work

• scientific article; zbMATH DE number 3644498 (Why is no real title available?)
• scientific article; zbMATH DE number 177438 (Why is no real title available?)
• Abstracting Complex Data Structures by Hyperedge Replacement
• Admissibility in Infinite Games
• Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
• Automata, logics, and infinite games. A guide to current research
• Infinite games played on finite graphs
• STACS 2004

Cited in

(6)

• scientific article; zbMATH DE number 1254101 (Why is no real title available?)
• Syntax-guided rewrite rule enumeration for SMT solvers
• Automatically Generated Infrastructure for De Bruijn Syntaxes
• Logic based structure rewriting systems
• Games for active XML revisited
• A general procedure for improving substructures representation in dynamic synthesis

This page was built for publication: Synthesis for Structure Rewriting Systems

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