检索结果-内蒙古大学图书馆

10th International Conference on Evaluation of Novel Approaches to Software Engineering (ENASE)

作者： Louise, Stephane CEA LIST PC172 F-91191 Gif Sur Yvette France

ISBN: (纸本)9789897581434

As computing systems are transitioning from multicores to manycores with the increasing number of computing resources available on modern chips, we can notice a lack of a universal programming model for these new platforms and the challenges they convey. Ideally speaking, a program should be written only once, and making it run on a given target would be the role of the compilation tools. But before addressing this problem, we need a good model of computation (MoC) as a base for both programming and compilation tools. In this paper we propose to share our insights on the properties such a MoC should possess. It would take the CycloStatic DataFlow (CSDF) MoC for its good properties, and extend it to overcome its limitations while retaining its good properties.

关键词： model of computation Embedded Manycore Systems Time-critical Systems

来源：评论

学校读者我要写书评

暂无评论

TURING MACHINES ON REPRESENTED SETS, A model of computation FOR ANALYSIS

引用

LOGICAL METHODS IN COMPUTER SCIENCE 2011年第2期7卷

作者： Tavana, Nazanin R. Weihrauch, Klaus Amirkabir Univ Technol Tehran Iran Univ Hagen Hagen Germany

We introduce a new type of generalized Turing machines (GTMs), which are intended as a tool for the mathematician who studies computability in Analysis. In a single tape cell a GTM can store a symbol, a real number, a continuous real function or a probability measure, for example. The model is based on TTE, the representation approach for computable analysis. As a main result we prove that the functions that are computable via given representations are closed under GTM programming. This generalizes the well known fact that these functions are closed under composition. The theorem allows to speak about objects themselves instead of names in algorithms and proofs. By using GTMs for specifying algorithms, many proofs become more rigorous and also simpler and more transparent since the GTM model is very simple and allows to apply well-known techniques from Turing machine theory. We also show how finite or infinite sequences as names can be replaced by sets (generalized representations) on which computability is already defined via representations. This allows further simplification of proofs. All of this is done for multi-functions, which are essential in Computable Analysis, and multi-representations, which often allow more elegant formulations. As a byproduct we show that the computable functions on finite and infinite sequences of symbols are closed under programming with GTMs. We conclude with examples of application.

关键词： computable analysis model of computation generalized Turing machine

来源：评论

学校读者我要写书评

暂无评论

RecDEVS: A Comprehensive model of computation for Dynamically Reconfigurable Hardware Systems

引用

IFAC Proceedings Volumes 2009年第21期42卷 137-142页

作者： Felix Madlener Alexander Biedermann Sorin A. Huss Integrated Circuits and Systems Lab Technische Universität Darmstadt

This paper introduces a novel formal model of computation denoted as RecDEVS. It is targeted to the development of dynamically reconfigurable hardware systems, a domain that still misses a formal design methodology. RecDEVS supports the description of hardware reconfiguration as a native part of a system model and thus can be used as a foundation of new design methodologies. Reconfiguration is addressed by means of a small set of reconfiguration commands and a dedicated executive component. Special care has been taken to support the flexible communication network of dynamically changeable hardware structures. We describe how RecDEVS benefits from the Dynamic Structure Discrete Event Specified Systems (DSDEVS) model that has been generalized. To illustrate the feasibility of the proposed approach the implementation of RecDEVS inside on top of SystemC based simulation engine is demonstrated.

关键词： Dynamic Reconfiguration RecDEVS model of computation Discrete Event Specified Systems

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous Semantic System for IEC 61499 Based on model of computation

Heterogeneous Semantic System for IEC 61499 Based on Model o...

引用

IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems

作者： Di Li Zhenkun Zhai Nan Zhou College of Mechanical and Automobile Engineering South China University of Technology

ISBN: (纸本)9781479987313

In order to improve the accuracy of execution model of control system design compliance with IEC 61499, this paper presents a heterogeneous semantic system based on model of computation. According to the dynamic behavior characteristics of various models in the reference architecture for system design in IEC 61499, different types of model of computation are chosen, such as Extended Interface Automata, Process Network, Timed Multitasking and so on. With the proposed semantic system, heterogeneous execution model of the control system can be build up. Through the simulation of heterogeneous execution model from a global perspective, it is able to effectively verify the functions and performance of control system in the early stage of system design.

