{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:44:49Z","timestamp":1777902289206,"version":"3.51.4"},"reference-count":19,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2014,2,12]],"date-time":"2014-02-12T00:00:00Z","timestamp":1392163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:p>This paper introduces the Timed Sequential Machine (TSM) formalism. The TSM formalism is based on well-known sequential machines. It is less expressive than the Discrete Event System Specification formalism or Timed Automata, and it offers a set of concepts well adapted to intermediate abstraction levels that appear in the design or analysis processes of discrete event systems. In addition, timed extensions of testing and simplification methods for sequential machines can be defined and used in finite-state TSMs. After presenting the formal definition of a TSM and its behavior, methods are proposed for the minimization of completely specified finite-state TSMs and for the simplification of incompletely specified finite-state TSMs. Finally, it is demonstrated that the TSM formalism has the property of being closed under coupling. That is, any coupled TSM model can be described in terms of an atomic TSM model.<\/jats:p>","DOI":"10.1177\/0037549713519842","type":"journal-article","created":{"date-parts":[[2014,2,12]],"date-time":"2014-02-12T23:19:49Z","timestamp":1392247189000},"page":"337-352","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["An introduction to Timed Sequential Machines"],"prefix":"10.1177","volume":"90","author":[{"given":"Norbert","family":"Giambiasi","sequence":"first","affiliation":[{"name":"LSIS - University of Aix-Marseille, France; CIFASIS-CONICET, Argentina"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2014,2,12]]},"reference":[{"key":"bibr1-0037549713519842","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"bibr2-0037549713519842","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00173-4"},{"key":"bibr3-0037549713519842","first-page":"120","volume":"17","author":"Giambiasi N","year":"2000","journal-title":"Tran SCSI"},{"key":"bibr4-0037549713519842","doi-asserted-by":"crossref","unstructured":"Henzinger TA, Manna Z, Pnueli A. Timed transition systems in real time: theory in practice. Berlin: Springer, 1991, pp.226\u2013251.","DOI":"10.1007\/BFb0031995"},{"key":"bibr5-0037549713519842","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2006.05.004"},{"key":"bibr6-0037549713519842","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54430-5_103"},{"key":"bibr7-0037549713519842","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008387132377"},{"key":"bibr8-0037549713519842","volume-title":"Multifaceted modelling and discrete event simulation","author":"Zeigler BP","year":"1984"},{"key":"bibr9-0037549713519842","volume-title":"Theory of modelling and simulation","author":"Zeigler B","year":"2000","edition":"2"},{"key":"bibr10-0037549713519842","volume-title":"international simulation multi-conference (ISMc\u201909)","author":"Giambiasi N"},{"key":"bibr11-0037549713519842","volume-title":"Switching and finite automata theory","author":"Kohavi Z","year":"1978"},{"key":"bibr12-0037549713519842","doi-asserted-by":"publisher","DOI":"10.1109\/5.533956"},{"key":"bibr13-0037549713519842","unstructured":"Lynch NA, Vaandrager FW. Forward and backward simulations\u2014Part II: timing-based systems. Technical Report, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, August1995."},{"key":"bibr14-0037549713519842","doi-asserted-by":"publisher","DOI":"10.1109\/43.259940"},{"key":"bibr15-0037549713519842","doi-asserted-by":"publisher","DOI":"10.1108\/03684929810246053"},{"key":"bibr16-0037549713519842","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.223780"},{"key":"bibr17-0037549713519842","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0084802"},{"key":"bibr18-0037549713519842","first-page":"409","volume-title":"Proceedings of 2003 IEEE conference on systems, man, and cybernetics","author":"Hwang MH"},{"key":"bibr19-0037549713519842","first-page":"193","volume-title":"Robotics research trends","author":"Dacharry H","year":"2008"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549713519842","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0037549713519842","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549713519842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:25:14Z","timestamp":1777634714000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549713519842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,12]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["10.1177\/0037549713519842"],"URL":"https:\/\/doi.org\/10.1177\/0037549713519842","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,12]]}}}