Polychronous automata and their use for formal validation of AADL models
This paper investigates how state diagrams can be best represented in the polychronous model of computation (MoC) and proposes to use this model for code validation of behavior specifications in architecture analysis & design language (AADL). In this relational MoC, the basic objects are signals...
Gespeichert in:
| Veröffentlicht in: | Frontiers of Computer Science 2019-08, Vol.13 (4), p.677-697 |
|---|---|
| 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 | 697 |
|---|---|
| container_issue | 4 |
| container_start_page | 677 |
| container_title | Frontiers of Computer Science |
| container_volume | 13 |
| creator | GAUTIER, Thierry GUY, Clément HONORAT, Alexandre LE GUERNIC, Paul TALPIN, Jean-Pierre BESNARD, Loïc |
| description | This paper investigates how state diagrams can be best represented in the polychronous model of computation (MoC) and proposes to use this model for code validation of behavior specifications in architecture analysis & design language (AADL). In this relational MoC, the basic objects are signals, which are related through dataflow equations. Signals are associated with logical clocks, which provide the capability to describe systems in which components obey multiple clock rates. We propose a model of finite-state automata, called polychronous automata, which is based on clock relationships. A specificity of this model is that an automaton is submitted to clock constraints, which allows one to specify a wide range of control-related configurations, being either reactive or restrictive with respect to their control environment. A semantic model is defined for these polychronous automata, which relies on boolean algebra of clocks. Based on a previously defined modeling method for AADL software architectures using the polychronous MoC, the proposed model is used as a formal model for the AADL behavior annex. This is illustrated with a case study involving an adaptive cruise control system. |
| doi_str_mv | 10.1007/s11704-017-6134-5 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_01411257v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918720399</sourcerecordid><originalsourceid>FETCH-LOGICAL-c442t-9b3bc6a086720cd5870684b4fbc7954efa2034fcb9b7614ec94ae3bc49a53a483</originalsourceid><addsrcrecordid>eNp9kE1rwyAAhmVssNL1B-wm7LRDNjUa4zF0Hx0EtsN2FpNok5LETpNC__0MKd2tB1HkeV5eXgDuMXrCCPFnjzFHNEKYRwmOacSuwIIgwSJC4uT6_CbpLVh5v0MIEUQYI2QBNl-2PZa1s70dPVTjYDs1KKj6Cg61bhwcvYbGuul0qoUH1TaVGhrbQ2tglr3ksLOVbv0duDGq9Xp1upfg5-31e72J8s_3j3WWRyWlZIhEERdlolCacILKiqUcJSktqClKLhjVRhEUU1MWouAJproUVOmgUKFYrGgaL8HjnFurVu5d0yl3lFY1cpPlcvpDmGJMGD_gwD7M7N7Z31H7Qe7s6PpQTxKB09AgFiJQeKZKZ7132pxjMZLTvnLeNyRzOe0rWXDI7PjA9lvt_pMvSemperOttdPV3mnvpQnjD412l9Q_Wh2NbQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918720399</pqid></control><display><type>article</type><title>Polychronous automata and their use for formal validation of AADL models</title><source>ProQuest Central UK/Ireland</source><source>SpringerLink Journals - AutoHoldings</source><source>ProQuest Central</source><creator>GAUTIER, Thierry ; GUY, Clément ; HONORAT, Alexandre ; LE GUERNIC, Paul ; TALPIN, Jean-Pierre ; BESNARD, Loïc</creator><creatorcontrib>GAUTIER, Thierry ; GUY, Clément ; HONORAT, Alexandre ; LE GUERNIC, Paul ; TALPIN, Jean-Pierre ; BESNARD, Loïc</creatorcontrib><description>This paper investigates how state diagrams can be best represented in the polychronous model of computation (MoC) and proposes to use this model for code validation of behavior specifications in architecture analysis & design language (AADL). In this relational MoC, the basic objects are signals, which are related through dataflow equations. Signals are associated with logical clocks, which provide the capability to describe systems in which components obey multiple clock rates. We propose a model of finite-state automata, called polychronous automata, which is based on clock relationships. A specificity of this model is that an automaton is submitted to clock constraints, which allows one to specify a wide range of control-related configurations, being either reactive or restrictive with respect to their control environment. A semantic model is defined for these polychronous automata, which relies on boolean algebra of clocks. Based on a previously defined modeling method for AADL software architectures using the polychronous MoC, the proposed model is used as a formal model for the AADL behavior annex. This is illustrated with a case study involving an adaptive cruise control system.</description><identifier>ISSN: 2095-2228</identifier><identifier>EISSN: 2095-2236</identifier><identifier>DOI: 10.1007/s11704-017-6134-5</identifier><language>eng</language><publisher>Beijing: Higher Education Press</publisher><subject>AADL ; Adaptive control ; architecture modeling ; Boolean algebra ; Clocks ; Clocks & watches ; code generation ; Computation and Language ; Computer Science ; Cruise control ; finitestate automaton ; formal semantics ; polychronous model ; Research Article ; synchronous concurrency</subject><ispartof>Frontiers of Computer Science, 2019-08, Vol.13 (4), p.677-697</ispartof><rights>Copyright reserved, 2018, Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature</rights><rights>Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature 2018</rights><rights>Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature 2018.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c442t-9b3bc6a086720cd5870684b4fbc7954efa2034fcb9b7614ec94ae3bc49a53a483</citedby><cites>FETCH-LOGICAL-c442t-9b3bc6a086720cd5870684b4fbc7954efa2034fcb9b7614ec94ae3bc49a53a483</cites><orcidid>0000-0001-5875-7258 ; 0000-0002-0556-4265</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11704-017-6134-5$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918720399?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>230,314,780,784,885,21388,27924,27925,33744,41488,42557,43805,51319,64385,64389,72469</link.rule.ids><backlink>$$Uhttps://inria.hal.science/hal-01411257$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>GAUTIER, Thierry</creatorcontrib><creatorcontrib>GUY, Clément</creatorcontrib><creatorcontrib>HONORAT, Alexandre</creatorcontrib><creatorcontrib>LE GUERNIC, Paul</creatorcontrib><creatorcontrib>TALPIN, Jean-Pierre</creatorcontrib><creatorcontrib>BESNARD, Loïc</creatorcontrib><title>Polychronous automata and their use for formal validation of AADL models</title><title>Frontiers of Computer Science</title><addtitle>Front. Comput. Sci</addtitle><description>This paper investigates how state diagrams can be best represented in the polychronous model of computation (MoC) and proposes to use this model for code validation of behavior specifications in architecture analysis & design language (AADL). In this relational MoC, the basic objects are signals, which are related through dataflow equations. Signals are associated with logical clocks, which provide the capability to describe systems in which components obey multiple clock rates. We propose a model of finite-state automata, called polychronous automata, which is based on clock relationships. A specificity of this model is that an automaton is submitted to clock constraints, which allows one to specify a wide range of control-related configurations, being either reactive or restrictive with respect to their control environment. A semantic model is defined for these polychronous automata, which relies on boolean algebra of clocks. Based on a previously defined modeling method for AADL software architectures using the polychronous MoC, the proposed model is used as a formal model for the AADL behavior annex. This is illustrated with a case study involving an adaptive cruise control system.</description><subject>AADL</subject><subject>Adaptive control</subject><subject>architecture modeling</subject><subject>Boolean algebra</subject><subject>Clocks</subject><subject>Clocks & watches</subject><subject>code generation</subject><subject>Computation and Language</subject><subject>Computer Science</subject><subject>Cruise control</subject><subject>finitestate automaton</subject><subject>formal semantics</subject><subject>polychronous model</subject><subject>Research Article</subject><subject>synchronous concurrency</subject><issn>2095-2228</issn><issn>2095-2236</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kE1rwyAAhmVssNL1B-wm7LRDNjUa4zF0Hx0EtsN2FpNok5LETpNC__0MKd2tB1HkeV5eXgDuMXrCCPFnjzFHNEKYRwmOacSuwIIgwSJC4uT6_CbpLVh5v0MIEUQYI2QBNl-2PZa1s70dPVTjYDs1KKj6Cg61bhwcvYbGuul0qoUH1TaVGhrbQ2tglr3ksLOVbv0duDGq9Xp1upfg5-31e72J8s_3j3WWRyWlZIhEERdlolCacILKiqUcJSktqClKLhjVRhEUU1MWouAJproUVOmgUKFYrGgaL8HjnFurVu5d0yl3lFY1cpPlcvpDmGJMGD_gwD7M7N7Z31H7Qe7s6PpQTxKB09AgFiJQeKZKZ7132pxjMZLTvnLeNyRzOe0rWXDI7PjA9lvt_pMvSemperOttdPV3mnvpQnjD412l9Q_Wh2NbQ</recordid><startdate>20190801</startdate><enddate>20190801</enddate><creator>GAUTIER, Thierry</creator><creator>GUY, Clément</creator><creator>HONORAT, Alexandre</creator><creator>LE GUERNIC, Paul</creator><creator>TALPIN, Jean-Pierre</creator><creator>BESNARD, Loïc</creator><general>Higher Education Press</general><general>Springer Nature B.V</general><general>Springer Verlag</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0001-5875-7258</orcidid><orcidid>https://orcid.org/0000-0002-0556-4265</orcidid></search><sort><creationdate>20190801</creationdate><title>Polychronous automata and their use for formal validation of AADL models</title><author>GAUTIER, Thierry ; GUY, Clément ; HONORAT, Alexandre ; LE GUERNIC, Paul ; TALPIN, Jean-Pierre ; BESNARD, Loïc</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c442t-9b3bc6a086720cd5870684b4fbc7954efa2034fcb9b7614ec94ae3bc49a53a483</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>AADL</topic><topic>Adaptive control</topic><topic>architecture modeling</topic><topic>Boolean algebra</topic><topic>Clocks</topic><topic>Clocks & watches</topic><topic>code generation</topic><topic>Computation and Language</topic><topic>Computer Science</topic><topic>Cruise control</topic><topic>finitestate automaton</topic><topic>formal semantics</topic><topic>polychronous model</topic><topic>Research Article</topic><topic>synchronous concurrency</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>GAUTIER, Thierry</creatorcontrib><creatorcontrib>GUY, Clément</creatorcontrib><creatorcontrib>HONORAT, Alexandre</creatorcontrib><creatorcontrib>LE GUERNIC, Paul</creatorcontrib><creatorcontrib>TALPIN, Jean-Pierre</creatorcontrib><creatorcontrib>BESNARD, Loïc</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>Frontiers of Computer Science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>GAUTIER, Thierry</au><au>GUY, Clément</au><au>HONORAT, Alexandre</au><au>LE GUERNIC, Paul</au><au>TALPIN, Jean-Pierre</au><au>BESNARD, Loïc</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Polychronous automata and their use for formal validation of AADL models</atitle><jtitle>Frontiers of Computer Science</jtitle><stitle>Front. Comput. Sci</stitle><date>2019-08-01</date><risdate>2019</risdate><volume>13</volume><issue>4</issue><spage>677</spage><epage>697</epage><pages>677-697</pages><issn>2095-2228</issn><eissn>2095-2236</eissn><abstract>This paper investigates how state diagrams can be best represented in the polychronous model of computation (MoC) and proposes to use this model for code validation of behavior specifications in architecture analysis & design language (AADL). In this relational MoC, the basic objects are signals, which are related through dataflow equations. Signals are associated with logical clocks, which provide the capability to describe systems in which components obey multiple clock rates. We propose a model of finite-state automata, called polychronous automata, which is based on clock relationships. A specificity of this model is that an automaton is submitted to clock constraints, which allows one to specify a wide range of control-related configurations, being either reactive or restrictive with respect to their control environment. A semantic model is defined for these polychronous automata, which relies on boolean algebra of clocks. Based on a previously defined modeling method for AADL software architectures using the polychronous MoC, the proposed model is used as a formal model for the AADL behavior annex. This is illustrated with a case study involving an adaptive cruise control system.</abstract><cop>Beijing</cop><pub>Higher Education Press</pub><doi>10.1007/s11704-017-6134-5</doi><tpages>21</tpages><orcidid>https://orcid.org/0000-0001-5875-7258</orcidid><orcidid>https://orcid.org/0000-0002-0556-4265</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2095-2228 |
| ispartof | Frontiers of Computer Science, 2019-08, Vol.13 (4), p.677-697 |
| issn | 2095-2228 2095-2236 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_01411257v1 |
| source | ProQuest Central UK/Ireland; SpringerLink Journals - AutoHoldings; ProQuest Central |
| subjects | AADL Adaptive control architecture modeling Boolean algebra Clocks Clocks & watches code generation Computation and Language Computer Science Cruise control finitestate automaton formal semantics polychronous model Research Article synchronous concurrency |
| title | Polychronous automata and their use for formal validation of AADL models |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T12%3A50%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Polychronous%20automata%20and%20their%20use%20for%20formal%20validation%20of%20AADL%20models&rft.jtitle=Frontiers%20of%20Computer%20Science&rft.au=GAUTIER,%20Thierry&rft.date=2019-08-01&rft.volume=13&rft.issue=4&rft.spage=677&rft.epage=697&rft.pages=677-697&rft.issn=2095-2228&rft.eissn=2095-2236&rft_id=info:doi/10.1007/s11704-017-6134-5&rft_dat=%3Cproquest_hal_p%3E2918720399%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918720399&rft_id=info:pmid/&rfr_iscdi=true |