关键词： IEC 61499 model of computation Heterogeneous Execution model control systems International Electrotechnical Commission Semantics arithmetic Heterogeneous Legal Executions System design

来源：评论

学校读者我要写书评

暂无评论

A computation model with automatic functions and relations as primitive operations

引用

THEORETICAL COMPUTER SCIENCE 2022年 924卷 94-116页

作者： Gao, Ziyuan Jain, Sanjay Li, Zeyong Sabili, Ammar Fathin Stephan, Frank Natl Univ Singapore Dept Math 10 Lower Kent Ridge RdS17 Singapore 119076 Singapore Natl Univ Singapore Dept Comp Sci 13 Comp DrCOM1 Singapore 117417 Singapore Natl Univ Singapore Ctr Quantum Technol 3 Sci Dr 2S15 Singapore 117543 Singapore

Prior work of Hartmanis and Simon [36] and Floyd and Knuth [30] investigated what happens if a device uses primitive steps more natural than single updates of a Turing tape. One finding was that in the numerical setting, addition, subtraction and bit-wise Boolean operations of numbers preserve polynomial time while incorporating concatenation or multiplication allows to solve all PSPACE problems in polynomially many steps. Therefore we propose to use updates and comparisons with automatic functions as primitive operations and use constantly many registers;the resulting model covers all primitive operations of Hartmanis and Simon as well as Floyd and Knuth, but the model remains in polynomial time. The present work investigates in particular the deterministic complexity of various natural problems and also gives an overview on the nondeterministic complexity of this model. (C) 2022 Elsevier B.V. All rights reserved.

关键词： Theory of computation model of computation Automatic function Register machine computational complexity

来源：评论

学校读者我要写书评

暂无评论

A model-Driven Approach to Enhance Tool Interoperability Using the Theory of models of computation

A Model-Driven Approach to Enhance Tool Interoperability Usi...

引用

6th International Conference on Software Language Engineering (SLE)

作者： Diallo, Papa Issa Champeau, Joel Lagadec, Loic ENSTA Bretagne Lab STICC UEB 2 F-29806 Brest 9 France

ISBN: (纸本)9783319026541;9783319026534

In the context of embedded systems design, the growing heterogeneity of systems leads to increasingly complex and unreliable tool chains. The model-Driven Engineering (MDE) community has been making considerable efforts to abstract tool languages in meta-models, and to offer model transformation mechanisms for model exchanges. However, the interoperability problems are recurring and still not consistently addressed. For instance, when it comes to executable model exchanges, it is very difficult to ensure the preservation of the models behavior from one tool to another. This is mainly due to a lack of understanding of the models of computation (MoC) and execution semantics behind the models within different environments. In this paper, we introduce a methodology and a framework to: make explicit the execution semantics of models (based on the theory of MoC);provide semantics enrichment mechanisms to ensure the preservation of the execution semantics of models between tools. Our case study is an integration between a UML specification tool and an industrial Intensive Data Flow processing tool. This contribution helps to highlight execution semantics concerns within the tool integration context.

关键词： model-Driven Engineering model of computation Tool Interoperability

来源：评论

学校读者我要写书评

暂无评论

Foundation of a computable solid modelling

引用

THEORETICAL COMPUTER SCIENCE 2002年第2期284卷 319-345页

作者： Edalat, A Lieutier, A Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2BZ England Dassault Syst Provence Aix En Provence France

Solid modelling and computational geometry are based on classical topology and geometry in which the basic predicates and operations, such as membership, subset inclusion, union and intersection, are not continuous and therefore not computable. But a sound computational framework for solids and geometry can only be built in a framework with computable predicates and operations. In practice, correctness of algorithms in computational geometry is usually proved using the unrealistic Real RAM machine model of computation, which allows comparison of real numbers, with the undesirable result that correct algorithms, when implemented, turn into unreliable programs. Here, we use a domain-theoretic approach to recursive analysis to develop the basis of an effective and realistic framework for solid modelling. This framework is equipped with a well defined and realistic notion of computability which reflects the observable properties of real solids. The basic predicates and operations on solids are computable in this model which admits regular and non-regular sets and supports a design methodology for actual robust algorithms. Moreover, the model is able to capture the uncertainties of input data in actual CAD situations. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： solid modelling robustness model of computation domain theory Turing computability

