On determinism in modal transition systems

Modal transition system (MTS) is a formalism which extends the classical notion of labelled transition systems by introducing transitions of two types: must transitions that have to be present in any implementation of the MTS and may transitions that are allowed but not required. The MTS framework h...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science 2009-09, Vol.410 (41), p.4026-4043
Hauptverfasser: Beneš, N., Křetínský, J., Larsen, K.G., Srba, J.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 4043
container_issue 41
container_start_page 4026
container_title Theoretical computer science
container_volume 410
creator Beneš, N.
Křetínský, J.
Larsen, K.G.
Srba, J.
description Modal transition system (MTS) is a formalism which extends the classical notion of labelled transition systems by introducing transitions of two types: must transitions that have to be present in any implementation of the MTS and may transitions that are allowed but not required. The MTS framework has proved to be useful as a specification formalism of component-based systems as it supports compositional verification and stepwise refinement. Nevertheless, there are some limitations of the theory, namely that the naturally defined notions of modal refinement and modal composition are incomplete with respect to the semantic view based on the sets of the implementations of a given MTS specification. Recent work indicates that some of these limitations might be overcome by considering deterministic systems, which seem to be more manageable but still interesting for several application areas. In the present article, we provide a comprehensive account of the MTS framework in the deterministic setting. We study a number of problems previously considered on MTS and point out to what extend we can expect better results under the restriction of determinism.
doi_str_mv 10.1016/j.tcs.2009.06.009
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_34775114</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0304397509004010</els_id><sourcerecordid>34775114</sourcerecordid><originalsourceid>FETCH-LOGICAL-c401t-64e1c71c6fb2e9b34fdd76bb9f312c9861dfadd2f07894a237c9085cf61059053</originalsourceid><addsrcrecordid>eNp9kEtLAzEUhYMoWKs_wN1sdCHMmNckDa6k-IJCN7oOmTwgZR41NxX6701pcendnM13zuUchG4Jbggm4nHTZAsNxVg1WDRFztCMLKSqKVX8HM0ww7xmSraX6Apgg8u1UszQw3qsnM8-DXGMMFRxrIbJmb7KyYwQc5zGCvaQ_QDX6CKYHvzNSefo6_Xlc_ler9ZvH8vnVW05JrkW3BMriRWho151jAfnpOg6FRihVi0EccE4RwOWC8UNZdIqvGhtEAS3Crdsju6Puds0fe88ZD1EsL7vzeinHWjGpWwJ4QUkR9CmCSD5oLcpDibtNcH6sIre6LKKPqyisdBFiufuFG7Amj6UljbCn5ESRRlhuHBPR86Xpj_RJw02-tF6F5O3Wbsp_vPlF1Y_do4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>34775114</pqid></control><display><type>article</type><title>On determinism in modal transition systems</title><source>Elsevier ScienceDirect Journals</source><source>EZB Electronic Journals Library</source><creator>Beneš, N. ; Křetínský, J. ; Larsen, K.G. ; Srba, J.</creator><creatorcontrib>Beneš, N. ; Křetínský, J. ; Larsen, K.G. ; Srba, J.</creatorcontrib><description>Modal transition system (MTS) is a formalism which extends the classical notion of labelled transition systems by introducing transitions of two types: must transitions that have to be present in any implementation of the MTS and may transitions that are allowed but not required. The MTS framework has proved to be useful as a specification formalism of component-based systems as it supports compositional verification and stepwise refinement. Nevertheless, there are some limitations of the theory, namely that the naturally defined notions of modal refinement and modal composition are incomplete with respect to the semantic view based on the sets of the implementations of a given MTS specification. Recent work indicates that some of these limitations might be overcome by considering deterministic systems, which seem to be more manageable but still interesting for several application areas. In the present article, we provide a comprehensive account of the MTS framework in the deterministic setting. We study a number of problems previously considered on MTS and point out to what extend we can expect better results under the restriction of determinism.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/j.tcs.2009.06.009</identifier><identifier>CODEN: TCSCDI</identifier><language>eng</language><publisher>Oxford: Elsevier B.V</publisher><subject>Applied sciences ; Compositional verification ; Computer science; control theory; systems ; Consistency ; Deterministic specifications ; Exact sciences and technology ; Language theory and syntactical analysis ; Miscellaneous ; Modal transition systems ; Refinement ; Software ; Software engineering ; Theoretical computing</subject><ispartof>Theoretical computer science, 2009-09, Vol.410 (41), p.4026-4043</ispartof><rights>2009 Elsevier B.V.</rights><rights>2009 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c401t-64e1c71c6fb2e9b34fdd76bb9f312c9861dfadd2f07894a237c9085cf61059053</citedby><cites>FETCH-LOGICAL-c401t-64e1c71c6fb2e9b34fdd76bb9f312c9861dfadd2f07894a237c9085cf61059053</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0304397509004010$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,3536,27903,27904,65309</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=21923130$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Beneš, N.</creatorcontrib><creatorcontrib>Křetínský, J.</creatorcontrib><creatorcontrib>Larsen, K.G.</creatorcontrib><creatorcontrib>Srba, J.</creatorcontrib><title>On determinism in modal transition systems</title><title>Theoretical computer science</title><description>Modal transition system (MTS) is a formalism which extends the classical notion of labelled transition systems by introducing transitions of two types: must transitions that have to be present in any implementation of the MTS and may transitions that are allowed but not required. The MTS framework has proved to be useful as a specification formalism of component-based systems as it supports compositional verification and stepwise refinement. Nevertheless, there are some limitations of the theory, namely that the naturally defined notions of modal refinement and modal composition are incomplete with respect to the semantic view based on the sets of the implementations of a given MTS specification. Recent work indicates that some of these limitations might be overcome by considering deterministic systems, which seem to be more manageable but still interesting for several application areas. In the present article, we provide a comprehensive account of the MTS framework in the deterministic setting. We study a number of problems previously considered on MTS and point out to what extend we can expect better results under the restriction of determinism.</description><subject>Applied sciences</subject><subject>Compositional verification</subject><subject>Computer science; control theory; systems</subject><subject>Consistency</subject><subject>Deterministic specifications</subject><subject>Exact sciences and technology</subject><subject>Language theory and syntactical analysis</subject><subject>Miscellaneous</subject><subject>Modal transition systems</subject><subject>Refinement</subject><subject>Software</subject><subject>Software engineering</subject><subject>Theoretical computing</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLAzEUhYMoWKs_wN1sdCHMmNckDa6k-IJCN7oOmTwgZR41NxX6701pcendnM13zuUchG4Jbggm4nHTZAsNxVg1WDRFztCMLKSqKVX8HM0ww7xmSraX6Apgg8u1UszQw3qsnM8-DXGMMFRxrIbJmb7KyYwQc5zGCvaQ_QDX6CKYHvzNSefo6_Xlc_ler9ZvH8vnVW05JrkW3BMriRWho151jAfnpOg6FRihVi0EccE4RwOWC8UNZdIqvGhtEAS3Crdsju6Puds0fe88ZD1EsL7vzeinHWjGpWwJ4QUkR9CmCSD5oLcpDibtNcH6sIre6LKKPqyisdBFiufuFG7Amj6UljbCn5ESRRlhuHBPR86Xpj_RJw02-tF6F5O3Wbsp_vPlF1Y_do4</recordid><startdate>20090915</startdate><enddate>20090915</enddate><creator>Beneš, N.</creator><creator>Křetínský, J.</creator><creator>Larsen, K.G.</creator><creator>Srba, J.</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>IQODW</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>20090915</creationdate><title>On determinism in modal transition systems</title><author>Beneš, N. ; Křetínský, J. ; Larsen, K.G. ; Srba, J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c401t-64e1c71c6fb2e9b34fdd76bb9f312c9861dfadd2f07894a237c9085cf61059053</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Applied sciences</topic><topic>Compositional verification</topic><topic>Computer science; control theory; systems</topic><topic>Consistency</topic><topic>Deterministic specifications</topic><topic>Exact sciences and technology</topic><topic>Language theory and syntactical analysis</topic><topic>Miscellaneous</topic><topic>Modal transition systems</topic><topic>Refinement</topic><topic>Software</topic><topic>Software engineering</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Beneš, N.</creatorcontrib><creatorcontrib>Křetínský, J.</creatorcontrib><creatorcontrib>Larsen, K.G.</creatorcontrib><creatorcontrib>Srba, J.</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>Pascal-Francis</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>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Beneš, N.</au><au>Křetínský, J.</au><au>Larsen, K.G.</au><au>Srba, J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On determinism in modal transition systems</atitle><jtitle>Theoretical computer science</jtitle><date>2009-09-15</date><risdate>2009</risdate><volume>410</volume><issue>41</issue><spage>4026</spage><epage>4043</epage><pages>4026-4043</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><coden>TCSCDI</coden><abstract>Modal transition system (MTS) is a formalism which extends the classical notion of labelled transition systems by introducing transitions of two types: must transitions that have to be present in any implementation of the MTS and may transitions that are allowed but not required. The MTS framework has proved to be useful as a specification formalism of component-based systems as it supports compositional verification and stepwise refinement. Nevertheless, there are some limitations of the theory, namely that the naturally defined notions of modal refinement and modal composition are incomplete with respect to the semantic view based on the sets of the implementations of a given MTS specification. Recent work indicates that some of these limitations might be overcome by considering deterministic systems, which seem to be more manageable but still interesting for several application areas. In the present article, we provide a comprehensive account of the MTS framework in the deterministic setting. We study a number of problems previously considered on MTS and point out to what extend we can expect better results under the restriction of determinism.</abstract><cop>Oxford</cop><pub>Elsevier B.V</pub><doi>10.1016/j.tcs.2009.06.009</doi><tpages>18</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0304-3975
ispartof Theoretical computer science, 2009-09, Vol.410 (41), p.4026-4043
issn 0304-3975
1879-2294
language eng
recordid cdi_proquest_miscellaneous_34775114
source Elsevier ScienceDirect Journals; EZB Electronic Journals Library
subjects Applied sciences
Compositional verification
Computer science
control theory
systems
Consistency
Deterministic specifications
Exact sciences and technology
Language theory and syntactical analysis
Miscellaneous
Modal transition systems
Refinement
Software
Software engineering
Theoretical computing
title On determinism in modal transition systems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T20%3A20%3A00IST&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=On%20determinism%20in%20modal%20transition%20systems&rft.jtitle=Theoretical%20computer%20science&rft.au=Bene%C5%A1,%20N.&rft.date=2009-09-15&rft.volume=410&rft.issue=41&rft.spage=4026&rft.epage=4043&rft.pages=4026-4043&rft.issn=0304-3975&rft.eissn=1879-2294&rft.coden=TCSCDI&rft_id=info:doi/10.1016/j.tcs.2009.06.009&rft_dat=%3Cproquest_cross%3E34775114%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=34775114&rft_id=info:pmid/&rft_els_id=S0304397509004010&rfr_iscdi=true