{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T03:17:56Z","timestamp":1699931876635},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,10]]},"abstract":"<jats:p> A theory of representation of semiautomata by canonical words and equivalences was developed in [7]. That work was motivated by trace-assertion specifications of software modules, but its focus was entirely on the underlying mathematical model. In the present paper we extend that theory to automata with Moore and Mealy outputs, and show how to apply the extended theory to the specification of modules. In particular, we present a unified view of the trace-assertion methodology, as guided by our theory. We illustrate this approach, and some specific issues, using several nontrivial examples. We include a discussion of finite versus infinite modules, methods of error handling, some awkward features of the trace-assertion method, and a comparison to specifications by automata. While specifications by trace assertions and automata are equivalent in power, there are cases where one approach appears to be more natural than the other. We conclude that, for certain types of system modules, formal specification by automata, as opposed to informal state machines, is not only possible, but practical. <\/jats:p>","DOI":"10.1142\/s0129054107005133","type":"journal-article","created":{"date-parts":[[2007,9,21]],"date-time":"2007-09-21T05:49:00Z","timestamp":1190353740000},"page":"1065-1087","source":"Crossref","is-referenced-by-count":6,"title":["REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES"],"prefix":"10.1142","volume":"18","author":[{"given":"JANUSZ","family":"BRZOZOWSKI","sequence":"first","affiliation":[{"name":"David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HELMUT","family":"J\u00dcRGENSEN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Western Ontario, London, Ontario, N6A 5B7, Canada"},{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Potsdam, August-Bebel-Str. 89, 14482 Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08934-9_80"},{"key":"rf3","unstructured":"W.\u00a0Bartussek and D. L.\u00a0Parnas, Software Fundamentals (Collected Works by D. L. Parnas), eds. D. M.\u00a0Hoffman and D. M.\u00a0Weiss (Addison-Wesley, 2001)\u00a0pp. 9\u201328."},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.01.040"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054105003327"},{"key":"rf8","first-page":"91","volume":"6","author":"B\u00fcchi J. R.","journal-title":"Archiv f\u00fcr Math. Logik und Grundla-genforschung"},{"key":"rf9","volume-title":"Finite Automata, Their Algebras and Grammars","author":"B\u00fcchi J. R.","year":"1988"},{"key":"rf10","volume-title":"UML Distilled \u2013 A Brief Guide to the Standard Object Modeling Language","author":"Fowler M.","year":"2000"},{"key":"rf11","unstructured":"J. V.\u00a0Guttag, E.\u00a0Horowitz and R.\u00a0Musser, Current Trends in Programming Methodology\u00a0IV (Prentice-Hall, 1978)\u00a0pp. 60\u201379."},{"key":"rf12","first-page":"1102","volume":"34","author":"Hoffman D.","journal-title":"IEEE Trans. Computers"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1109\/32.6168"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1109\/32.935852"},{"key":"rf17","volume-title":"Switching and Finite Automata Theory","author":"Kohavi Z.","year":"1978"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1145\/828.829"},{"key":"rf21","doi-asserted-by":"crossref","first-page":"37","DOI":"10.3233\/JCS-1992-1103","volume":"1","author":"McLean J.","journal-title":"Journal of Computer Security"},{"key":"rf25","volume-title":"Abstract Automata","author":"Starke P. H.","year":"1972"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1109\/32.328996"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1109\/52.663783"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054107005133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:41:53Z","timestamp":1565124113000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107005133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":18,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,10]]}},"alternative-id":["10.1142\/S0129054107005133"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107005133","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10]]}}}