来源：评论

学校读者我要写书评

暂无评论

A model of Design for Computing Systems: A Categorical Approach

引用

IEEE ACCESS 2023年 11卷 116304-116347页

作者： Mohammadat, Tage Embedded Comp Syst S-11428 Stockholm Sweden KTH Royal Inst Technol S-11428 Stockholm Sweden

This paper introduces the model of design (MoD), a framework that leverages category theory to study the design and development of computer-driven systems, to the academic and engineering communities dealing with computer systems. The model of design aims to offer a minimal framework for modelling the design and development of embedded computation across domains and abstractions, focusing on functional and extra-functional aspects as well as overarching concerns for automaticity, correctness and reuse. This nuanced approach provides insights into the theory and practice of computer systems design.

关键词： Computing systems computer-aided design (CAD) electronic design automation (EDA) embedded system design architectural design model-driven engineering domain-specific modelling languages model of computation system-level design hardware/software co-design

来源：评论

学校读者我要写书评

暂无评论

A FORMAL THEORY OF SIMULATIONS BETWEEN INFINITE AUTOMATA

引用

FORMAL METHODS IN SYSTEM DESIGN 1993年第1-2期3卷 117-149页

作者： LOEWENSTEIN, P SUN MICROSYST INC MT VIEWCA 94043

Automata are suitable for modeling a wide range of sequential and concurrent hardware. They can be used at many levels of abstraction, from top-level specifications to register transfer descriptions suitable for input to synthesis tools. This paper covers approaches for relating one automaton with another using simulations and transformations on automata. The entire theory is mechanically derived in, and intended for use in a higher-order logic theorem prover. Because automaton-based models can be used at multiple abstraction levels, much of the formal verification of sequential and concurrent designs can be performed by composing and relating automata.

关键词： model of computation DEDUCTION AND THEOREM PROVING AUTOMATON THEORY

来源：评论

学校读者我要写书评

暂无评论

Refinement preserving approximations for the design and verification of heterogeneous systems

引用

FORMAL METHODS IN SYSTEM DESIGN 2007年第1期31卷 1-33页

作者： Passerone, Roberto Burch, Jerry R. Sangiovanni-Vincentelli, Alberto L. Univ Trent Dept Informat & Commun Technol I-38050 Trento Italy Synopsys Inc Hillsboro OR 97124 USA Univ Calif Berkeley Dept EECS Berkeley CA 94720 USA

Embedded systems are electronic devices that function in the context of a real environment, by sensing and reacting to a set of stimuli. Because of their close interaction with the environment, and to simplify their design, different parts of an embedded system are best described using different notations and different techniques. In this case, we say that the system is heterogeneous. We informally refer to the notation and the rules that are used to specify and verify the elements of heterogeneous systems and their collective behavior as a model of computation. In this paper, we consider different classes of relationships between models of computation and discuss their preservation properties with respect to the model's refinement relation and composition operator. In particular, we focus on abstraction and refinement relationships in the form of abstract interpretations and introduce the notion of conservative approximation. We show that, unlike abstract interpretations, conservative approximations preserve refinement verification results from an abstract to a concrete model while avoiding false positives. We also characterize the relationship between abstract interpretations and conservative approximations, and derive necessary and sufficient conditions to obtain a conservative approximation from a pair of abstract interpretations. In addition, we use the inverse of a conservative approximation to identify components that can be used indifferently in several models, thus enabling reuse across models of computation. The concepts described in this paper are illustrated with examples from continuous time and discrete time models of computation.

关键词： refinement preserving approximation abstraction verification heterogeneous reuse polymorphism model of computation Galois connection abstract interpretation conservative approximation continuous time discrete time refinement concretization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：