Pub Date : 2000-03-15DOI: 10.1016/S0928-4869(00)00009-4
Jan Hlavička , Stanislav Racek , Pavel Herout
The paper presents a study of several alternatives of a fault-tolerant process controller design. We compare controller architectures based on different amount of hardware redundancy with those using time redundancy. The system behaviour is evaluated by means of a process-oriented simulation model enabling software injection of faults. As an overall measure of controller design quality (which includes both performance and reliability) we use the numerical error of the output. The results obtained on the model are used to show the dependence of the output error upon the relative speed of computation and upon the rate of faults damaging the data. Thus for every set of parameters, a system configuration which gives the best results, can be determined.
{"title":"Evaluation of process controller fault tolerance using simulation","authors":"Jan Hlavička , Stanislav Racek , Pavel Herout","doi":"10.1016/S0928-4869(00)00009-4","DOIUrl":"10.1016/S0928-4869(00)00009-4","url":null,"abstract":"<div><p>The paper presents a study of several alternatives of a fault-tolerant process controller design. We compare controller architectures based on different amount of hardware redundancy with those using time redundancy. The system behaviour is evaluated by means of a process-oriented simulation model enabling software injection of faults. As an overall measure of controller design quality (which includes both performance and reliability) we use the numerical error of the output. The results obtained on the model are used to show the dependence of the output error upon the relative speed of computation and upon the rate of faults damaging the data. Thus for every set of parameters, a system configuration which gives the best results, can be determined.</p></div>","PeriodicalId":101162,"journal":{"name":"Simulation Practice and Theory","volume":"7 8","pages":"Pages 769-790"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0928-4869(00)00009-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74444808","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 : 2000-03-15DOI: 10.1016/S0928-4869(00)00015-X
{"title":"Index","authors":"","doi":"10.1016/S0928-4869(00)00015-X","DOIUrl":"https://doi.org/10.1016/S0928-4869(00)00015-X","url":null,"abstract":"","PeriodicalId":101162,"journal":{"name":"Simulation Practice and Theory","volume":"7 8","pages":"Pages 795-797"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0928-4869(00)00015-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136850651","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 : 2000-03-15DOI: 10.1016/S0928-4869(00)00016-1
{"title":"Index","authors":"","doi":"10.1016/S0928-4869(00)00016-1","DOIUrl":"https://doi.org/10.1016/S0928-4869(00)00016-1","url":null,"abstract":"","PeriodicalId":101162,"journal":{"name":"Simulation Practice and Theory","volume":"7 8","pages":"Pages 791-794"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0928-4869(00)00016-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136850652","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 : 2000-02-15DOI: 10.1016/S0928-4869(99)00031-2
Granino A Korn
We replace the classical procedure for recursive linear interpolation with a technique based on simple fuzzy-set logic. This approach makes it much easier to construct multi-input interpolation procedures. The resulting function generators produce the same output as the classical formulas with slightly fewer CPU cycles if we precompute and store some coefficients before the simulation. Lin and Zhang's algorithm [K.-C. Lin, B. Zhang, Simulation 68 (3) (1997) 157–163], which precomputes and stores more interpolation-polynomial parameters, is even faster but requires much more runtime storage in the case of large function tables.
我们用一种基于简单模糊集逻辑的技术取代了经典的递归线性插值方法。这种方法使构造多输入插值过程变得容易得多。如果我们在模拟之前预先计算并存储一些系数,那么所得到的函数生成器将产生与经典公式相同的输出,并且CPU周期略少。林和张的算法[k - c]。Lin, B. Zhang, Simulation 68(3)(1997) 157-163],它预先计算和存储更多的插值多项式参数,甚至更快,但在大型函数表的情况下需要更多的运行时存储。
{"title":"Simplified function generators based on fuzzy-logic interpolation","authors":"Granino A Korn","doi":"10.1016/S0928-4869(99)00031-2","DOIUrl":"10.1016/S0928-4869(99)00031-2","url":null,"abstract":"<div><p>We replace the classical procedure for recursive linear interpolation with a technique based on simple fuzzy-set logic. This approach makes it much easier to construct multi-input interpolation procedures. The resulting function generators produce the same output as the classical formulas with slightly fewer CPU cycles if we precompute and store some coefficients before the simulation. Lin and Zhang's algorithm [K.-C. Lin, B. Zhang, Simulation 68 (3) (1997) 157–163], which precomputes and stores more interpolation-polynomial parameters, is even faster but requires much more runtime storage in the case of large function tables.</p></div>","PeriodicalId":101162,"journal":{"name":"Simulation Practice and Theory","volume":"7 7","pages":"Pages 709-717"},"PeriodicalIF":0.0,"publicationDate":"2000-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0928-4869(99)00031-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77313055","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 : 2000-02-15DOI: 10.1016/S0928-4869(99)00032-4
Fernando Soares Lameiras
The tool of iteration function systems (IFS) was explored to simulate particle coarsening. This approach avoids assumptions like the mean field and the continuity equation for the particle size distribution. The stochastic character of the transport of mass, growing and dissolving of particles was taken into consideration. Studies of the interface-controlled and diffusion-controlled coarsening are presented. The usual theoretical asymptotic characteristics of particle coarsening were obtained, although the resulted size distributions showed differences that should be investigated. The IFS seems to be a powerful tool to simulate complex coarsening cases in a more simple way than other approaches.
{"title":"Simulation of particle coarsening with iteration function systems","authors":"Fernando Soares Lameiras","doi":"10.1016/S0928-4869(99)00032-4","DOIUrl":"10.1016/S0928-4869(99)00032-4","url":null,"abstract":"<div><p>The tool of iteration function systems (IFS) was explored to simulate particle coarsening. This approach avoids assumptions like the mean field and the continuity equation for the particle size distribution. The stochastic character of the transport of mass, growing and dissolving of particles was taken into consideration. Studies of the interface-controlled and diffusion-controlled coarsening are presented. The usual theoretical asymptotic characteristics of particle coarsening were obtained, although the resulted size distributions showed differences that should be investigated. The IFS seems to be a powerful tool to simulate complex coarsening cases in a more simple way than other approaches.</p></div>","PeriodicalId":101162,"journal":{"name":"Simulation Practice and Theory","volume":"7 7","pages":"Pages 719-728"},"PeriodicalIF":0.0,"publicationDate":"2000-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0928-4869(99)00032-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88515303","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 : 2000-02-15DOI: 10.1016/S0928-4869(99)00030-0
H. Madadi Kojabadi , G. Ahrabian
In the present paper the behavior of the interior permanent magnet synchronous motor (IPMSM) fed by a current controlled voltage source inverter under static and dynamic conditions is presented. A method is explained, which estimates the rotor position angles and rotating speeds at several conditions by measuring the instantaneous values of stator voltages and currents. The estimator is an extended Kalman filter (EKF). The simulation results under four different dynamic conditions, namely the starting, loading of the motor, reversing of speed, and starting with unknown initial rotor position value, are presented.
{"title":"Simulation and analysis of the interior permanent magnet synchronous motor as a brushless AC-drive","authors":"H. Madadi Kojabadi , G. Ahrabian","doi":"10.1016/S0928-4869(99)00030-0","DOIUrl":"10.1016/S0928-4869(99)00030-0","url":null,"abstract":"<div><p>In the present paper the behavior of the interior permanent magnet synchronous motor (IPMSM) fed by a current controlled voltage source inverter under static and dynamic conditions is presented. A method is explained, which estimates the rotor position angles and rotating speeds at several conditions by measuring the instantaneous values of stator voltages and currents. The estimator is an extended Kalman filter (EKF). The simulation results under four different dynamic conditions, namely the starting, loading of the motor, reversing of speed, and starting with unknown initial rotor position value, are presented.</p></div>","PeriodicalId":101162,"journal":{"name":"Simulation Practice and Theory","volume":"7 7","pages":"Pages 691-707"},"PeriodicalIF":0.0,"publicationDate":"2000-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0928-4869(99)00030-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87619758","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 : 2000-02-15DOI: 10.1016/S0928-4869(99)00020-8
T. Perera, K. Liyanage
Computer simulation is a well-established decision support tool in the manufacturing industry. The rapid development and deployment of simulation models however, are inhibited by factors such as inefficient data collection, lengthy model documentation, and poorly planned experimentation. Typically, more than one third of project time is spent on identification, collection, validation, and analysis of input data. Whilst most research work has been focused on statistical techniques for data analysis, less attention has been paid to the development of systematic approaches to input data gathering. This paper presents a methodology for rapid identification and collection of input data in batch manufacturing environments. A functional module library and a reference data model, both developed using the IDEF (Integrated computer aided manufacturing DEFinition) family of constructs, are the core elements of the methodology. The paper also identifies the major causes behind the inefficient collection of data.
{"title":"Methodology for rapid identification and collection of input data in the simulation of manufacturing systems","authors":"T. Perera, K. Liyanage","doi":"10.1016/S0928-4869(99)00020-8","DOIUrl":"10.1016/S0928-4869(99)00020-8","url":null,"abstract":"<div><p>Computer simulation is a well-established decision support tool in the manufacturing industry. The rapid development and deployment of simulation models however, are inhibited by factors such as inefficient data collection, lengthy model documentation, and poorly planned experimentation. Typically, more than one third of project time is spent on identification, collection, validation, and analysis of input data. Whilst most research work has been focused on statistical techniques for data analysis, less attention has been paid to the development of systematic approaches to input data gathering. This paper presents a methodology for rapid identification and collection of input data in batch manufacturing environments. A functional module library and a reference data model, both developed using the IDEF (Integrated computer aided manufacturing DEFinition) family of constructs, are the core elements of the methodology. The paper also identifies the major causes behind the inefficient collection of data.</p></div>","PeriodicalId":101162,"journal":{"name":"Simulation Practice and Theory","volume":"7 7","pages":"Pages 645-656"},"PeriodicalIF":0.0,"publicationDate":"2000-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0928-4869(99)00020-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76998570","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 : 2000-02-15DOI: 10.1016/S0928-4869(99)00029-4
Jon-Paul Voroney , Anna T. Lawniczak
We construct a reactive lattice-gas cellular automaton (LGCA) for reaction–diffusion systems and provide extensive discussion of its software coding aspects. The software coding aspects provide rationale for some choices in the construction of LGCA which has been inspired by molecular dynamics. Portability of the C language source code, of the data structures, and of the data formats is discussed and explained. We illustrate the ideas behind the development of LGCA and its code by considering a particular reacting system, the Sel'kov model with immobile complexing species. We demonstrate usefulness of LGCA modelling of reactive systems by presenting various simulation results. We compare these results with the standard numerical simulations of reaction–diffusion equations. We conclude the paper by discussing how LGCA methodology can be applied and extended to other contexts.
{"title":"Construction, mathematical description and coding of reactive lattice-gas cellular automaton","authors":"Jon-Paul Voroney , Anna T. Lawniczak","doi":"10.1016/S0928-4869(99)00029-4","DOIUrl":"10.1016/S0928-4869(99)00029-4","url":null,"abstract":"<div><p>We construct a reactive lattice-gas cellular automaton (LGCA) for reaction–diffusion systems and provide extensive discussion of its software coding aspects. The software coding aspects provide rationale for some choices in the construction of LGCA which has been inspired by molecular dynamics. Portability of the C language source code, of the data structures, and of the data formats is discussed and explained. We illustrate the ideas behind the development of LGCA and its code by considering a particular reacting system, the Sel'kov model with immobile complexing species. We demonstrate usefulness of LGCA modelling of reactive systems by presenting various simulation results. We compare these results with the standard numerical simulations of reaction–diffusion equations. We conclude the paper by discussing how LGCA methodology can be applied and extended to other contexts.</p></div>","PeriodicalId":101162,"journal":{"name":"Simulation Practice and Theory","volume":"7 7","pages":"Pages 657-689"},"PeriodicalIF":0.0,"publicationDate":"2000-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0928-4869(99)00029-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82060233","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 : 2000-02-15DOI: 10.1016/S0928-4869(99)00015-4
Mieczyslaw Metzger
An activated sludge process is considered in this work for comparative tests of new integration algorithms. Based on the configuration of the process and on the process kinetics for heterotrophic bacterial growth, the mathematical model of the considered process has been derived in the form of a state ordinary differential equation system. The state ordinary differential equation system describing the considered process may be both stiff and non-stiff for operator's control changes of the oxygen feeding flow rate. In the work, new discrete response equivalent (DRE) integration algorithms are proposed for simulation runs with a fixed integration step size, which is independent of the process dynamics (this possibility is due to self-adaptive features of the algorithms). The proposed algorithms have been compared with most other frequently used integration algorithms. The comparative tests show that, among the compared algorithms, only the DRE integration algorithms may be used with a fixed, arbitrarily chosen integration step size for simulation of the state ordinary differential equation system which may be both stiff and non-stiff during simulation.
{"title":"A comparative evaluation of DRE integration algorithms for real-time simulation of biologically activated sludge process","authors":"Mieczyslaw Metzger","doi":"10.1016/S0928-4869(99)00015-4","DOIUrl":"10.1016/S0928-4869(99)00015-4","url":null,"abstract":"<div><p>An activated sludge process is considered in this work for comparative tests of new integration algorithms. Based on the configuration of the process and on the process kinetics for heterotrophic bacterial growth, the mathematical model of the considered process has been derived in the form of a state ordinary differential equation system. The state ordinary differential equation system describing the considered process may be both stiff and non-stiff for operator's control changes of the oxygen feeding flow rate. In the work, new discrete response equivalent (DRE) integration algorithms are proposed for simulation runs with a fixed integration step size, which is independent of the process dynamics (this possibility is due to self-adaptive features of the algorithms). The proposed algorithms have been compared with most other frequently used integration algorithms. The comparative tests show that, among the compared algorithms, only the DRE integration algorithms may be used with a fixed, arbitrarily chosen integration step size for simulation of the state ordinary differential equation system which may be both stiff and non-stiff during simulation.</p></div>","PeriodicalId":101162,"journal":{"name":"Simulation Practice and Theory","volume":"7 7","pages":"Pages 629-643"},"PeriodicalIF":0.0,"publicationDate":"2000-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0928-4869(99)00015-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81517257","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 : 1999-12-15DOI: 10.1016/S0928-4869(99)00026-9
Jean Thoma , H.Jürgen Halin
This is the introduction to our Bondgraph (BG) issue, which deals with several problems of practical simulation. First we define the art of Bondgraphing, where causality is stressed. One chapter makes a comparison of traditional versus BG modeling. Then follows some help with practical simulation, the paracheck and compact physical units. Next there is estimation of time constants and resonance frequencies, which determine the required time step in the simulation. Finally, a trap is shown with quadratic resistances, which really comes from faulty physical reasoning. We conclude with the advantages and limitations of BG and with some suitable computer programs.
{"title":"Bondgraphs and practical simulation","authors":"Jean Thoma , H.Jürgen Halin","doi":"10.1016/S0928-4869(99)00026-9","DOIUrl":"10.1016/S0928-4869(99)00026-9","url":null,"abstract":"<div><p>This is the introduction to our Bondgraph (BG) issue, which deals with several problems of practical simulation. First we define the art of Bondgraphing, where causality is stressed. One chapter makes a comparison of traditional versus BG modeling. Then follows some help with practical simulation, the paracheck and compact physical units. Next there is estimation of time constants and resonance frequencies, which determine the required time step in the simulation. Finally, a trap is shown with quadratic resistances, which really comes from faulty physical reasoning. We conclude with the advantages and limitations of BG and with some suitable computer programs.</p></div>","PeriodicalId":101162,"journal":{"name":"Simulation Practice and Theory","volume":"7 5","pages":"Pages 401-417"},"PeriodicalIF":0.0,"publicationDate":"1999-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0928-4869(99)00026-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81900434","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}