The firing squad synchronization problem with sub-generals
The Firing Squad Synchronization Problem (FSSP), one of the most well-known problems related to cellular automata, was originally proposed by Myhill in 1957 and became famous through the work of Moore. The first solution to this problem was given by Minsky and McCarthy, and a minimal time solution w...
Gespeichert in:
| Veröffentlicht in: | Information processing letters 2014-01, Vol.114 (1-2), p.60-65 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 65 |
|---|---|
| container_issue | 1-2 |
| container_start_page | 60 |
| container_title | Information processing letters |
| container_volume | 114 |
| creator | Yamashita, Kazuya Nishitani, Yasuaki Hirose, Sadaki Okawa, Satoshi Osato, Nobuyasu |
| description | The Firing Squad Synchronization Problem (FSSP), one of the most well-known problems related to cellular automata, was originally proposed by Myhill in 1957 and became famous through the work of Moore. The first solution to this problem was given by Minsky and McCarthy, and a minimal time solution was given by Goto. A considerable amount of research has also dealt with variants of this problem. In this paper, we introduce a new state called the sub-general to the original problem and propose the FSSP with sub-generals. In particular, we consider the case of one sub-general and determine the position of the sub-general in the array that minimizes the synchronization time. Moreover, we determine the minimal time to solve this problem and show that there exists no minimal time solution for any length of array. However, we show that the total time of our algorithm approaches arbitrarily close to the minimal time. |
| doi_str_mv | 10.1016/j.ipl.2013.08.003 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1531029324</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020019013002196</els_id><sourcerecordid>3136407641</sourcerecordid><originalsourceid>FETCH-LOGICAL-c353t-163fde3d0e9ec176cfba39993d3c74d54073c92ce9a4a5a5803e84eb39a7c19d3</originalsourceid><addsrcrecordid>eNp9kLtOw0AQRVcIJELgA-gs0dDYzHj8WqgQ4iVFogn1arMeJxs5drJrg8LXsyhUFFS3OXd05whxiZAgYHGzTuy2TVJASqBKAOhITLAq07hAlMdiApBCDCjhVJx5vwaAIqNyIm7nK44a62y3jPxu1HXk951Zub6zX3qwfRdtXb9oeRN92mEV-XERL7ljp1t_Lk6aEHzxm1Px_vQ4f3iJZ2_Prw_3s9hQTkOMBTU1Uw0s2WBZmGahSUpJNZkyq_MMSjIyNSx1pnOdV0BcZbwgqUuDsqapuD7cDUt2I_tBbaw33La64370CnNCSCWlWUCv_qDrfnRdWKcwK5AKKioMFB4o43rvHTdq6-xGu71CUD821VoFm-rHpoJKBZuhc3focPj0w7JT3ljuDNfWsRlU3dt_2t9jInxG</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1461363681</pqid></control><display><type>article</type><title>The firing squad synchronization problem with sub-generals</title><source>Elsevier ScienceDirect Journals</source><creator>Yamashita, Kazuya ; Nishitani, Yasuaki ; Hirose, Sadaki ; Okawa, Satoshi ; Osato, Nobuyasu</creator><creatorcontrib>Yamashita, Kazuya ; Nishitani, Yasuaki ; Hirose, Sadaki ; Okawa, Satoshi ; Osato, Nobuyasu</creatorcontrib><description>The Firing Squad Synchronization Problem (FSSP), one of the most well-known problems related to cellular automata, was originally proposed by Myhill in 1957 and became famous through the work of Moore. The first solution to this problem was given by Minsky and McCarthy, and a minimal time solution was given by Goto. A considerable amount of research has also dealt with variants of this problem. In this paper, we introduce a new state called the sub-general to the original problem and propose the FSSP with sub-generals. In particular, we consider the case of one sub-general and determine the position of the sub-general in the array that minimizes the synchronization time. Moreover, we determine the minimal time to solve this problem and show that there exists no minimal time solution for any length of array. However, we show that the total time of our algorithm approaches arbitrarily close to the minimal time.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/j.ipl.2013.08.003</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Arrays ; Cellular automata ; Cellular automaton ; Computer science ; Data processing ; Firing ; Firing squad synchronization problem ; Mathematical problems ; Studies ; Synchronism ; Synchronization ; Time management</subject><ispartof>Information processing letters, 2014-01, Vol.114 (1-2), p.60-65</ispartof><rights>2013 The Authors</rights><rights>Copyright Elsevier Sequoia S.A. Jan/Feb 2014</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c353t-163fde3d0e9ec176cfba39993d3c74d54073c92ce9a4a5a5803e84eb39a7c19d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ipl.2013.08.003$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,3536,27903,27904,45974</link.rule.ids></links><search><creatorcontrib>Yamashita, Kazuya</creatorcontrib><creatorcontrib>Nishitani, Yasuaki</creatorcontrib><creatorcontrib>Hirose, Sadaki</creatorcontrib><creatorcontrib>Okawa, Satoshi</creatorcontrib><creatorcontrib>Osato, Nobuyasu</creatorcontrib><title>The firing squad synchronization problem with sub-generals</title><title>Information processing letters</title><description>The Firing Squad Synchronization Problem (FSSP), one of the most well-known problems related to cellular automata, was originally proposed by Myhill in 1957 and became famous through the work of Moore. The first solution to this problem was given by Minsky and McCarthy, and a minimal time solution was given by Goto. A considerable amount of research has also dealt with variants of this problem. In this paper, we introduce a new state called the sub-general to the original problem and propose the FSSP with sub-generals. In particular, we consider the case of one sub-general and determine the position of the sub-general in the array that minimizes the synchronization time. Moreover, we determine the minimal time to solve this problem and show that there exists no minimal time solution for any length of array. However, we show that the total time of our algorithm approaches arbitrarily close to the minimal time.</description><subject>Algorithms</subject><subject>Arrays</subject><subject>Cellular automata</subject><subject>Cellular automaton</subject><subject>Computer science</subject><subject>Data processing</subject><subject>Firing</subject><subject>Firing squad synchronization problem</subject><subject>Mathematical problems</subject><subject>Studies</subject><subject>Synchronism</subject><subject>Synchronization</subject><subject>Time management</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNp9kLtOw0AQRVcIJELgA-gs0dDYzHj8WqgQ4iVFogn1arMeJxs5drJrg8LXsyhUFFS3OXd05whxiZAgYHGzTuy2TVJASqBKAOhITLAq07hAlMdiApBCDCjhVJx5vwaAIqNyIm7nK44a62y3jPxu1HXk951Zub6zX3qwfRdtXb9oeRN92mEV-XERL7ljp1t_Lk6aEHzxm1Px_vQ4f3iJZ2_Prw_3s9hQTkOMBTU1Uw0s2WBZmGahSUpJNZkyq_MMSjIyNSx1pnOdV0BcZbwgqUuDsqapuD7cDUt2I_tBbaw33La64370CnNCSCWlWUCv_qDrfnRdWKcwK5AKKioMFB4o43rvHTdq6-xGu71CUD821VoFm-rHpoJKBZuhc3focPj0w7JT3ljuDNfWsRlU3dt_2t9jInxG</recordid><startdate>20140101</startdate><enddate>20140101</enddate><creator>Yamashita, Kazuya</creator><creator>Nishitani, Yasuaki</creator><creator>Hirose, Sadaki</creator><creator>Okawa, Satoshi</creator><creator>Osato, Nobuyasu</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140101</creationdate><title>The firing squad synchronization problem with sub-generals</title><author>Yamashita, Kazuya ; Nishitani, Yasuaki ; Hirose, Sadaki ; Okawa, Satoshi ; Osato, Nobuyasu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c353t-163fde3d0e9ec176cfba39993d3c74d54073c92ce9a4a5a5803e84eb39a7c19d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Arrays</topic><topic>Cellular automata</topic><topic>Cellular automaton</topic><topic>Computer science</topic><topic>Data processing</topic><topic>Firing</topic><topic>Firing squad synchronization problem</topic><topic>Mathematical problems</topic><topic>Studies</topic><topic>Synchronism</topic><topic>Synchronization</topic><topic>Time management</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yamashita, Kazuya</creatorcontrib><creatorcontrib>Nishitani, Yasuaki</creatorcontrib><creatorcontrib>Hirose, Sadaki</creatorcontrib><creatorcontrib>Okawa, Satoshi</creatorcontrib><creatorcontrib>Osato, Nobuyasu</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yamashita, Kazuya</au><au>Nishitani, Yasuaki</au><au>Hirose, Sadaki</au><au>Okawa, Satoshi</au><au>Osato, Nobuyasu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The firing squad synchronization problem with sub-generals</atitle><jtitle>Information processing letters</jtitle><date>2014-01-01</date><risdate>2014</risdate><volume>114</volume><issue>1-2</issue><spage>60</spage><epage>65</epage><pages>60-65</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>The Firing Squad Synchronization Problem (FSSP), one of the most well-known problems related to cellular automata, was originally proposed by Myhill in 1957 and became famous through the work of Moore. The first solution to this problem was given by Minsky and McCarthy, and a minimal time solution was given by Goto. A considerable amount of research has also dealt with variants of this problem. In this paper, we introduce a new state called the sub-general to the original problem and propose the FSSP with sub-generals. In particular, we consider the case of one sub-general and determine the position of the sub-general in the array that minimizes the synchronization time. Moreover, we determine the minimal time to solve this problem and show that there exists no minimal time solution for any length of array. However, we show that the total time of our algorithm approaches arbitrarily close to the minimal time.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ipl.2013.08.003</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 2014-01, Vol.114 (1-2), p.60-65 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1531029324 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithms Arrays Cellular automata Cellular automaton Computer science Data processing Firing Firing squad synchronization problem Mathematical problems Studies Synchronism Synchronization Time management |
| title | The firing squad synchronization problem with sub-generals |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T00%3A11%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20firing%20squad%20synchronization%20problem%20with%20sub-generals&rft.jtitle=Information%20processing%20letters&rft.au=Yamashita,%20Kazuya&rft.date=2014-01-01&rft.volume=114&rft.issue=1-2&rft.spage=60&rft.epage=65&rft.pages=60-65&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/j.ipl.2013.08.003&rft_dat=%3Cproquest_cross%3E3136407641%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1461363681&rft_id=info:pmid/&rft_els_id=S0020019013002196&rfr_iscdi=true |