Filters
Year range
-chevron_right GOField of Science [Beta] (7)
description Publicationkeyboard_double_arrow_right Preprint , Article 2012 Czech Republic, NetherlandsElsevier BV Authors: Jan Komenda; Tomáš Masopust; Jan H. van Schuppen;Jan Komenda; Tomáš Masopust; Jan H. van Schuppen;handle: 11104/0213494
The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to extend the common alphabet so that the language becomes conditionally decomposable. A relationship of conditional decomposability to nonblockingness of modular discrete-event systems is also discussed in this paper in the general settings. It is shown that conditional decomposability is a weaker condition than nonblockingness. Comment: A few minor corrections
arXiv.org e-Print Ar... arrow_drop_down Repository of the Czech Academy of SciencesArticle . 2012Data sources: Repository of the Czech Academy of SciencesSystems & Control LettersArticle . 2012add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.sysconle.2012.07.013&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu30 citations 30 popularity Average influence Top 10% impulse Top 10% Powered by BIP!
more_vert arXiv.org e-Print Ar... arrow_drop_down Repository of the Czech Academy of SciencesArticle . 2012Data sources: Repository of the Czech Academy of SciencesSystems & Control LettersArticle . 2012add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.sysconle.2012.07.013&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu
Loading
description Publicationkeyboard_double_arrow_right Preprint , Article 2012 Czech Republic, NetherlandsElsevier BV Authors: Jan Komenda; Tomáš Masopust; Jan H. van Schuppen;Jan Komenda; Tomáš Masopust; Jan H. van Schuppen;handle: 11104/0213494
The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to extend the common alphabet so that the language becomes conditionally decomposable. A relationship of conditional decomposability to nonblockingness of modular discrete-event systems is also discussed in this paper in the general settings. It is shown that conditional decomposability is a weaker condition than nonblockingness. Comment: A few minor corrections
arXiv.org e-Print Ar... arrow_drop_down Repository of the Czech Academy of SciencesArticle . 2012Data sources: Repository of the Czech Academy of SciencesSystems & Control LettersArticle . 2012add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.sysconle.2012.07.013&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu30 citations 30 popularity Average influence Top 10% impulse Top 10% Powered by BIP!
more_vert arXiv.org e-Print Ar... arrow_drop_down Repository of the Czech Academy of SciencesArticle . 2012Data sources: Repository of the Czech Academy of SciencesSystems & Control LettersArticle . 2012add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.sysconle.2012.07.013&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu