Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A reactive system can be specified by a labelled transition system, which indicates static structure, along with temporal-logic formulas, which assert dynamic behaviour. But refining the former while preserving the latter can be difficult, because:(i) Labelled transition systems are ‘total’ – characterised up to bisimulation – meaning that no new transition structure can appear in a refinement.(ii) Alternatively, a refinement criterion not based on bisimulation might generate a refined transition system that violates the temporal properties.In response, Larsen and Thomson proposed modal transition systems, which are ‘partial’, and defined a refinement criterion that preserved formulas in Hennessy–Milner logic.  show that modal transition systems are, up to a saturation condition, exactly the mixed transition systems of Dams that meet a mix condition, and  extend such systems to non-flat state sets.  then solve a domain equation over the mixed pordomain whose solution is a bifinite domain that is universal for all saturated modal transition systems and is itself fully abstract when considered as a modal transition system.  demonstrate that many frameworks of partial systems can be translated into the domain: partial Kripke structures, partial bisimulation structures, Kripke modal transition systems, and pointer-shape-analysis graphs.
['Michael Huth', 'Radha Jagadeesan', 'David A. Schmidt']
I am writing a research paper on a idea A domain equation for refinement of partial systems
[{"from": "human", "value": "I am writing a research paper on a idea A domain equation for refinement of partial systems"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A reactive system can be specified by a labelled transition system, which indicates static structure, along with temporal-logic formulas, which assert dynamic behaviour. But refining the former while preserving the latter can be difficult, because:(i) Labelled transition systems are \u2018total\u2019 \u2013 characterised up to bisimulation \u2013 meaning that no new transition structure can appear in a refinement.(ii) Alternatively, a refinement criterion not based on bisimulation might generate a refined transition system that violates the temporal properties.In response, Larsen and Thomson proposed modal transition systems, which are \u2018partial\u2019, and defined a refinement criterion that preserved formulas in Hennessy\u2013Milner logic.  show that modal transition systems are, up to a saturation condition, exactly the mixed transition systems of Dams that meet a mix condition, and  extend such systems to non-flat state sets.  then solve a domain equation over the mixed pordomain whose solution is a bifinite domain that is universal for all saturated modal transition systems and is itself fully abstract when considered as a modal transition system.  demonstrate that many frameworks of partial systems can be translated into the domain: partial Kripke structures, partial bisimulation structures, Kripke modal transition systems, and pointer-shape-analysis graphs."}]