{"id":{"repo_id":"nus","oai_identifier":"oai:scholarbank.nus.edu.sg:10635/15474"},"canonical_url":"https://search.dev.ndltd.org/etd/nus/oai:scholarbank.nus.edu.sg:10635/15474","repository":{"repo_id":"nus","name":"National University of Singapore","base_url":"https://scholarbank.nus.edu.sg/oai/request"},"display":{"title":"Controller synthesis for reactive systems in distributed, real-time and hybrid settings","abstract":"We investigate controller synthesis in distributed, real-time and hybrid settings. In distributed setting, we prove that the monadic second order theory of the event structure unfolding of every system of connectedly communicating processes (CCP) is decidable. With this, we show that the distributed controller synthesis problem with CCPs is decidable for robust linear time specifications. And if distributed controllers exist, then finite state ones can be effectively synthesized. In real-time setting, we establish the decidability of admission controller synthesis with the preemptive EDF scheduling policy on a single processor; for both linear time temporal logic (LTL) or quantified propositional LTL (QPLTL) specifications. In hybrid setting, we show the decidability of controller synthesis for restricted differential hybrid automata (with no sensing delay), for both LTL and QPLTL specifications. In both real-time and hybrid settings, we prove that, if controllers exist, then finite state ones can be effectively synthesized.","abstract_html":"We investigate controller synthesis in distributed, real-time and hybrid settings. In distributed setting, we prove that the monadic second order theory of the event structure unfolding of every system of connectedly communicating processes (CCP) is decidable. With this, we show that the distributed controller synthesis problem with CCPs is decidable for robust linear time specifications. And if distributed controllers exist, then finite state ones can be effectively synthesized. In real-time setting, we establish the decidability of admission controller synthesis with the preemptive EDF scheduling policy on a single processor; for both linear time temporal logic (LTL) or quantified propositional LTL (QPLTL) specifications. In hybrid setting, we show the decidability of controller synthesis for restricted differential hybrid automata (with no sensing delay), for both LTL and QPLTL specifications. In both real-time and hybrid settings, we prove that, if controllers exist, then finite state ones can be effectively synthesized.","abstract_has_math":false,"creators":["YANG SHAOFA"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2006,"date_issued":"2006-07-14","date_published":"2006-07-14","updated_at":"2026-07-24T03:31:00Z","subjects":["open systems, controller synthesis, distributed systems, logic for concurrency, real-time systems, hybrid systems"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["YANG SHAOFA"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2006-07-14"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://scholarbank.nus.edu.sg/handle/10635/15474"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["open systems, controller synthesis, distributed systems, logic for concurrency, real-time systems, hybrid systems"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://scholarbank.nus.edu.sg/bitstreams/9795d81c-7e27-41c0-85e7-716b5e25a504/download"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We investigate controller synthesis in distributed, real-time and hybrid settings. In distributed setting, we prove that the monadic second order theory of the event structure unfolding of every system of connectedly communicating processes (CCP) is decidable. With this, we show that the distributed controller synthesis problem with CCPs is decidable for robust linear time specifications. And if distributed controllers exist, then finite state ones can be effectively synthesized. In real-time setting, we establish the decidability of admission controller synthesis with the preemptive EDF scheduling policy on a single processor; for both linear time temporal logic (LTL) or quantified propositional LTL (QPLTL) specifications. In hybrid setting, we show the decidability of controller synthesis for restricted differential hybrid automata (with no sensing delay), for both LTL and QPLTL specifications. In both real-time and hybrid settings, we prove that, if controllers exist, then finite state ones can be effectively synthesized."]},{"key":"dc:format.checksum.md5","label":"Dc Format Checksum Md5","values":["709199b63cb9250e2052d662ba8926bd","56f456d7ed0d3400ee0aee03ca63bb67"]},{"key":"dc:title","label":"Title","values":["Controller synthesis for reactive systems in distributed, real-time and hybrid settings"]}]}],"canonical_facts":{"dc:creator":["YANG SHAOFA"],"dc:date.issued":["2006-07-14"],"dc:description.abstract":["We investigate controller synthesis in distributed, real-time and hybrid settings. In distributed setting, we prove that the monadic second order theory of the event structure unfolding of every system of connectedly communicating processes (CCP) is decidable. With this, we show that the distributed controller synthesis problem with CCPs is decidable for robust linear time specifications. And if distributed controllers exist, then finite state ones can be effectively synthesized. In real-time setting, we establish the decidability of admission controller synthesis with the preemptive EDF scheduling policy on a single processor; for both linear time temporal logic (LTL) or quantified propositional LTL (QPLTL) specifications. In hybrid setting, we show the decidability of controller synthesis for restricted differential hybrid automata (with no sensing delay), for both LTL and QPLTL specifications. In both real-time and hybrid settings, we prove that, if controllers exist, then finite state ones can be effectively synthesized."],"dc:format.checksum.md5":["709199b63cb9250e2052d662ba8926bd","56f456d7ed0d3400ee0aee03ca63bb67"],"dc:identifier.uri":["https://scholarbank.nus.edu.sg/bitstreams/9795d81c-7e27-41c0-85e7-716b5e25a504/download"],"dc:relation.isreferencedby":["https://scholarbank.nus.edu.sg/handle/10635/15474"],"dc:subject":["open systems, controller synthesis, distributed systems, logic for concurrency, real-time systems, hybrid systems"],"dc:title":["Controller synthesis for reactive systems in distributed, real-time and hybrid settings"],"dc:type":["Thesis"]},"updated_at":"2026-07-24T03:31:00Z"}