2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献_第7页

A New Scheme of Using Inference Inside Evolutionary Computation Techniques to Solve CSPs 一种利用进化计算技术内部推理求解csp的新方案

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2006-09-26 DOI: 10.1109/SYNASC.2006.7

M. Ionita, Mihaela Breaban, Cornelius Croitoru

引用次数: 1

Implementing Parameterized Type Algorithm Definitions in Mathematica 在Mathematica中实现参数化类型算法定义

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2006-09-26 DOI: 10.1109/SYNASC.2006.45

A. Andreica

引用次数: 3

Process Algebra Specification of Flexible Manufacturing Systems 柔性制造系统的过程代数规范

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2006-09-26 DOI: 10.1109/SYNASC.2006.64

M. Ruiz, D. Cazorla, F. Cuartero, J. J. Pardo

{"title":"Process Algebra Specification of Flexible Manufacturing Systems","authors":"M. Ruiz, D. Cazorla, F. Cuartero, J. J. Pardo","doi":"10.1109/SYNASC.2006.64","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.64","url":null,"abstract":"Nowadays, the success of the manufacturing industry is largely determined by its ability to respond to the rapidly changing market and customer needs. This has resulted in an increasing deployment of automated manufacturing equipment and systems that provide the agility to cope with these new demands. Flexible manufacturing systems (FMS) are the most widely used technology to cover these needs. Of course, these FMS must be studied in a formal frame, but the complexity and the dimension of real FMS has prevented from developing efficient control techniques and several challenges are still left. We face up these challenges and present a language that is able to specify nearly any type of real FMS. We use a timed process algebra called BTC (for bounded true concurrency) that we have developed from CSP and which takes into account that the available resources in a system have to be shared by all the processes. It is able to consider heterogeneous resources of any type (preemptable and non-preemptable) which makes it suitable for specifying FMS. We show by means of an example that the specifications obtained suit the real systems quite well and are straightforward. To the best of our knowledge, this is the first attempt to do this with process algebras, and we think that it is a good way, mainly, because we are able to split up the system into subsystems which are easier analyzed","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132412555","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}

引用次数: 2

A New Approach for Accelerating the Sparse Matrix-Vector Multiplication 一种加速稀疏矩阵-向量乘法的新方法

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2006-09-26 DOI: 10.1109/SYNASC.2006.4

P. Tvrdík, I. Šimeček

引用次数: 7

Doing Numerical Cosmology with the Cactus Code 用仙人掌代码做数值宇宙学

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2002-10-02 DOI: 10.1109/SYNASC.2006.32

D. Vulcanov

引用次数: 2

E-timed Workflow Nets e -time工作流网

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 1900-01-01 DOI: 10.1109/SYNASC.2006.33

F. Ţiplea, G. I. Macovei

引用次数: 11