{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:18:49Z","timestamp":1778498329875,"version":"3.51.4"},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,2]]},"abstract":"<jats:p> Hybrid systems combine continuous and discrete behavior. Hybrid Automata are a powerful formalism for the modeling and verification of such systems. A common problem in hybrid system verification is the good parameters problem, which consists in identifying a set of parameter valuations which guarantee a certain behavior of a system. Recently, a method has been presented for attacking this problem for Timed Automata. In this paper, we show the extension of this methodology for hybrid automata with linear and affine dynamics. The method is demonstrated with a hybrid system benchmark from the literature. <\/jats:p>","DOI":"10.1142\/s0129054113400091","type":"journal-article","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T07:23:44Z","timestamp":1370244224000},"page":"233-249","source":"Crossref","is-referenced-by-count":9,"title":["PARAMETRIC VERIFICATION AND TEST COVERAGE FOR HYBRID AUTOMATA USING THE INVERSE METHOD"],"prefix":"10.1142","volume":"24","author":[{"given":"LAURENT","family":"FRIBOURG","sequence":"first","affiliation":[{"name":"Laboratoire Specification et V\u00e9rification, CNRS &amp; ENS de Cachan, 61 avenue du Pr\u00e9sident Wilson, 94235 Cachan, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ULRICH","family":"K\u00dcHNE","sequence":"additional","affiliation":[{"name":"Group for Computer Architecture, University of Bremen, Bibliothekstra\u00dfe 1, 28359 Bremen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,6,3]]},"reference":[{"issue":"5","key":"p_5","first-page":"819","volume":"20","author":"Andr\u00e9 E.","year":"2009","journal-title":"IJFCS"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.033"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-007-0062-x"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050008"},{"key":"p_17","first-page":"183","volume":"52","author":"Hune T.","year":"2002","journal-title":"JLAP"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113400091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:57:40Z","timestamp":1565182660000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113400091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":5,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2013,6,3]]},"published-print":{"date-parts":[[2013,2]]}},"alternative-id":["10.1142\/S0129054113400091"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113400091","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2]]}}}