Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Parametric systems arise in many application domains, from real-time systems to software to cyber-physical systems. Parameters are fundamental to model unknown quantities at design time and allow a designer to explore different instantiation of the system (i.e. every parameter valuation induces a different system), during the early development phases.#R##N#A key challenge is to automatically synthesize all the parameter valuations for which the system satisfies some properties. In this talk  focus on the parameter synthesis problem for infinite-state transition systems and invariant properties.  describe the synthesis algorithm Param IC3, which is based on IC3, one of the major recent breakthroughs in SAT-based model checking, and lately extended to the SMT case.#R##N#The algorithm follows a general approach that first builds the set of "bad" parameter valuations and then obtain the set of "good" valuations by complement. The approach enumerates the counterexamples that violate the property, extracting from each counterexample a region of bad parameter valuations, existentially quantifying the state variables. ParamIC3 follows the same principles, but it overcomes some limitations of the previous#R##N#approach by exploiting the IC3 features. First, IC3 may find a set of counterexamples s_o, ..., s_k, where each state in s_i is guaranteed to reach some of the bad states in s_k in k-i steps; this#R##N#is exploited to apply the expensive quantifier elimination on shortest, and thus more amenable, counterexamples. Second, the internal structure of IC3 allows our extension to be integrated in a#R##N#fully incremental fashion, never restarting the search from scratch to find a new counterexample.#R##N#While various approaches already solve the parameter synthesis problem for several kind of systems, like infinite-state transition systems, timed and hybrid automata, the advantages ParamIC3 are that: it synthesizes an optimal region of parameters, it avoids computing the whole set of the reachable states, it is incremental and applies quantifier elimination only to small formulas.#R##N# present the results of an experimental evaluation performed on benchmarks from the timed and hybrid systems domain.  compared the approach with similar SMT-based techniques and with techniques based on the computation of the reachable states. The results show the potential of our approach.
['Alessandro Cimatti', 'Alberto Griggio', 'Sergio Mover', 'Stefano Tonetta']
I am writing a research paper on a idea Parameter Synthesis with IC3 (Informal Presentation)
[{"from": "human", "value": "I am writing a research paper on a idea Parameter Synthesis with IC3 (Informal Presentation)"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Parametric systems arise in many application domains, from real-time systems to software to cyber-physical systems. Parameters are fundamental to model unknown quantities at design time and allow a designer to explore different instantiation of the system (i.e. every parameter valuation induces a different system), during the early development phases.#R##N#A key challenge is to automatically synthesize all the parameter valuations for which the system satisfies some properties. In this talk  focus on the parameter synthesis problem for infinite-state transition systems and invariant properties.  describe the synthesis algorithm Param IC3, which is based on IC3, one of the major recent breakthroughs in SAT-based model checking, and lately extended to the SMT case.#R##N#The algorithm follows a general approach that first builds the set of \"bad\" parameter valuations and then obtain the set of \"good\" valuations by complement. The approach enumerates the counterexamples that violate the property, extracting from each counterexample a region of bad parameter valuations, existentially quantifying the state variables. ParamIC3 follows the same principles, but it overcomes some limitations of the previous#R##N#approach by exploiting the IC3 features. First, IC3 may find a set of counterexamples s_o, ..., s_k, where each state in s_i is guaranteed to reach some of the bad states in s_k in k-i steps; this#R##N#is exploited to apply the expensive quantifier elimination on shortest, and thus more amenable, counterexamples. Second, the internal structure of IC3 allows our extension to be integrated in a#R##N#fully incremental fashion, never restarting the search from scratch to find a new counterexample.#R##N#While various approaches already solve the parameter synthesis problem for several kind of systems, like infinite-state transition systems, timed and hybrid automata, the advantages ParamIC3 are that: it synthesizes an optimal region of parameters, it avoids computing the whole set of the reachable states, it is incremental and applies quantifier elimination only to small formulas.#R##N# present the results of an experimental evaluation performed on benchmarks from the timed and hybrid systems domain.  compared the approach with similar SMT-based techniques and with techniques based on the computation of the reachable states. The results show the potential of our approach."}]