Pub Date : 2005-09-12DOI: 10.1109/COASE.2005.1506739
M. Mahesh, J. Fuh, Y. Wong, H. Loh
This paper addresses an integrated rapid prototyping decision-making system (IRPDMS) based on fuzzy decision and benchmarking for selecting appropriate rapid prototyping and manufacturing (RP&M) processes. Data sets captured from benchmarking different RP&M processes are used in decision-making. The proposed IRPDMS provides decision support while interacting with an earlier developed benchmark database. Issues on standardizations and the purpose of using such standardized information datasets for offering decision support are discussed. Selection of five RP&M processes namely stereolithography (SLA), selective laser sintering (SLS), fused deposition modeling (FDM), laminated object manufacturing (LOM) and direct laser sintering (DLS) using the proposed IRPDMS is presented for the purpose of demonstration.
{"title":"Benchmarking for decision making in rapid prototyping systems","authors":"M. Mahesh, J. Fuh, Y. Wong, H. Loh","doi":"10.1109/COASE.2005.1506739","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506739","url":null,"abstract":"This paper addresses an integrated rapid prototyping decision-making system (IRPDMS) based on fuzzy decision and benchmarking for selecting appropriate rapid prototyping and manufacturing (RP&M) processes. Data sets captured from benchmarking different RP&M processes are used in decision-making. The proposed IRPDMS provides decision support while interacting with an earlier developed benchmark database. Issues on standardizations and the purpose of using such standardized information datasets for offering decision support are discussed. Selection of five RP&M processes namely stereolithography (SLA), selective laser sintering (SLS), fused deposition modeling (FDM), laminated object manufacturing (LOM) and direct laser sintering (DLS) using the proposed IRPDMS is presented for the purpose of demonstration.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123296917","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 : 2005-09-12DOI: 10.1109/COASE.2005.1506742
Sandeep Jain, N. Raghavan
In this paper, we concern ourselves with a production-inventory (PI) system consisting of a manufacturing plant and one warehouse which faces a stream of demands from customers. We present discrete-time queueing models which can be used for evaluating the performance of a given production-inventory system which processes customer orders with service times that are discrete random variables. This analysis can be embedded in an optimization model which can be used for designing efficient inventory policies. In particular we determine the optimal base-stock level at the warehouse that minimizes the long term total expected cost per unit time of carrying inventory, backorder cost associated with serving orders in the backlog queue. In an alternate model, we impose stock out as a service level constraint in terms of probability of stock out at the warehouse. In these models we assume that customers do not balk from the system. In this paper, the customers orders arriving at warehouse are assumed to Poisson process; the service process at the manufacturing plant has the distribution of a discrete random variable. Several examples are presented to validate the model and to illustrate its various features.
{"title":"Analysis of base-stock controlled production-inventory system using discrete-time queueing models","authors":"Sandeep Jain, N. Raghavan","doi":"10.1109/COASE.2005.1506742","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506742","url":null,"abstract":"In this paper, we concern ourselves with a production-inventory (PI) system consisting of a manufacturing plant and one warehouse which faces a stream of demands from customers. We present discrete-time queueing models which can be used for evaluating the performance of a given production-inventory system which processes customer orders with service times that are discrete random variables. This analysis can be embedded in an optimization model which can be used for designing efficient inventory policies. In particular we determine the optimal base-stock level at the warehouse that minimizes the long term total expected cost per unit time of carrying inventory, backorder cost associated with serving orders in the backlog queue. In an alternate model, we impose stock out as a service level constraint in terms of probability of stock out at the warehouse. In these models we assume that customers do not balk from the system. In this paper, the customers orders arriving at warehouse are assumed to Poisson process; the service process at the manufacturing plant has the distribution of a discrete random variable. Several examples are presented to validate the model and to illustrate its various features.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121680594","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 : 2005-09-12DOI: 10.1109/COASE.2005.1506802
Na Wei, Zhiwu Li
This paper focuses on the problem of deadlocks in automated flexible manufacturing systems (FMS). Based on Petri nets, a deadlock prevention policy is proposed for a special class of Petri nets, S3PR. We distinguish siphons in a net model by elementary and dependent ones. For each elementary siphon, a monitor is added to the plant model such that it is invariant controlled and the mathematical programming technique is employed to guarantee that no emptiable control-induced siphon is generated due to the addition of the monitor. This novel deadlock prevention policy can usually lead to a more permissive supervisor by adding a small number of monitors and arcs than the existing methods for the design of liveness enforcing Petri net supervisors. A flexible manufacturing example is utilized to illustrate the methods proposed in this paper.
{"title":"A deadlock prevention policy for FMS using mathematical programming","authors":"Na Wei, Zhiwu Li","doi":"10.1109/COASE.2005.1506802","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506802","url":null,"abstract":"This paper focuses on the problem of deadlocks in automated flexible manufacturing systems (FMS). Based on Petri nets, a deadlock prevention policy is proposed for a special class of Petri nets, S3PR. We distinguish siphons in a net model by elementary and dependent ones. For each elementary siphon, a monitor is added to the plant model such that it is invariant controlled and the mathematical programming technique is employed to guarantee that no emptiable control-induced siphon is generated due to the addition of the monitor. This novel deadlock prevention policy can usually lead to a more permissive supervisor by adding a small number of monitors and arcs than the existing methods for the design of liveness enforcing Petri net supervisors. A flexible manufacturing example is utilized to illustrate the methods proposed in this paper.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125617692","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 : 2005-09-12DOI: 10.1109/COASE.2005.1506796
M. Bonfè, C. Fantuzzi, C. Secchi
The paper describes a modeling language that aims to provide a unified framework for multi-domain physical systems coupled with computer-based control devices. The proposed modeling methodology is based on the cardinal principle of object orientation, which allows to describe both control software and physical components using the same basic concepts, particularly those of classes and interface ports.
{"title":"Object-oriented modeling of multi-domain systems","authors":"M. Bonfè, C. Fantuzzi, C. Secchi","doi":"10.1109/COASE.2005.1506796","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506796","url":null,"abstract":"The paper describes a modeling language that aims to provide a unified framework for multi-domain physical systems coupled with computer-based control devices. The proposed modeling methodology is based on the cardinal principle of object orientation, which allows to describe both control software and physical components using the same basic concepts, particularly those of classes and interface ports.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121646410","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 : 2005-09-12DOI: 10.1109/COASE.2005.1506772
S. Kameshwaran, Y. Narahari
e-Procurement is an Internet based business process for sourcing direct or indirect materials. This paper considers a procurement scenario of a buyer procuring large quantities of a single good. The suppliers submit nonconvex piecewise linear supply curves as their bids. Such bids enable the suppliers to effectively express their economies of scale and transportation constraints. The buyer imposes a business rule of limiting the winning suppliers within a preferred range. The bid evaluation problem faced by the buyer is to select the winning suppliers and their trading quantities, such that the cost of procurement is minimized while satisfying the supply, demand, and business constraints. The bid evaluation problem is NP-hard even for a simple special case. In this paper, the problem is formulated as a mixed integer linear programming problem and we propose a Lagrangian relaxation based heuristic to find a near optimal solution. The computational experiments performed on representative data sets show that the proposed heuristic produces a feasible solution with negligible optimality gap.
{"title":"A Lagrangian heuristic for bid evaluation in e-procurement auctions","authors":"S. Kameshwaran, Y. Narahari","doi":"10.1109/COASE.2005.1506772","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506772","url":null,"abstract":"e-Procurement is an Internet based business process for sourcing direct or indirect materials. This paper considers a procurement scenario of a buyer procuring large quantities of a single good. The suppliers submit nonconvex piecewise linear supply curves as their bids. Such bids enable the suppliers to effectively express their economies of scale and transportation constraints. The buyer imposes a business rule of limiting the winning suppliers within a preferred range. The bid evaluation problem faced by the buyer is to select the winning suppliers and their trading quantities, such that the cost of procurement is minimized while satisfying the supply, demand, and business constraints. The bid evaluation problem is NP-hard even for a simple special case. In this paper, the problem is formulated as a mixed integer linear programming problem and we propose a Lagrangian relaxation based heuristic to find a near optimal solution. The computational experiments performed on representative data sets show that the proposed heuristic produces a feasible solution with negligible optimality gap.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121763322","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 : 2005-09-12DOI: 10.1109/COASE.2005.1506797
Shengyong Wang, S. Chew, M. Lawley
For the past decade, deadlock-free resource allocation has been an active area of research in flexible manufacturing. For the most part, researchers have assumed that allocated resources do not fail, with little research addressing how partially functional manufacturing systems should be controlled. In our previous work, we developed supervisory controllers to ensure robust deadlock-free operation for systems with both single and multiple unreliable resources. These controllers guarantee that parts requiring failed resources do not block the production of parts not requiring failed resources. This previous work assumed that parts requiring failed resources could be advanced into failure dependent buffer space (buffer space dedicated exclusively to parts requiring unreliable resources). Supervisors admitted only those states for which such a sequence of advancements was feasible. The research presented in this paper relaxes this assumption, since in some systems providing failure dependent buffer space might be too expensive. Here, we concentrate on distributing parts requiring failed resources throughout the buffer space of shared resources, again so that they do not block the production of part types not requiring failed resources. To achieve this, we develop three resource regions: the region of continuous operation, the region of failure dependency, and the region of distribution. We then develop supervisors for each of these regions, take their conjunction, and prove that the conjunctive supervisor satisfies the properties required for robust control. The supervisors are variants of the resource order policy, a correct and scalable deadlock avoidance policy developed in earlier work. The approach presented here requires no state enumeration and is polynomial in stable measures of system size.
{"title":"Using shared resource capacity for robust control of failure prone manufacturing systems","authors":"Shengyong Wang, S. Chew, M. Lawley","doi":"10.1109/COASE.2005.1506797","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506797","url":null,"abstract":"For the past decade, deadlock-free resource allocation has been an active area of research in flexible manufacturing. For the most part, researchers have assumed that allocated resources do not fail, with little research addressing how partially functional manufacturing systems should be controlled. In our previous work, we developed supervisory controllers to ensure robust deadlock-free operation for systems with both single and multiple unreliable resources. These controllers guarantee that parts requiring failed resources do not block the production of parts not requiring failed resources. This previous work assumed that parts requiring failed resources could be advanced into failure dependent buffer space (buffer space dedicated exclusively to parts requiring unreliable resources). Supervisors admitted only those states for which such a sequence of advancements was feasible. The research presented in this paper relaxes this assumption, since in some systems providing failure dependent buffer space might be too expensive. Here, we concentrate on distributing parts requiring failed resources throughout the buffer space of shared resources, again so that they do not block the production of part types not requiring failed resources. To achieve this, we develop three resource regions: the region of continuous operation, the region of failure dependency, and the region of distribution. We then develop supervisors for each of these regions, take their conjunction, and prove that the conjunctive supervisor satisfies the properties required for robust control. The supervisors are variants of the resource order policy, a correct and scalable deadlock avoidance policy developed in earlier work. The approach presented here requires no state enumeration and is polynomial in stable measures of system size.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127688205","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 : 2005-09-12DOI: 10.1109/COASE.2005.1506789
Mianyu Wang, E. Lin, E. Woertz, M. Kam
Local operating networks (LonWorks) is a widely used industrial technology applied to distributed control, sensor, and actuator networks. LonWorks is based on ANSI/EIA standard 709.1, and uses the predictive p-persistent CSMA algorithm in the MAC sublayer for collision resolution and decentralized traffic control. In spite of its popularity, only a few design tools are available to simulate LonWorks architectures and predict their performance. In this paper, we describe a simulation model for the collision resolution algorithm of LonWorks, based on the OPNET modeler. We present the design framework, and develop a state variable representation and state transition diagrams that allow accurate simulation of performance and prediction of the algorithm's behavior. To validate our model, we compared its predictions to measurements from a physical LonWorks testbed and a Markov chain analytical model, and demonstrated a high level of agreement
{"title":"Collision resolution simulation for distributed control architectures using LonWorks","authors":"Mianyu Wang, E. Lin, E. Woertz, M. Kam","doi":"10.1109/COASE.2005.1506789","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506789","url":null,"abstract":"Local operating networks (LonWorks) is a widely used industrial technology applied to distributed control, sensor, and actuator networks. LonWorks is based on ANSI/EIA standard 709.1, and uses the predictive p-persistent CSMA algorithm in the MAC sublayer for collision resolution and decentralized traffic control. In spite of its popularity, only a few design tools are available to simulate LonWorks architectures and predict their performance. In this paper, we describe a simulation model for the collision resolution algorithm of LonWorks, based on the OPNET modeler. We present the design framework, and develop a state variable representation and state transition diagrams that allow accurate simulation of performance and prediction of the algorithm's behavior. To validate our model, we compared its predictions to measurements from a physical LonWorks testbed and a Markov chain analytical model, and demonstrated a high level of agreement","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124019247","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 : 2005-09-12DOI: 10.1109/COASE.2005.1506746
A. Peddi, Yuan F. Zheng, V. Cherezov, M. Caffrey
There is a strong need for setting up high-throughput crystallization screens to determine the optimum conditions for protein crystal growth. In the protein structure determination process, it is required to prepare precipitant solutions to obtain well-diffraction quality crystals. In the precipitant solutions preparation procedure, a set of precipitating salts or polyethylene glycol, buffers and additives are delivered in a set of wells depending on the concentration and composition of precipitant solution. In this paper, we have implemented various heuristics to provide an efficient and effective path for the dispensing tip of robotic system to deliver the solutions for achieving high-throughput. An extensive analysis of these heuristics in providing sub-optimal paths for different precipitant solution setups is conducted. We have also presented results showing the improvement in total distance traveled by the robot in setting up precipitant solution preparation in the high-throughput mode.
{"title":"Efficient and effective path for automated dispensing of bio-precipitant solutions","authors":"A. Peddi, Yuan F. Zheng, V. Cherezov, M. Caffrey","doi":"10.1109/COASE.2005.1506746","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506746","url":null,"abstract":"There is a strong need for setting up high-throughput crystallization screens to determine the optimum conditions for protein crystal growth. In the protein structure determination process, it is required to prepare precipitant solutions to obtain well-diffraction quality crystals. In the precipitant solutions preparation procedure, a set of precipitating salts or polyethylene glycol, buffers and additives are delivered in a set of wells depending on the concentration and composition of precipitant solution. In this paper, we have implemented various heuristics to provide an efficient and effective path for the dispensing tip of robotic system to deliver the solutions for achieving high-throughput. An extensive analysis of these heuristics in providing sub-optimal paths for different precipitant solution setups is conducted. We have also presented results showing the improvement in total distance traveled by the robot in setting up precipitant solution preparation in the high-throughput mode.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129236697","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 : 2005-09-12DOI: 10.1109/COASE.2005.1506795
Mathias Krefft, J. Hesselbach
Parallel kinematic machines have inherent advantages for many applications in the fields of robotics and machine tools. They obtain high dynamic capabilities combined with high accuracy and stiffness. But choosing the optimal mechanism dimensions for the best performance is still a challenging task. Furthermore there are a lot of performance criteria which have to be taken into account and which are pose dependent. The main idea of this paper is to present the fundamentals for a multi-criteria optimization approach for parallel kinematic machines according to given application requirements. Therefore we discuss a large number of performance criteria dealing with workspace, velocity transmission, inertia and stiffness. Finally the main idea of an optimization approach using evolutionary algorithms is shown.
{"title":"Elastodynamic optimization of parallel kinematics","authors":"Mathias Krefft, J. Hesselbach","doi":"10.1109/COASE.2005.1506795","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506795","url":null,"abstract":"Parallel kinematic machines have inherent advantages for many applications in the fields of robotics and machine tools. They obtain high dynamic capabilities combined with high accuracy and stiffness. But choosing the optimal mechanism dimensions for the best performance is still a challenging task. Furthermore there are a lot of performance criteria which have to be taken into account and which are pose dependent. The main idea of this paper is to present the fundamentals for a multi-criteria optimization approach for parallel kinematic machines according to given application requirements. Therefore we discuss a large number of performance criteria dealing with workspace, velocity transmission, inertia and stiffness. Finally the main idea of an optimization approach using evolutionary algorithms is shown.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133678976","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 : 2005-09-12DOI: 10.1109/COASE.2005.1506780
G. Cengic, K. Åkesson, B. Lennartson, Chengyin Yuan, P. Ferreira
One reason that the development of distributed control system is hard is that the communication primitives are at a low abstraction level. To put less burden on the developer it would be an advantage to have support for high-level communication primitives. One such primitive is the full synchronous composition (FSC) operator. This operator can be used to model the interaction between an arbitrary number of concurrently executing applications. This paper shows how to implement the FSC operator using an open communication standard for distributed control systems, IEC 61499. The operator is used in the supervisory control theory, a framework for automatic generation of provable correct supervisors. In manufacturing systems, for example, the supervisor might have to interact with a physically distributed plant. This paper concludes therefore by showing how to use the proposed implementation of the FSC operator to execute a supervisor against a physically distributed plant.
{"title":"Implementation of full synchronous composition using IEC 61499 function blocks","authors":"G. Cengic, K. Åkesson, B. Lennartson, Chengyin Yuan, P. Ferreira","doi":"10.1109/COASE.2005.1506780","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506780","url":null,"abstract":"One reason that the development of distributed control system is hard is that the communication primitives are at a low abstraction level. To put less burden on the developer it would be an advantage to have support for high-level communication primitives. One such primitive is the full synchronous composition (FSC) operator. This operator can be used to model the interaction between an arbitrary number of concurrently executing applications. This paper shows how to implement the FSC operator using an open communication standard for distributed control systems, IEC 61499. The operator is used in the supervisory control theory, a framework for automatic generation of provable correct supervisors. In manufacturing systems, for example, the supervisor might have to interact with a physically distributed plant. This paper concludes therefore by showing how to use the proposed implementation of the FSC operator to execute a supervisor against a physically distributed plant.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124207122","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
扫码关注我们
求助内容：
应助结果提醒方式：