Pub Date : 2014-06-16DOI: 10.1109/HSI.2014.6860481
I. Grobelna, M. Wiśniewska, R. Wiśniewski, M. Grobelny, P. Mroz
The article focuses on some aspects regarding logic controller design. Control process is formally specified using interpreted Petri nets. It is then formally verified against behavioral properties using model checking technique and temporal logic. Formal specification can also be documented as UML activity diagram. One can then benefit from advantages of both specification techniques - Petri nets with a wide range of mathematical support and user-friendly UML activity diagrams. An interpreted Petri net can also be decomposed into state machine components (SMCs), each of them to be implemented in a separate module of FPGA device.
{"title":"Decomposition, validation and documentation of control process specification in form of a Petri net","authors":"I. Grobelna, M. Wiśniewska, R. Wiśniewski, M. Grobelny, P. Mroz","doi":"10.1109/HSI.2014.6860481","DOIUrl":"https://doi.org/10.1109/HSI.2014.6860481","url":null,"abstract":"The article focuses on some aspects regarding logic controller design. Control process is formally specified using interpreted Petri nets. It is then formally verified against behavioral properties using model checking technique and temporal logic. Formal specification can also be documented as UML activity diagram. One can then benefit from advantages of both specification techniques - Petri nets with a wide range of mathematical support and user-friendly UML activity diagrams. An interpreted Petri net can also be decomposed into state machine components (SMCs), each of them to be implemented in a separate module of FPGA device.","PeriodicalId":448379,"journal":{"name":"2014 7th International Conference on Human System Interactions (HSI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122299861","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}
Pub Date : 2014-06-16DOI: 10.1109/HSI.2014.6860479
Lukasz Stefanowicz, M. Adamski
The paper discusses various aspects of selection of State Machine Components of a Petri net with the application of the theory of hypergraphs. First, the idea of selection of SM Components utilising the hypergraph apparatus is presented, then some examples of the exact transversal method, which has been successfully introduced as one of the alternative methods next to the exact algorithms (e.g. backtracking algorithm) that are commonly applied or approximate algorithms (e.g. greedy algorithm). The selection of subnets, which is essential for decomposition, is an NP-hard problem. In addition to the theoretical aspects, the article also presents the experimental research conducted in two phases. The first phase was designed to determine the effect of reduction, called Cyclic-Core, on the type of the selection hypergraph, on the basis of which the exact solution is later determined. The second part of the study deals with the efficiency and effectiveness of the exact transversal method, which provides a reference point, in comparison to the backtracking algorithm. The article has been complemented with a decent summary which includes: the issues discussed, the results of research, as well as references to the further stages of research.
{"title":"Aspects of selection of SM Components with the application of the theory of hypergraphs","authors":"Lukasz Stefanowicz, M. Adamski","doi":"10.1109/HSI.2014.6860479","DOIUrl":"https://doi.org/10.1109/HSI.2014.6860479","url":null,"abstract":"The paper discusses various aspects of selection of State Machine Components of a Petri net with the application of the theory of hypergraphs. First, the idea of selection of SM Components utilising the hypergraph apparatus is presented, then some examples of the exact transversal method, which has been successfully introduced as one of the alternative methods next to the exact algorithms (e.g. backtracking algorithm) that are commonly applied or approximate algorithms (e.g. greedy algorithm). The selection of subnets, which is essential for decomposition, is an NP-hard problem. In addition to the theoretical aspects, the article also presents the experimental research conducted in two phases. The first phase was designed to determine the effect of reduction, called Cyclic-Core, on the type of the selection hypergraph, on the basis of which the exact solution is later determined. The second part of the study deals with the efficiency and effectiveness of the exact transversal method, which provides a reference point, in comparison to the backtracking algorithm. The article has been complemented with a decent summary which includes: the issues discussed, the results of research, as well as references to the further stages of research.","PeriodicalId":448379,"journal":{"name":"2014 7th International Conference on Human System Interactions (HSI)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132332224","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}
Pub Date : 2014-06-16DOI: 10.1109/HSI.2014.6860491
L. Dalgaard
In this paper we give an introduction to robotic systems design using a value-based approach founded in Decision-Based Design, and motivate a broader systems view able to encompass the full socio-technical context. We present the multi-criteria decision method PAPRIKA as a candidate for handling decision and technology assessment elements in design, and through four cases we illustrate the versatility of the method and discuss its viability as a general purpose method for more general technology assessment in robotics.
{"title":"Technology assessment in robotic systems design using PAPRIKA","authors":"L. Dalgaard","doi":"10.1109/HSI.2014.6860491","DOIUrl":"https://doi.org/10.1109/HSI.2014.6860491","url":null,"abstract":"In this paper we give an introduction to robotic systems design using a value-based approach founded in Decision-Based Design, and motivate a broader systems view able to encompass the full socio-technical context. We present the multi-criteria decision method PAPRIKA as a candidate for handling decision and technology assessment elements in design, and through four cases we illustrate the versatility of the method and discuss its viability as a general purpose method for more general technology assessment in robotics.","PeriodicalId":448379,"journal":{"name":"2014 7th International Conference on Human System Interactions (HSI)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126167608","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}
Pub Date : 2014-06-16DOI: 10.1109/HSI.2014.6860482
L. Titarenko, O. Hebda, A. Barkalov
The proposed method is targeted on reduction of hardware amount in logic circuit of Moore finite-state machine implemented with programmable logic arrays (PLA). The method is based on using more than minimal amount of variables in codes of FSM internal states. The method includes two stages of state encoding. The second stage is connected with recoding of states inside each class of pseudoequivalent states.
{"title":"Design of Moore finite state machine with coding space stretching","authors":"L. Titarenko, O. Hebda, A. Barkalov","doi":"10.1109/HSI.2014.6860482","DOIUrl":"https://doi.org/10.1109/HSI.2014.6860482","url":null,"abstract":"The proposed method is targeted on reduction of hardware amount in logic circuit of Moore finite-state machine implemented with programmable logic arrays (PLA). The method is based on using more than minimal amount of variables in codes of FSM internal states. The method includes two stages of state encoding. The second stage is connected with recoding of states inside each class of pseudoequivalent states.","PeriodicalId":448379,"journal":{"name":"2014 7th International Conference on Human System Interactions (HSI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133122630","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：