@inproceedings{10.1007/978-3-642-03816-7_36,
    Abstract = {The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in which a state is described by an arbitrary finite structure, and changes of the state are represented by structure rewriting rules, a generalisation of term and graph rewriting. Both the environment and the controller are allowed to change the structure in this way, and the question we ask is how a strategy for the controller that ensures a given property can be synthesised.We focus on one particular class of structure rewriting rules, namely on separated structure rewriting, a limited syntactic class of rules. To counter this restrictiveness, we allow the property to be ensured by the controller to be specified in a very expressive logic: a combination of monadic second-order logic evaluated on states and the modal {$\mu$}-calculus for the temporal evolution of the whole system. We show that for the considered class of rules and this logic, it can be decided whether the controller has a strategy ensuring a given property, and in such case a finite-memory strategy can be synthesised. Additionally, we prove that the same holds if the property is given by a monadic second-order formula to be evaluated on the limit of the evolution of the system.},
    Address = {Berlin, Heidelberg},
    Author = {Kaiser, undefinedukasz},
    BookTitle = {Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009},
    File = {Synthesis for Structure Rewriting Systems - Synthesis\_for\_Structure\_Rewriting\_System.pdf},
    ISBN = {9783642038150},
    Location = {Novy Smokovec, High Tatras, Slovakia},
    Pages = {415--426},
    Publisher = {Springer-Verlag},
    Series = {MFCS '09},
    Title = {Synthesis for Structure Rewriting Systems},
    URL = {https://doi.org/10.1007/978-3-642-03816-7\_36},
    Year = {2009},
    bdsk-url-1 = {https://doi.org/10.1007/978-3-642-03816-7\_36},
    date-added = {2021-07-28 10:24:46 +0200},
    date-modified = {2021-07-28 10:24:46 +0200},
    numpages = {12},
    doi = {10.1007/978-3-642-03816-7_36}
}

@inproceedings{10.1007/978-3-642-03816-7_36, Abstract = {The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in which a state is described by an arbitrary finite structure, and changes of the state are represented by structure rewriting rules, a generalisation of term and graph rewriting. Both the environment and the controller are allowed to change the structure in this way, and the question we ask is how a strategy for the controller that ensures a given property can be synthesised.We focus on one particular class of structure rewriting rules, namely on separated structure rewriting, a limited syntactic class of rules. To counter this restrictiveness, we allow the property to be ensured by the controller to be specified in a very expressive logic: a combination of monadic second-order logic evaluated on states and the modal {$\mu$}-calculus for the temporal evolution of the whole system. We show that for the considered class of rules and this logic, it can be decided whether the controller has a strategy ensuring a given property, and in such case a finite-memory strategy can be synthesised. Additionally, we prove that the same holds if the property is given by a monadic second-order formula to be evaluated on the limit of the evolution of the system.}, Address = {Berlin, Heidelberg}, Author = {Kaiser, undefinedukasz}, BookTitle = {Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009}, File = {Synthesis for Structure Rewriting Systems - Synthesis_for_Structure_Rewriting_System.pdf}, ISBN = {9783642038150}, Location = {Novy Smokovec, High Tatras, Slovakia}, Pages = {415--426}, Publisher = {Springer-Verlag}, Series = {MFCS '09}, Title = {Synthesis for Structure Rewriting Systems}, URL = {https://doi.org/10.1007/978-3-642-03816-7_36}, Year = {2009}, bdsk-url-1 = {https://doi.org/10.1007/978-3-642-03816-7_36}, date-added = {2021-07-28 10:24:46 +0200}, date-modified = {2021-07-28 10:24:46 +0200}, numpages = {12}, doi = {10.1007/978-3-642-03816-7_36} }