Pub Date : 2022-01-24DOI: 10.1080/17445760.2022.2034163
Alexandros Gazis, E. Katsiri
This paper presents the design, implementation, and operation of a novel distributed fault-tolerant middleware. It uses interconnected WSNs that implement the Map-Reduce paradigm, consisting of several low-cost and low-power mini-computers (Raspberry Pi). Specifically, we explain the steps for the development of a novice, fault-tolerant Map-Reduce algorithm which achieves high system availability, focusing on network connectivity. Finally, we showcase the use of the proposed system based on simulated data for crowd monitoring in a real case scenario, i.e. a historical building in Greece (M. Hatzidakis’ residence). The technical novelty of this article lies in presenting a viable low-cost and low-power solution for crowd sensing without using complex and resource-intensive AI structures or image/video recognition techniques. GRAPHICAL ABSTRACT
{"title":"Crowd tracking and monitoring middleware via Map-Reduce","authors":"Alexandros Gazis, E. Katsiri","doi":"10.1080/17445760.2022.2034163","DOIUrl":"https://doi.org/10.1080/17445760.2022.2034163","url":null,"abstract":"This paper presents the design, implementation, and operation of a novel distributed fault-tolerant middleware. It uses interconnected WSNs that implement the Map-Reduce paradigm, consisting of several low-cost and low-power mini-computers (Raspberry Pi). Specifically, we explain the steps for the development of a novice, fault-tolerant Map-Reduce algorithm which achieves high system availability, focusing on network connectivity. Finally, we showcase the use of the proposed system based on simulated data for crowd monitoring in a real case scenario, i.e. a historical building in Greece (M. Hatzidakis’ residence). The technical novelty of this article lies in presenting a viable low-cost and low-power solution for crowd sensing without using complex and resource-intensive AI structures or image/video recognition techniques. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"333 - 343"},"PeriodicalIF":1.1,"publicationDate":"2022-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46462211","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 : 2022-01-15DOI: 10.1080/17445760.2022.2134369
Raju Hazari, P. P. Chaudhuri
The reason of significantly higher transmissibility of SARS Covid (2019 CoV-2) compared with SARS Covid (2003 CoV) and MERS Covid (2012 MERS) can be attributed to mutations reported in structural proteins, and the role played by non-structural proteins (nsps) and accessory proteins (ORFs) for viral replication, assembly, and shedding. Envelope protein E is one of the four structural proteins of minimum length. Recent studies have confirmed critical role played by the envelope protein in the viral life cycle including assembly of virion exported from infected cell for its transmission. However, the determinants of the highly complex viral–host interactions of envelope protein, particularly with host Golgi complex, have not been adequately characterized. CoV-2 and CoV Envelope proteins of length 75 and 76 amino acids (AAs) differ in four AA locations. The additional AA Gly (G) at location 70 makes CoV length 76. The AA pair EG at locations 69–70 of CoV in place of amino acid R in location 69 of CoV-2, has been identified as a major determining factor in the current investigation. This paper concentrates on the analysis of envelope proteins of SARS covid and MERS covid based on Cellular Automata enhanced Machine Learning (CAML) model developed for study of biological strings. This computational model compares deviation of structure–function of CoV-2 from that of CoV employing CAML model parameters derived out of CA evolution of AA chains of envelope proteins. We hypothesize that large differences of CAML model parameter of CoV-2 and CoV characterize the deviation in structure and function of envelope proteins in respect of interaction of virus with host Golgi complex. This difference gets reflected in the contribution of envelope protein towards overall large difference of transmissibility of CoV-2 and CoV. The hypothesis has been validated from single-point mutational study on- (i) human HBB beta-globin hemoglobin protein associated with sickle cell anemia, (ii) mutants of envelope protein of COVID-2-infected patients reported in recent publications. GRAPHICAL ABSTRACT
{"title":"Analysis of coronavirus envelope protein with cellular automata model","authors":"Raju Hazari, P. P. Chaudhuri","doi":"10.1080/17445760.2022.2134369","DOIUrl":"https://doi.org/10.1080/17445760.2022.2134369","url":null,"abstract":"The reason of significantly higher transmissibility of SARS Covid (2019 CoV-2) compared with SARS Covid (2003 CoV) and MERS Covid (2012 MERS) can be attributed to mutations reported in structural proteins, and the role played by non-structural proteins (nsps) and accessory proteins (ORFs) for viral replication, assembly, and shedding. Envelope protein E is one of the four structural proteins of minimum length. Recent studies have confirmed critical role played by the envelope protein in the viral life cycle including assembly of virion exported from infected cell for its transmission. However, the determinants of the highly complex viral–host interactions of envelope protein, particularly with host Golgi complex, have not been adequately characterized. CoV-2 and CoV Envelope proteins of length 75 and 76 amino acids (AAs) differ in four AA locations. The additional AA Gly (G) at location 70 makes CoV length 76. The AA pair EG at locations 69–70 of CoV in place of amino acid R in location 69 of CoV-2, has been identified as a major determining factor in the current investigation. This paper concentrates on the analysis of envelope proteins of SARS covid and MERS covid based on Cellular Automata enhanced Machine Learning (CAML) model developed for study of biological strings. This computational model compares deviation of structure–function of CoV-2 from that of CoV employing CAML model parameters derived out of CA evolution of AA chains of envelope proteins. We hypothesize that large differences of CAML model parameter of CoV-2 and CoV characterize the deviation in structure and function of envelope proteins in respect of interaction of virus with host Golgi complex. This difference gets reflected in the contribution of envelope protein towards overall large difference of transmissibility of CoV-2 and CoV. The hypothesis has been validated from single-point mutational study on- (i) human HBB beta-globin hemoglobin protein associated with sickle cell anemia, (ii) mutants of envelope protein of COVID-2-infected patients reported in recent publications. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"623 - 648"},"PeriodicalIF":1.1,"publicationDate":"2022-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45072822","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 : 2022-01-12DOI: 10.1080/17445760.2021.2024536
Keqin Li
In this paper, we consider non-clairvoyant task offloading for random tasks in mobile edge computing within the framework of combinatorial optimisation. For offline non-clairvoyant task offloading, we propose a non-clairvoyant task offloading algorithm, which is able to determine a task offloading strategy without knowing the amount of computation and communication of any task. For online non-clairvoyant task offloading, we propose a randomised online task offloading algorithm, which is able to make an offloading decision for an arrival task without knowing anything about future tasks and other tasks. For both algorithms, we analyse the probability of certain performance guarantee. We also demonstrate numerical data. To the best of the author's knowledge, this is the first paper which considers both offline and online non-clairvoyant task offloading in mobile edge computing, together with analytical results on performance guarantee with high probability.
{"title":"Non-clairvoyant and randomised online task offloading in mobile edge computing","authors":"Keqin Li","doi":"10.1080/17445760.2021.2024536","DOIUrl":"https://doi.org/10.1080/17445760.2021.2024536","url":null,"abstract":"In this paper, we consider non-clairvoyant task offloading for random tasks in mobile edge computing within the framework of combinatorial optimisation. For offline non-clairvoyant task offloading, we propose a non-clairvoyant task offloading algorithm, which is able to determine a task offloading strategy without knowing the amount of computation and communication of any task. For online non-clairvoyant task offloading, we propose a randomised online task offloading algorithm, which is able to make an offloading decision for an arrival task without knowing anything about future tasks and other tasks. For both algorithms, we analyse the probability of certain performance guarantee. We also demonstrate numerical data. To the best of the author's knowledge, this is the first paper which considers both offline and online non-clairvoyant task offloading in mobile edge computing, together with analytical results on performance guarantee with high probability.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"413 - 424"},"PeriodicalIF":1.1,"publicationDate":"2022-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45649581","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 : 2022-01-09DOI: 10.1080/17445760.2021.2024537
Xiaohong Xue, Shurong Zhang
The fault tolerance of telecommunication networks is the ability to maintain service continuity in case of accident and attack. Designing disjoint paths to ensure fault tolerance of networks is regarded as one of the most important research problem. Especially in time-dependent networks which is used to the model that the weight of each link varies with time, answering shortest disjoint paths queries and plans in real time is considered to be one of major challenges in many industrial applications. Motivated by this observation, in the first in and first out (FIFO) time-varying network, we investigate the problem of finding two time-varying node-disjoint paths from the source to the destination with the departure time such that the total time-varying delay of the paths is minimised. Based on the time-varying interlacing path in different time-intervals, we develop an effective algorithm to obtain the optimal solutions in time .
{"title":"Minsum node-disjoint paths with time-varying delay functions","authors":"Xiaohong Xue, Shurong Zhang","doi":"10.1080/17445760.2021.2024537","DOIUrl":"https://doi.org/10.1080/17445760.2021.2024537","url":null,"abstract":"The fault tolerance of telecommunication networks is the ability to maintain service continuity in case of accident and attack. Designing disjoint paths to ensure fault tolerance of networks is regarded as one of the most important research problem. Especially in time-dependent networks which is used to the model that the weight of each link varies with time, answering shortest disjoint paths queries and plans in real time is considered to be one of major challenges in many industrial applications. Motivated by this observation, in the first in and first out (FIFO) time-varying network, we investigate the problem of finding two time-varying node-disjoint paths from the source to the destination with the departure time such that the total time-varying delay of the paths is minimised. Based on the time-varying interlacing path in different time-intervals, we develop an effective algorithm to obtain the optimal solutions in time .","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"398 - 412"},"PeriodicalIF":1.1,"publicationDate":"2022-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42008179","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 : 2022-01-06DOI: 10.1080/17445760.2021.2022672
Ricardo Xavier Llugsi Cañar, S. El Yacoubi, A. Fontaine, P. Lupera
ABSTRACT In the present work, a novel methodology for error detection in automatic weather stations has been implemented. Time series acquired from two highly correlated stations with a station under analysis are utilised to obtain a 24-h air temperature forecast that allows to know if a station register erroneous measurements. Four models to obtain a reliable forecast have been analysed, auto-regressive integrated moving average, Long Short-Term Memory (LSTM), LSTM stacked and a convolutional LSTM model with uncertainty error reduction. The analysis carried out exhibits a significant success with the methodology for three stations reaching error values between 0.98 C and 1.50 C and correlation coefficients between 0.72 and 0.81. GRAPHICAL ABSTRACT
{"title":"A novel approach for detecting error measurements in a network of automatic weather stations","authors":"Ricardo Xavier Llugsi Cañar, S. El Yacoubi, A. Fontaine, P. Lupera","doi":"10.1080/17445760.2021.2022672","DOIUrl":"https://doi.org/10.1080/17445760.2021.2022672","url":null,"abstract":"ABSTRACT In the present work, a novel methodology for error detection in automatic weather stations has been implemented. Time series acquired from two highly correlated stations with a station under analysis are utilised to obtain a 24-h air temperature forecast that allows to know if a station register erroneous measurements. Four models to obtain a reliable forecast have been analysed, auto-regressive integrated moving average, Long Short-Term Memory (LSTM), LSTM stacked and a convolutional LSTM model with uncertainty error reduction. The analysis carried out exhibits a significant success with the methodology for three stations reaching error values between 0.98 C and 1.50 C and correlation coefficients between 0.72 and 0.81. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"425 - 442"},"PeriodicalIF":1.1,"publicationDate":"2022-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43330138","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 : 2021-12-29DOI: 10.1080/17445760.2021.2016754
M. Burgin, Matan Shtepel
Totalisation of operations and functions is a subject of great importance in the precise sciences at large, and in particular, in computer science, where computed functions must be totalised to account for edge cases and prevent system failures. In this paper, we investigate the totalisation of computable functions in the general and abstract setting of the axiomatic theory of computing systems, such as automata, computer networks, and algorithms, allowing us to define characteristics and discover relations which resonate true through many computational models – from individual automata through complex distributed systems with concurrent functioning. We explore the possible types of totalisations, the complexes of computing systems that do (or do not) have totalisations, and the behaviour of totalisation in various transformations and compositions. In addition, we point to a few interesting directions for future research.
{"title":"On totalisation of computable functions in a distributive environment","authors":"M. Burgin, Matan Shtepel","doi":"10.1080/17445760.2021.2016754","DOIUrl":"https://doi.org/10.1080/17445760.2021.2016754","url":null,"abstract":"Totalisation of operations and functions is a subject of great importance in the precise sciences at large, and in particular, in computer science, where computed functions must be totalised to account for edge cases and prevent system failures. In this paper, we investigate the totalisation of computable functions in the general and abstract setting of the axiomatic theory of computing systems, such as automata, computer networks, and algorithms, allowing us to define characteristics and discover relations which resonate true through many computational models – from individual automata through complex distributed systems with concurrent functioning. We explore the possible types of totalisations, the complexes of computing systems that do (or do not) have totalisations, and the behaviour of totalisation in various transformations and compositions. In addition, we point to a few interesting directions for future research.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"273 - 291"},"PeriodicalIF":1.1,"publicationDate":"2021-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47061399","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 : 2021-11-25DOI: 10.1080/17445760.2021.2004412
D. Zaitsev, T. Shmeleva, P. Luszczek
The paper further refines the clan composition technique that is considered a way of matrix partitioning into a union of block-diagonal and block-column matrices. This enables solving the individual systems for each horizontal block on a separate computing node, followed by solving the composition system. The size of minimal clans, obtained as a result of matrix decomposition, varies considerably. For load balancing, early versions of ParAd software were using dynamic scheduling of jobs. The present paper studies a task of static balancing the clan size. Rather good results are obtained using a fast bin packing algorithm with the first fit on a sorted array which are considerably improved applying a multi-objective graph partitioning with software package METIS. Aggregation of clans allows us to obtain up to three times extra speed-up, including systems over fields of real numbers, on matrices from Model Checking Contest and Matrix Market.
{"title":"Aggregation of clans to speed-up solving linear systems on parallel architectures","authors":"D. Zaitsev, T. Shmeleva, P. Luszczek","doi":"10.1080/17445760.2021.2004412","DOIUrl":"https://doi.org/10.1080/17445760.2021.2004412","url":null,"abstract":"The paper further refines the clan composition technique that is considered a way of matrix partitioning into a union of block-diagonal and block-column matrices. This enables solving the individual systems for each horizontal block on a separate computing node, followed by solving the composition system. The size of minimal clans, obtained as a result of matrix decomposition, varies considerably. For load balancing, early versions of ParAd software were using dynamic scheduling of jobs. The present paper studies a task of static balancing the clan size. Rather good results are obtained using a fast bin packing algorithm with the first fit on a sorted array which are considerably improved applying a multi-objective graph partitioning with software package METIS. Aggregation of clans allows us to obtain up to three times extra speed-up, including systems over fields of real numbers, on matrices from Model Checking Contest and Matrix Market.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"198 - 219"},"PeriodicalIF":1.1,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41703168","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 : 2021-11-23DOI: 10.1080/17445760.2021.2024535
Jun-jie Liu, Kang-Too Tsang, Y. Deng
The standard RSA relies on multiple big-number modular exponentiation operations and a longer key-length is required for better protection. This imposes a hefty time penalty for encryption and decryption. In this study, we analysed and developed an improved parallel algorithm (PMKRSA) based on the idea of splitting the plaintext into multiple chunks and encrypt the chunks using multiple key-pairs. The algorithm in our new scheme is so natural for parallelised implementation that we also investigated its parallelisation in a GPU environment. In the following, the structure of our new scheme is outlined and its correctness is proved mathematically. Then, with the algorithm implemented and optimised on both CPU and CPU+GPU platforms, we showed that our algorithm shortens the computational time considerably, and it has a security advantage over the standard RSA as it is invulnerable to the common attacks. Finally, we also proved the feasibility of using our algorithm to encrypt large files through simulation. The results show that over the set of file size: 1 MB, 10 MB, 25 MB, 50 MB, 100 MB, the average encryption and decryption time of the CPU version is 0.2476 and 9.4476 s, and for the CPU+GPU version, it is 0.0009 and 0.0618 s, respectively.
{"title":"A variant RSA acceleration with parallelisation","authors":"Jun-jie Liu, Kang-Too Tsang, Y. Deng","doi":"10.1080/17445760.2021.2024535","DOIUrl":"https://doi.org/10.1080/17445760.2021.2024535","url":null,"abstract":"The standard RSA relies on multiple big-number modular exponentiation operations and a longer key-length is required for better protection. This imposes a hefty time penalty for encryption and decryption. In this study, we analysed and developed an improved parallel algorithm (PMKRSA) based on the idea of splitting the plaintext into multiple chunks and encrypt the chunks using multiple key-pairs. The algorithm in our new scheme is so natural for parallelised implementation that we also investigated its parallelisation in a GPU environment. In the following, the structure of our new scheme is outlined and its correctness is proved mathematically. Then, with the algorithm implemented and optimised on both CPU and CPU+GPU platforms, we showed that our algorithm shortens the computational time considerably, and it has a security advantage over the standard RSA as it is invulnerable to the common attacks. Finally, we also proved the feasibility of using our algorithm to encrypt large files through simulation. The results show that over the set of file size: 1 MB, 10 MB, 25 MB, 50 MB, 100 MB, the average encryption and decryption time of the CPU version is 0.2476 and 9.4476 s, and for the CPU+GPU version, it is 0.0009 and 0.0618 s, respectively.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"318 - 332"},"PeriodicalIF":1.1,"publicationDate":"2021-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47906123","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 : 2021-11-22DOI: 10.1080/17445760.2021.2004411
Suhan Jiang, Jie Wu
This paper focuses on a mobile-crowd federated learning system that includes a central server and a set of mobile devices. The server, acting as a model requester, motivates all devices to train an accurate model by paying them based on their individual contributions. Each participating device needs to balance between the training rewards and costs for profit maximization. A Stackelberg game is proposed to model interactions between the server and devices. To match with reality, our model takes the training deadline and the device-side upload time into consideration. Two reward policies, i.e. the size-based policy and accuracy-based policy, are compared. The existence and uniqueness of Stackelberg equilibrium (SE) under both policies are analyzed. We show that there is a lower bound of 0.5 on the price of anarchy in the proposed game. We extend our model by considering the uncertainty in the upload time. We also utilize the blockchain technique to ensure a truthful, trust-free, and fair system. This paper also analyzes how devices maximize their utilities when making profits via training and blockchain mining in the fixed-upload-time setting. A blockchain-powered testbed is implemented, and experiments are conducted to validate our analysis.
{"title":"A reward response game in the blockchain-powered federated learning system","authors":"Suhan Jiang, Jie Wu","doi":"10.1080/17445760.2021.2004411","DOIUrl":"https://doi.org/10.1080/17445760.2021.2004411","url":null,"abstract":"This paper focuses on a mobile-crowd federated learning system that includes a central server and a set of mobile devices. The server, acting as a model requester, motivates all devices to train an accurate model by paying them based on their individual contributions. Each participating device needs to balance between the training rewards and costs for profit maximization. A Stackelberg game is proposed to model interactions between the server and devices. To match with reality, our model takes the training deadline and the device-side upload time into consideration. Two reward policies, i.e. the size-based policy and accuracy-based policy, are compared. The existence and uniqueness of Stackelberg equilibrium (SE) under both policies are analyzed. We show that there is a lower bound of 0.5 on the price of anarchy in the proposed game. We extend our model by considering the uncertainty in the upload time. We also utilize the blockchain technique to ensure a truthful, trust-free, and fair system. This paper also analyzes how devices maximize their utilities when making profits via training and blockchain mining in the fixed-upload-time setting. A blockchain-powered testbed is implemented, and experiments are conducted to validate our analysis.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"68 - 90"},"PeriodicalIF":1.1,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46000297","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 : 2021-11-08DOI: 10.1080/17445760.2021.1991340
D. Zaitsev, Mengchu Zhou
Petri net paradigm of computing is concerned discussing basic types of Petri net computers and their relations. We developed a technique of parametric specification of Petri nets, built of a few connected components which are repeated depending on a parameter or a set of parameters, and composition of software to generate automatically the corresponding models in a vivid graphical form. We construct explicitly a Petri net that is a strong computer of double exponent after R.J. Lipton. Its nondeterministic computation is represented by a Petri net reachability graph to which a successful branch belongs. Then we minimise and transform the net to obtain twice smaller construct than the original one. Moreover, the obtained net possesses such a marvellous property that addingto it four priority arcs makes it an exact (deterministic) computer having a single firable sequence only. Same as the Lipton’s net, the minimized net allows the proof that the Petri net reachability problem is exponential in space. Besides, it represents an example when simple transformations allow guessing the successful branch of a nondeterministic computation. The practical significance of the approach in applications consists in a state-of-art heuristic technique of solving some NP problems in polynomial time.
{"title":"From strong to exact Petri net computers","authors":"D. Zaitsev, Mengchu Zhou","doi":"10.1080/17445760.2021.1991340","DOIUrl":"https://doi.org/10.1080/17445760.2021.1991340","url":null,"abstract":"Petri net paradigm of computing is concerned discussing basic types of Petri net computers and their relations. We developed a technique of parametric specification of Petri nets, built of a few connected components which are repeated depending on a parameter or a set of parameters, and composition of software to generate automatically the corresponding models in a vivid graphical form. We construct explicitly a Petri net that is a strong computer of double exponent after R.J. Lipton. Its nondeterministic computation is represented by a Petri net reachability graph to which a successful branch belongs. Then we minimise and transform the net to obtain twice smaller construct than the original one. Moreover, the obtained net possesses such a marvellous property that addingto it four priority arcs makes it an exact (deterministic) computer having a single firable sequence only. Same as the Lipton’s net, the minimized net allows the proof that the Petri net reachability problem is exponential in space. Besides, it represents an example when simple transformations allow guessing the successful branch of a nondeterministic computation. The practical significance of the approach in applications consists in a state-of-art heuristic technique of solving some NP problems in polynomial time.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"167 - 186"},"PeriodicalIF":1.1,"publicationDate":"2021-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48981115","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
扫码关注我们
求助内容：
应助结果提醒方式：