System InformaticsPub Date : 1900-01-01DOI: 10.31144/SI.2307-6410.2019.N14.P55-64
Aleksandr S. Tvardovskii, N. Yevtushenko
{"title":"ON PARALLEL COMPOSITION OF FINITE STATE MACHINES WITH TIMED GUARDS","authors":"Aleksandr S. Tvardovskii, N. Yevtushenko","doi":"10.31144/SI.2307-6410.2019.N14.P55-64","DOIUrl":"https://doi.org/10.31144/SI.2307-6410.2019.N14.P55-64","url":null,"abstract":"Finite State Machines (FSMs) are widely used for analysis and synthesis of digital components of control systems. In order to take into account time aspects, timed FSMs are considered. In this paper, we address the problem of deriving a parallel composition of FSMs with timed guards and output delays (output timeouts). When the parallel composition is considered, component FSMs work in the dialog mode and the composition produces an external output when interaction between components is terminated. In this work, we formally introduce the parallel composition operator for FSMs with timed guards (TFSM) and show that unlike classical FSMs, a \"slow environment\" and the absence of live-locks are not enough for describing the behavior of a composition of deterministic TFSMs by a deterministic FSM with a single clock. Although the set of deterministic FSMs with timed guards is not closed under the parallel composition operator, some classes of deterministic TFSMs are still closed under this operator.","PeriodicalId":398328,"journal":{"name":"System Informatics","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124892283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
System InformaticsPub Date : 1900-01-01DOI: 10.31144/si.2307-6410.2021.n18p85-92
Pavel Gennadievich Emelyanov
{"title":"CONJUNCTIVE DECOMPOSITION OF BOOLEAN FUNCTIONS: EXPERIMENTS WITH DIFFERENT REPRESENTATIONS","authors":"Pavel Gennadievich Emelyanov","doi":"10.31144/si.2307-6410.2021.n18p85-92","DOIUrl":"https://doi.org/10.31144/si.2307-6410.2021.n18p85-92","url":null,"abstract":"The article presents the results of experiments on the conjunctive decomposition of various representations of Boolean functions (ZDD, BDD, OKFDD, AIG) by methods that are derived by specializing the general decomposition algorithm. Test sets are random Boolean functions with various parameters, as well as a set of well-known benchmarks used to test algorithms for optimizing logic circuits. The comparison involves sequential and multi-threaded implementation of the algorithm.","PeriodicalId":398328,"journal":{"name":"System Informatics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121589522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
System InformaticsPub Date : 1900-01-01DOI: 10.31144/si.2307-6410.2021.n18.p53-84
V. Shelekhov
{"title":"COMPARISON OF AUTOMATA-BASED ENGINEERING METHOD AND EVENT-B MODELING METHOD","authors":"V. Shelekhov","doi":"10.31144/si.2307-6410.2021.n18.p53-84","DOIUrl":"https://doi.org/10.31144/si.2307-6410.2021.n18.p53-84","url":null,"abstract":"It is shown that a specification in the Event-B language can be represented by an automata-based program as a non-deterministic composition of simple conditional statements, which corresponds to a narrow subclass of automata-based programs. A specification in Event-B is monolithic. To build a specification, there are no other means of composition, except for a refinement that implements an extension of a previously built specification. Comparison of automata-based engineering method and Event-B modeling method is carried out on two example tasks. Previous solutions to the bridge traffic control problem in the Event-B system are complicated. A simpler solution with deductive verification in the Rodin tool is proposed. The effectiveness of the Event-B verification methods is confirmed by finding three non-trivial errors in our solution.","PeriodicalId":398328,"journal":{"name":"System Informatics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133933315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
