{"title":"Simplified modeling of manufacturing systems: an introduction to sensor activation graphs","authors":"Tord Alenljung, B. Lennartson","doi":"10.1109/COASE.2005.1506779","DOIUrl":null,"url":null,"abstract":"This paper presents a graphical modeling formalism, sensor activation graphs, which simplifies the design of discrete event models for a class of physical systems common within manufacturing industry. Sensor activation graphs captures, in an intuitive way, the relations between binary sensors, the physical entities that activate them, and the actuators of the system. Models expressed as sensor activation graphs are in most cases significantly simpler than corresponding automata or Petri net models. The presented formalism support two levels of detail, one that gives the general view on the order of sensor activation, and one with full control semantics that incorporates guard conditions on transitions. In addition, an algorithm for converting sensor activation graphs into a number of small deterministic finite state automata is presented.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Automation Science and Engineering, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2005.1506779","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
This paper presents a graphical modeling formalism, sensor activation graphs, which simplifies the design of discrete event models for a class of physical systems common within manufacturing industry. Sensor activation graphs captures, in an intuitive way, the relations between binary sensors, the physical entities that activate them, and the actuators of the system. Models expressed as sensor activation graphs are in most cases significantly simpler than corresponding automata or Petri net models. The presented formalism support two levels of detail, one that gives the general view on the order of sensor activation, and one with full control semantics that incorporates guard conditions on transitions. In addition, an algorithm for converting sensor activation graphs into a number of small deterministic finite state automata is presented.