{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:24Z","timestamp":1750306164653,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T00:00:00Z","timestamp":1482105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DFG project \u201cFoundations of Heterogenous Specifications Using State Machines and Temporal Logic,\u201d","award":["VO 615\/12-1"],"award-info":[{"award-number":["VO 615\/12-1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2017,5,31]]},"abstract":"<jats:p>Testing preorders on component specifications ensure that replacing a specification by a refined one does not introduce unwanted behavior in an overall system. Considering deadlocks as unwanted, the preorder can be characterized by a failure semantics on Labeled Transition Systems (LTSs). In previous work, we have generalized this to Modal Transition Systems (MTSs) with a new, MTS-specific testing idea. In the present article, we generalize this idea further to DMTS, a subclass of disjunctive MTSs. On the one hand, the testing preorder can be characterized by the same failure semantics, and dMTS have no additional expressivity in our setting. On the other hand, the technical treatment is significantly harder and, surprisingly, the preorder is not compositional.<\/jats:p>\n          <jats:p>Furthermore, we regard deadlocks and divergence (infinite unobservable runs) as unwanted and characterize the testing preorder with an unusual failure-divergence semantics. This preorder is already on LTSs strictly coarser\u2014and hence arguably better\u2014than the traditional failure-divergence preorder. It is a precongruence on dMTS, also for hiding, and much easier to handle than the deadlock-based preorder. It arises as well from a new variant of De Nicola\u2019s and Hennessy\u2019s must-testing.<\/jats:p>","DOI":"10.1145\/2984641","type":"journal-article","created":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T17:06:31Z","timestamp":1482167191000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Testing Preorders for dMTS"],"prefix":"10.1145","volume":"16","author":[{"given":"Ferenc","family":"Bujtor","sequence":"first","affiliation":[{"name":"Inst. f. Informatik. Universit\u00e4t Augsburg, Augsburg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lev","family":"Sorokin","sequence":"additional","affiliation":[{"name":"Inst. f. Informatik. Universit\u00e4t Augsburg, Augsburg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[{"name":"Inst. f. Informatik. Universit\u00e4t Augsburg, Augsburg"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,12,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/61211.61214"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_8"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2050917.2050936"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_7"},{"key":"e_1_2_1_5_1","unstructured":"Jan A. Bergstra Jan W. Klop and Ernst-R\u00fcdiger Olderog. 1987. Failures without chaos: A new process semantics for fair abstraction. In Formal Description of Programming Concepts III. North-Holland 77--103.  Jan A. Bergstra Jan W. Klop and Ernst-R\u00fcdiger Olderog. 1987. Failures without chaos: A new process semantics for fair abstraction. In Formal Description of Programming Concepts III. North-Holland 77--103."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.833"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.06.047"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746336"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264365"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2008.05.003"},{"volume-title":"Algebraic Theory of Processes","author":"Hennessy Matthew","key":"e_1_2_1_12_1","unstructured":"Matthew Hennessy . 1988. Algebraic Theory of Processes . MIT Press . Matthew Hennessy. 1988. Algebraic Theory of Processes. MIT Press."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/72579.72592"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392200.2392210"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1990.113738"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-9(3:4)2013"},{"key":"e_1_2_1_17_1","volume-title":"Comput. EASST 66","author":"L\u00fcttgen Gerald","year":"2013","unstructured":"Gerald L\u00fcttgen and Walter Vogler . 2013b. Richer interface automata with optimistic and pessimistic compatibility. Electron , Comput. EASST 66 ( 2013 ). Gerald L\u00fcttgen and Walter Vogler. 2013b. Richer interface automata with optimistic and pessimistic compatibility. Electron, Comput. EASST 66 (2013)."},{"volume-title":"Communication and Concurrency","author":"Milner Robin","key":"e_1_2_1_18_1","unstructured":"Robin Milner . 1989. Communication and Concurrency . Prentice Hall . I--XI, 1--260 pages. Robin Milner. 1989. Communication and Concurrency. Prentice Hall. I--XI, 1--260 pages."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3078-9_22"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00214-J"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/69304.69307"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/573359"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2984641","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2984641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:58Z","timestamp":1750217998000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2984641"}},"subtitle":["Deadlock- and the New Deadlock-\/DivergenceTesting"],"short-title":[],"issued":{"date-parts":[[2016,12,19]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5,31]]}},"alternative-id":["10.1145\/2984641"],"URL":"https:\/\/doi.org\/10.1145\/2984641","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2016,12,19]]},"assertion":[{"value":"2016-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-12-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}