Pub Date : 2002-11-01DOI: 10.1109/TSMCC.2002.806060
S. Mitra, K. Konwar, S. Pal
A fuzzy knowledge-based network is developed based on the linguistic rules extracted from a fuzzy decision tree. A scheme for automatic linguistic discretization of continuous attributes, based on quantiles, is formulated. A novel concept for measuring the goodness of a decision tree, in terms of its compactness (size) and efficient performance, is introduced. Linguistic rules are quantitatively evaluated using new indices. The rules are mapped to a fuzzy knowledge-based network, incorporating the frequency of samples and depth of the attributes in the decision tree. New fuzziness measures, in terms of class memberships, are used at the node level of the tree to take care of overlapping classes. The effectiveness of the system, in terms of recognition scores, structure of decision tree, performance of rules, and network size, is extensively demonstrated on three sets of real-life data.
{"title":"Fuzzy decision tree, linguistic rules and fuzzy knowledge-based network: generation and evaluation","authors":"S. Mitra, K. Konwar, S. Pal","doi":"10.1109/TSMCC.2002.806060","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.806060","url":null,"abstract":"A fuzzy knowledge-based network is developed based on the linguistic rules extracted from a fuzzy decision tree. A scheme for automatic linguistic discretization of continuous attributes, based on quantiles, is formulated. A novel concept for measuring the goodness of a decision tree, in terms of its compactness (size) and efficient performance, is introduced. Linguistic rules are quantitatively evaluated using new indices. The rules are mapped to a fuzzy knowledge-based network, incorporating the frequency of samples and depth of the attributes in the decision tree. New fuzziness measures, in terms of class memberships, are used at the node level of the tree to take care of overlapping classes. The effectiveness of the system, in terms of recognition scores, structure of decision tree, performance of rules, and network size, is extensively demonstrated on three sets of real-life data.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"105 1","pages":"328-339"},"PeriodicalIF":0.0,"publicationDate":"2002-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78079892","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 : 2002-11-01DOI: 10.1109/TSMCC.2002.806069
J. O. Peralta, M. T. C. D. Peralta
This perimeter intruder detection system (PIDS) is a system applicable to surveillance and perimeter control of areas of responsibility where risks are assessed, like swimming-pools, school precincts, museums, embassies, warehouses, and the like. It consists of a string of an arbitrary number of spaced but communicated micro-controllers, each one driving infra-red (IR) and/or ultrasound emitters and digital output transducers. The system uses radar effect and it carries continuous perimeter patrol by performing sequential surveillance of detector outputs as well as distributed pattern recognition analysis. All micro-controllers support a common code which includes turning the emitters sequentially on and off, pattern recognition routines, and serial transmission of alarm byte. Butterfly alarms are avoided via software and adequate geometrical configuration of the emitter beam net. One master micro-controller closes the string synchronizes and conducts the others. When the master micro-controller receives the "intruder" signal, it triggers the physical alarm, its next order being to restart patrolling.
{"title":"Security PIDS with physical sensors, real-time pattern recognition, and continuous patrol","authors":"J. O. Peralta, M. T. C. D. Peralta","doi":"10.1109/TSMCC.2002.806069","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.806069","url":null,"abstract":"This perimeter intruder detection system (PIDS) is a system applicable to surveillance and perimeter control of areas of responsibility where risks are assessed, like swimming-pools, school precincts, museums, embassies, warehouses, and the like. It consists of a string of an arbitrary number of spaced but communicated micro-controllers, each one driving infra-red (IR) and/or ultrasound emitters and digital output transducers. The system uses radar effect and it carries continuous perimeter patrol by performing sequential surveillance of detector outputs as well as distributed pattern recognition analysis. All micro-controllers support a common code which includes turning the emitters sequentially on and off, pattern recognition routines, and serial transmission of alarm byte. Butterfly alarms are avoided via software and adequate geometrical configuration of the emitter beam net. One master micro-controller closes the string synchronizes and conducts the others. When the master micro-controller receives the \"intruder\" signal, it triggers the physical alarm, its next order being to restart patrolling.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"16 1","pages":"340-346"},"PeriodicalIF":0.0,"publicationDate":"2002-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72730798","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 : 2002-11-01DOI: 10.1109/TSMCC.2002.806747
L. Jaulin, M. Kieffer, E. Walter, D. Meizel
When reliable prior bounds on the acceptable errors between the data and corresponding model outputs are available, bounded-error estimation techniques make it possible to characterize the set of all acceptable parameter vectors in a guaranteed way, even when the model is nonlinear and the number of data points small. However, when the data may contain outliers, i.e., data points for which these bounds should be violated, this set may turn out to be empty, or at least unrealistically small. The outlier minimal number estimator (OMNE) has been designed to deal with such a situation, by minimizing the number of data points considered as outliers. OMNE has been shown in previous papers to be remarkably robust, even to a majority of outliers. Up to now, it was implemented by random scanning, so its results could not be guaranteed. In this paper, a new algorithm based on set inversion via interval analysis provides a guaranteed OMNE, which is applied to the initial localization of an actual robot in a partially known two-dimensional (2-D) environment. The difficult problems of associating range data to landmarks of the environment and of detecting potential outliers are solved as byproducts of the procedure.
{"title":"Guaranteed robust nonlinear estimation with application to robot localization","authors":"L. Jaulin, M. Kieffer, E. Walter, D. Meizel","doi":"10.1109/TSMCC.2002.806747","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.806747","url":null,"abstract":"When reliable prior bounds on the acceptable errors between the data and corresponding model outputs are available, bounded-error estimation techniques make it possible to characterize the set of all acceptable parameter vectors in a guaranteed way, even when the model is nonlinear and the number of data points small. However, when the data may contain outliers, i.e., data points for which these bounds should be violated, this set may turn out to be empty, or at least unrealistically small. The outlier minimal number estimator (OMNE) has been designed to deal with such a situation, by minimizing the number of data points considered as outliers. OMNE has been shown in previous papers to be remarkably robust, even to a majority of outliers. Up to now, it was implemented by random scanning, so its results could not be guaranteed. In this paper, a new algorithm based on set inversion via interval analysis provides a guaranteed OMNE, which is applied to the initial localization of an actual robot in a partially known two-dimensional (2-D) environment. The difficult problems of associating range data to landmarks of the environment and of detecting potential outliers are solved as byproducts of the procedure.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"15 1","pages":"374-381"},"PeriodicalIF":0.0,"publicationDate":"2002-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76888252","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 : 2002-11-01DOI: 10.1109/TSMCC.2002.806744
R. Logeswaran
This paper proposes a modified block-adaptive prediction-based neural network scheme for lossless data compression. A variety of neural network models from a selection of different network types, including feedforward, recurrent, and radial basis configurations are implemented with the scheme. The scheme is further expanded with combinations of popular lossless encoding algorithms. Simulation results are presented, taking characteristic features of the models, transmission issues, and practical considerations into account to determine optimized configuration, suitable training strategies, and implementation schemes. Estimations are used for comparisons of these characteristics with the existing schemes. It is also shown that the adaptations of the improvised scheme increases performance of even the classical predictors evaluated. In addition, the results obtained support that the total processing time of the two-stage scheme can, in certain cases, be faster than just using lossless encoders. Findings of the paper may be beneficial for future work, such as, in the hardware implementations of dedicated neural chips for lossless compression.
{"title":"A prediction-based neural network scheme for lossless data compression","authors":"R. Logeswaran","doi":"10.1109/TSMCC.2002.806744","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.806744","url":null,"abstract":"This paper proposes a modified block-adaptive prediction-based neural network scheme for lossless data compression. A variety of neural network models from a selection of different network types, including feedforward, recurrent, and radial basis configurations are implemented with the scheme. The scheme is further expanded with combinations of popular lossless encoding algorithms. Simulation results are presented, taking characteristic features of the models, transmission issues, and practical considerations into account to determine optimized configuration, suitable training strategies, and implementation schemes. Estimations are used for comparisons of these characteristics with the existing schemes. It is also shown that the adaptations of the improvised scheme increases performance of even the classical predictors evaluated. In addition, the results obtained support that the total processing time of the two-stage scheme can, in certain cases, be faster than just using lossless encoders. Findings of the paper may be beneficial for future work, such as, in the hardware implementations of dedicated neural chips for lossless compression.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"7 1","pages":"358-365"},"PeriodicalIF":0.0,"publicationDate":"2002-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79980159","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 : 2002-11-01DOI: 10.1109/TSMCC.2002.806064
K. Ishida, T. Ohta
We describe a term relation frequency (TRF) method for finding comprehensive documents in a rapidly growing academic discipline. The method enables us to organize knowledge into a single document based on terminology. The method is based on the classification of documents into comprehensive, central, peripheral, and independent classes according to the commonality and exclusiveness of terminology. Being able to find the documents quickly is helpful for our understanding of the discipline. Multiple-meaning technical terms such as "coordination" play a key role in rapidly growing academic disciplines such as coordination science. Visual representation of the multiple-meaning terms helps us to identify quickly and easily how the terms are used. With TRF and visualization methods, we can identify documents that explain a technical term comprehensively. We can also identify a change in the subject of a discipline according to when the comprehensive documents are written. We show that the observed change matches our understanding of the topic of the field "coordination science." The methods discussed here are promising to help us quickly understand and advance research in rapidly growing academic disciplines such as coordination science.
{"title":"An approach for organizing knowledge according to terminology and representing it visually","authors":"K. Ishida, T. Ohta","doi":"10.1109/TSMCC.2002.806064","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.806064","url":null,"abstract":"We describe a term relation frequency (TRF) method for finding comprehensive documents in a rapidly growing academic discipline. The method enables us to organize knowledge into a single document based on terminology. The method is based on the classification of documents into comprehensive, central, peripheral, and independent classes according to the commonality and exclusiveness of terminology. Being able to find the documents quickly is helpful for our understanding of the discipline. Multiple-meaning technical terms such as \"coordination\" play a key role in rapidly growing academic disciplines such as coordination science. Visual representation of the multiple-meaning terms helps us to identify quickly and easily how the terms are used. With TRF and visualization methods, we can identify documents that explain a technical term comprehensively. We can also identify a change in the subject of a discipline according to when the comprehensive documents are written. We show that the observed change matches our understanding of the topic of the field \"coordination science.\" The methods discussed here are promising to help us quickly understand and advance research in rapidly growing academic disciplines such as coordination science.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"57 1","pages":"366-373"},"PeriodicalIF":0.0,"publicationDate":"2002-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78584774","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 : 2002-11-01DOI: 10.1109/TSMCC.2002.807273
T. Tsuji, Yoshiyuki Tanaka, P. Morasso, V. Sanguineti, M. Kaneko
This paper proposes a new trajectory generation method that allows full control of transient behavior, namely, time-to-target and velocity profile, based on the artificial potential field approach for a real-time robot motion planning problem. Little attention, in fact, has been paid to the temporal aspects of this class of path planning methods. The ability to control the motion time to the target as well as the velocity profile of the generated trajectories, however, is of great interest in real-life applications. In the paper, we argue that such transient behavior should be taken into account within the framework of the artificial potential field approach.
{"title":"Bio-mimetic trajectory generation of robots via artificial potential field with time base generator","authors":"T. Tsuji, Yoshiyuki Tanaka, P. Morasso, V. Sanguineti, M. Kaneko","doi":"10.1109/TSMCC.2002.807273","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.807273","url":null,"abstract":"This paper proposes a new trajectory generation method that allows full control of transient behavior, namely, time-to-target and velocity profile, based on the artificial potential field approach for a real-time robot motion planning problem. Little attention, in fact, has been paid to the temporal aspects of this class of path planning methods. The ability to control the motion time to the target as well as the velocity profile of the generated trajectories, however, is of great interest in real-life applications. In the paper, we argue that such transient behavior should be taken into account within the framework of the artificial potential field approach.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"16 1","pages":"426-439"},"PeriodicalIF":0.0,"publicationDate":"2002-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89432511","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 : 2002-11-01DOI: 10.1109/TSMCC.2002.806058
Jason Z. Zhang, Q. M. Wu, H. Tsui, W. Gruver
Image transfer is a method for projecting a 3D scene from two or more reference images. Typically, the correspondences of target points to be transferred and the reference points must be known over the reference images. We present two new transfer methods that eliminate the target point correspondence requirement. We show that five reference points matched across two reference images are sufficient to linearly resolve transfer under affine projection using two views instead of three views as needed by other techniques. Furthermore, given the correspondences of any four of the five reference points in any other view, we can transfer a target point to a third view from any one of the two original reference views. To improve the robustness of the affine projection method, we incorporate an orthographic camera model. A factorization method is applied to the reference points matched over two reference views. Experiments with real image sequences demonstrate the application of both methods for motion tracking.
{"title":"Binocular transfer methods for point-feature tracking of image sequences","authors":"Jason Z. Zhang, Q. M. Wu, H. Tsui, W. Gruver","doi":"10.1109/TSMCC.2002.806058","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.806058","url":null,"abstract":"Image transfer is a method for projecting a 3D scene from two or more reference images. Typically, the correspondences of target points to be transferred and the reference points must be known over the reference images. We present two new transfer methods that eliminate the target point correspondence requirement. We show that five reference points matched across two reference images are sufficient to linearly resolve transfer under affine projection using two views instead of three views as needed by other techniques. Furthermore, given the correspondences of any four of the five reference points in any other view, we can transfer a target point to a third view from any one of the two original reference views. To improve the robustness of the affine projection method, we incorporate an orthographic camera model. A factorization method is applied to the reference points matched over two reference views. Experiments with real image sequences demonstrate the application of both methods for motion tracking.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"76 1","pages":"392-405"},"PeriodicalIF":0.0,"publicationDate":"2002-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80718056","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 : 2002-11-01DOI: 10.1109/TSMCC.2002.806745
S. Su, Chan-Ben Lin, Yen-Tseng Hsu
Traditional model-free prediction approaches, such as neural networks or fuzzy models use all training data without preference in building their prediction models. Alternately, one may make predictions based only on a set of the most recent data without using other data. Usually, such local prediction schemes may have better performance in predicting time series than global prediction schemes do. However, local prediction schemes only use the most recent information and ignore information bearing on far away data. As a result, the accuracy of local prediction schemes may be limited. In this paper a novel prediction approach, termed the Markov-Fourier gray model (MFGM), is proposed. The approach builds a gray model from a set of the most recent data and a Fourier series is used to fit the residuals produced by this gray model. Then, the Markov matrices are employed to encode possible global information generated also by the residuals. It is evident that MFGM can provide the best performance among existing prediction schemes. Besides, we also implemented a short-term MFGM approach, in which the Markov matrices only recorded information for a period of time instead of all data. The predictions using MFGM again are more accurate than those using short-term MFGM. Thus, it is concluded that the global information encoded in the Markov matrices indeed can provide useful information for predictions.
{"title":"A high precision global prediction approach based on local prediction approaches","authors":"S. Su, Chan-Ben Lin, Yen-Tseng Hsu","doi":"10.1109/TSMCC.2002.806745","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.806745","url":null,"abstract":"Traditional model-free prediction approaches, such as neural networks or fuzzy models use all training data without preference in building their prediction models. Alternately, one may make predictions based only on a set of the most recent data without using other data. Usually, such local prediction schemes may have better performance in predicting time series than global prediction schemes do. However, local prediction schemes only use the most recent information and ignore information bearing on far away data. As a result, the accuracy of local prediction schemes may be limited. In this paper a novel prediction approach, termed the Markov-Fourier gray model (MFGM), is proposed. The approach builds a gray model from a set of the most recent data and a Fourier series is used to fit the residuals produced by this gray model. Then, the Markov matrices are employed to encode possible global information generated also by the residuals. It is evident that MFGM can provide the best performance among existing prediction schemes. Besides, we also implemented a short-term MFGM approach, in which the Markov matrices only recorded information for a period of time instead of all data. The predictions using MFGM again are more accurate than those using short-term MFGM. Thus, it is concluded that the global information encoded in the Markov matrices indeed can provide useful information for predictions.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"310 1","pages":"416-425"},"PeriodicalIF":0.0,"publicationDate":"2002-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77245901","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 : 2002-11-01DOI: 10.1109/TSMCC.2002.806785
W. Rouse
The success of information and knowledge management depends on understanding and supporting the user's need to know. This requires understanding humans' abilities, limitations, and inclinations in seeking of information and knowledge. This paper explores these phenomena in the context of two decades of studying human decision making in the domains of research, design, and management. The findings summarized are discussed in terms of implications for design, development, and deployment of information and knowledge support systems.
{"title":"Need to know-information, knowledge, and decision making","authors":"W. Rouse","doi":"10.1109/TSMCC.2002.806785","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.806785","url":null,"abstract":"The success of information and knowledge management depends on understanding and supporting the user's need to know. This requires understanding humans' abilities, limitations, and inclinations in seeking of information and knowledge. This paper explores these phenomena in the context of two decades of studying human decision making in the domains of research, design, and management. The findings summarized are discussed in terms of implications for design, development, and deployment of information and knowledge support systems.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"11 1","pages":"282-292"},"PeriodicalIF":0.0,"publicationDate":"2002-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81816669","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 : 2002-11-01DOI: 10.1109/TSMCC.2002.806063
M. Suárez, L. Recalde
Petri nets are formalisms for the modeling of discrete event dynamic systems (DEDS). The integrality of the marking and of the transitions firing counters is a clear reflection of this. To reduce the computational complexity of the analysis or synthesis of Petri nets, two relaxations have been introduced at two different levels: (1) at net level, leading to continuous net systems; (2) at state equation level, which has allowed to obtain systems of linear inequalities, or linear programming problems. These relaxations are mainly related to the fractional firing of transitions, which implies the existence of non-integer markings. We give an overview of this emerging field. It is focused on the relationship between the properties of (discrete) PNs and the corresponding properties of their continuous approximation. Through the interleaving of qualitative and quantitative techniques, surprising results can be obtained from the analysis of these continuous systems. For these approximations to be "acceptable", it is necessary that large markings (populations) exist. It can also be seen, however, that not every populated net system can be continuized. In fact, there exist systems with "large" populations for which continuation does not make sense. The possibility of expressing nonlinear behaviors may lead to deterministic continuous differential systems with complex behaviors.
{"title":"Petri nets and integrality relaxations: A view of continuous Petri net models","authors":"M. Suárez, L. Recalde","doi":"10.1109/TSMCC.2002.806063","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.806063","url":null,"abstract":"Petri nets are formalisms for the modeling of discrete event dynamic systems (DEDS). The integrality of the marking and of the transitions firing counters is a clear reflection of this. To reduce the computational complexity of the analysis or synthesis of Petri nets, two relaxations have been introduced at two different levels: (1) at net level, leading to continuous net systems; (2) at state equation level, which has allowed to obtain systems of linear inequalities, or linear programming problems. These relaxations are mainly related to the fractional firing of transitions, which implies the existence of non-integer markings. We give an overview of this emerging field. It is focused on the relationship between the properties of (discrete) PNs and the corresponding properties of their continuous approximation. Through the interleaving of qualitative and quantitative techniques, surprising results can be obtained from the analysis of these continuous systems. For these approximations to be \"acceptable\", it is necessary that large markings (populations) exist. It can also be seen, however, that not every populated net system can be continuized. In fact, there exist systems with \"large\" populations for which continuation does not make sense. The possibility of expressing nonlinear behaviors may lead to deterministic continuous differential systems with complex behaviors.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"129 1","pages":"314-327"},"PeriodicalIF":0.0,"publicationDate":"2002-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76889414","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
扫码关注我们
求助内容：
应助结果提醒方式：