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

18th IEEE Instrumentation and Measurement Technology Conference (IMTC/2001)

作者： Lee, EA Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)0780366468

Embedded software is increasingly a composition of concurrent components. Components in such systems interact in a rich variety of ways, not limited to the simple transfer of control of method calls in object-oriented design. I describe a view where the systems are modeled as assemblages of components within one of several models of computation, where components with well-defined interfaces are composed. The declaration of these component interfaces becomes a central problem, and the composition of properties becomes the central benefit. Unlike object-oriented interfaces, these interfaces must declare dynamic properties such as communication protocols and temporal properties. The model of computation must include shared information, such as time (a total ordering constraint), or causality (a partial ordering constraint). The properties of a model of computation strongly determine the problems that it matches, and frequently, practical systems are forced to use multiple models of computation. I briefly describe how this can be done systematically.

关键词： embedded software models of computation concurrency real time frameworks architectural patterns

来源：评论

学校读者我要写书评

暂无评论

A Smart Display Component Model For Embedded Systems Modeling and Simulation

A Smart Display Component Model For Embedded Systems Modelin...

引用

SAI Computing Conference (SAI)

作者： Feredj, Mohamed Univ Sci & Technol Houari Boumediene Fac Elect & Comp Sci Dept Comp Sci 32 Al Alia Algiers Algeria

ISBN: (纸本)9781467384605

Embedded systems are in continuous interaction with their environment and mix several technical domains. So, they are heterogeneous and very complex. The tools and the platforms of the embedded systems modeling must make tasks of the designer easy by proposing new component models and new modeling approaches. The process of embedded systems modeling ends with a validation step. The validation by simulation must use display components to show the output data produced by the model of system. However, since the output data are heterogeneous and they have different semantics (e.g. continuous semantic, discrete semantic, data flow semantic, etc.), we must use for each output data type a display specific component. Consequently, this increases the number of display specific components and annoys the designer and reduces the reusability. In this paper, we propose a smart display component that has the capability to display any output data type. It is able to adapt its behavior and structure to the semantic of output data type. It is not a competitor to display specific components but it resolves their weakness and it simplifies the complexity of their use. Also, it allows the reusability of the display components in embedded systems modeling and simulation. Its design is based on the application of the separation of concerns principle to the display specific components. Indeed, the designer uses a single display component to display any output data type of its systems instead of use several display specific components. We also present an implementation and a validation of the smart display component in the Ptolemy II platform.

关键词： Embedded Systems Heterogeneous Modeling models of computation Actor Approach

来源：评论

学校读者我要写书评

暂无评论

Computability, Complexity and Programming with Ordinary Differential Equations 37

Computability, Complexity and Programming with Ordinary Diff...

引用

37th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Bournez, Olivier Inst Polytech Paris Ecole Polytech CNRS Lab Informat X LIX F-91128 Palaiseau France

ISBN: (纸本)9783959771405

Ordinary Differential Equations (ODEs) appear to be a universally adopted and very natural way for expressing properties for continuous time dynamical systems. They are intensively used, in particular in applied sciences. There exists an abundant literature about the hardness of solving ODEs with numerical methods. We adopt a dual view: we consider ODEs as a way to program or to describe our mathematical/computer science world. We survey several results considering ODEs under this computational perspective, with a computability and complexity theory point of view. In particular, we provide various reasons why polynomial ODEs should be considered as the continuous time analog of Turing machines for continuous-time computations, or should be used as a way to talk about mathematical logic. This has already applications in various fields: determining whether analog models of computation can compute faster than classical digital models of computation;solving complexity issues for computations with biochemical reactions in bioinformatics;machine independent characterizations of various computability and complexity classes such as PTIME or NPTIME, or proof of the existence of a universal polynomial ordinary differential equation whose solutions can approximate any continuous function if provided with a suitable well-chosen initial condition.

关键词： Ordinary differential equations models of computation Analog computations discrete ordinary differential equations Implicit complexity recursion scheme

来源：评论

学校读者我要写书评

暂无评论

Configuring the deployment into software-based controllers through hierarchical simulations

引用

IFAC-PapersOnLine 2017年第1期50卷 4330-4335页

作者： Barbieri G. Borsari R. Fantuzzi C. University of Modena and Reggio Emilia Via Amendola 2 Reggio Emilia 42122 Italy Tetra Pak Packaging Solutions SpA Via Delfini 1 Modena 41123 Italy

The deployment of control algorithms into software-based controllers is fundamental for the correctness of the designed application. Deployment involves both the configuration of design choices and the management of unpredictable behaviors of controllers. Tools and methodologies must be identified for supporting the activity. This paper proposes to break-down the deployment process into layers of abstraction. Simulations and modeling patterns are introduced for configuring the design choices of each abstraction layer. However, the verification of the approach through the application to real case studies will be matter of future works. © 2017

关键词： Cyber-Physical Systems Model-based Design models of computation Software Deployment

来源：评论

学校读者我要写书评

暂无评论

RDF: Reconfigurable Dataflow 22

RDF: Reconfigurable Dataflow

引用

22nd Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Fradet, Pascal Girault, Alain Krishnaswamy, Ruby Nicollin, Xavier Shafiei, Arash Univ Grenoble Alpes INRIA CNRS Grenoble INPLIG F-38000 Grenoble France Orange Paris France

ISBN: (纸本)9783981926323

Dataflow models of computation (MoCs) are widely used in embedded systems, including multimedia processing, digital signal processing, telecommunications, and automatic control. In a dataflow MoC, an application is specified as a graph of actors connected by FIFO channels. One of the most popular dataflow MoCs, Synchronous Dataflow (SDF), provides static analyses to guarantee boundedness and liveness, which are key properties for embedded systems. However, SDF (and most of its variants) lacks the capability to express the dynamism needed by modern streaming applications. In particular, the applications mentioned above have a strong need for reconfigurability to accommodate changes in the input data, the control objectives, or the environment. We address this need by proposing a new MoC called Reconfigurable Dataflow (RDF). RDF extends SDF with transformation rules that specify how the topology and actors of the graph may be reconfigured. Starting from an initial RDF graph and a set of transformation rules, an arbitrary number of new RDF graphs can be generated at runtime. A key feature of RDF is that it can be statically analyzed to guarantee that all possible graphs generated at runtime will be consistent and live. We introduce the RDF MoC, describe its associated static analyses, and outline its implementation.

关键词： models of computation Synchronous dataflow Reconfigurable systems Static analyses Boundedness Liveness

来源：评论

学校读者我要写书评

暂无评论

Strategies to Improve Synchronous Dataflows Analysis Using Mappings between Petri Nets and Dataflows

引用

5th IFIP WG 5.5/SOCOLNET Doctoral Conference on Computing, Electrical and Industrial Systems (DoCEIS)

作者： Rocha, Jose-Inacio Dias, Octavio Pascoa Gomes, Luis Univ Nova Lisboa Fac Ciencias & Tecnol P-1200 Lisbon Portugal Escola Super Tecnol Setubal Setubal Portugal Univ Nova Lisboa Ctr Tecnol Sistemas Setubal Portugal

ISBN: (纸本)9783642547348;9783642547331

Over the last decades a large variety of dataflow solutions emerged along with the proposed models of computation (MoC), namely the Synchronous Dataflows (SDF). These MoCs are widely used in streaming based systems such as data and video dominated systems. The scope of our work will be on consistent dataflow properties that can be easily demystified and efficiently determined with the outlined mapping approach between Dataflows and Petri nets. Along with this strategy, it is also highlighted that it's of a major relevance knowing in advance the proper initial conditions to start up any SDF avoiding buffer space over dimensioning. The methodology discussed in this paper improves the outcomes produced so far (in Petri net domain) at design stage aiming at knowing the amount of storage resource required, as well as has a substantial impact in the foreseen allocated memory resources by any signal processing system at the starting point and also points out new directions to minimize the buffer requirements at design stage.

关键词： Dataflows Petri nets Synchronous Dataflows Place and Transition Invariants models of computation

来源：评论

学校读者我要写书评

暂无评论

An implementation of syntax directed functional programming on nested-stack machines

引用

Formal Aspects of Computing 1992年第4期4卷 341-375页

作者： Fassbender, Heinz Vogler, Heiko Lehrstuhl für Informatik II RWTH Aachen Aachen Germany

This paper contributes to the field of functional programming languages. We investigate the call-by-name and call-by-need implementation of a restricted type of functional programming, called syntax directed functional programming;the target of this implementation is an abstract machine that is based on nested stacks. In fact, the technical kernel of this paper is a refinement of an automata theoretical result that, roughly speaking, investigates the well-known relationship "recursion = iteration + stack" in the framework of tree transducers. More precisely, in the underlying result the class of functions computed by total deterministic macro tree-to-string transducers with the call-by-name computation strategy is characterized by total deterministic checking-tree nested-stack transducers. Note that total deterministic macro tree-to-string transducers are term rewriting systems by means of which the reduction semantics of syntax directed functional programming languages can be described. © 1992 BCS.

关键词： Formal languages models of computation Semantics of programming languages

来源：评论

学校读者我要写书评

暂无评论

Transaction-level Functional Mockup Units for Cyber-Physical Virtual Platforms

Transaction-level Functional Mockup Units for Cyber-Physical...

引用

Forum on Specification and Design Languages

作者： Centomo, Stefano Lora, Michele Fummi, Franco Univ Verona Dept Comp Sci Verona Italy

ISBN: (纸本)9781538664186

The modelling process of Cyber-physical Systems aggregates semantics and languages tailored to different specific domains. The simulation of these complex systems involves different tools and their coupling requires computational effort. In the last few years both Academy and Industry worked toward the definition of standard interfaces able to overcome such issues. The Functional Mock-up Interface (FMI) standard emerged as one of the most promising tool to easily export and integrate heterogeneous models. However, the standard still shows some weaknesses, particularly when dealing with Functional Mock-up Units (FMUs) describing discrete-event systems. This paper explore the features of the standard to find its shortcomings when dealing with discrete models. Then, it proposes a systematic approach to fully exploit the features of the current standards to overcome such limitations. The solution is based on two concepts: (1) exposing the internal time of the FMUs, and (2) exploits the newly exposed information to implement temporal decoupling. The combination of these two concepts allows to optimize the FMUs coordination algorithms. It reduces the number synchronization points and move the simulation from cycle-accurate to transaction-accurate. The impact of these optimizations is measured on a set of benchmarks having different tread-offs of computation and control.

关键词： Co-simulation Functional Mock-up Interface Transaction-Level models of computation Automatic Abstraction

来源：评论

学校读者我要写书评

暂无评论

Design and Performance Analysis of Real-Time Dynamic Streaming Applications 1

引用

31st International Workshop on Languages and Compilers for Parallel Computing (LCPC)

作者： Do, Xuan Khanh Louise, Stephane Cohen, Albert CEA LIST F-91191 Gif Sur Yvette France INIRA 45 Rue Ulm F-75005 Paris France ENS 45 Rue Ulm F-75005 Paris France

ISBN: (数字)9783030346270

ISBN: (纸本)9783030346270;9783030346263

Static dataflow graphs enable powerful design, implementation and analysis methods for embedded systems. Nevertheless, complex signal and media processing applications-such as cognitive radio or modern video codecs-display dynamic behavior that do not fit the classical cyclo-static restrictions. An approach to tackle this limitation combines integer parameters-to express dynamic rates-with control actors-to allow topology and mode changes as well as time-dependent scheduling and constraints, as introduced in the Transaction Parameterized Dataflow (TPDF) model of computation. In this paper we present a technique to automatically analyse the static properties of a TPDF application, including consistency, liveness, boundedness and worst-case throughput. Our implementation of these analyses is validated against a set of real-life dynamic applications, demonstrating significant buffer size and throughput improvements compared to the state of the art models, including Cyclo-Static Dataflow (CSDF) and Scenario-Aware Dataflow (SADF).

关键词： models of computation Dataflow Performance of systems

来源：评论

学校读者我要写书评

暂无评论

The computational Manifold Approach to Consciousness and Symbolic Processing in the Cerebral Cortex

The Computational Manifold Approach to Consciousness and Sym...

引用

7th IEEE International Conference on Cognitive Informatics (ICCI 2008)

作者： Greer, Douglas S. Gen Manifolds Carlsbad CA 92009 USA

ISBN: (纸本)9781424425389

A new abstract model of computation, the computational manifold, provides a framework for approaching the problems of consciousness, awareness, cognition and symbolic processing in the central nervous system. Physical properties involving space, time and frequency, such as the surface of the skin, sound spectrograms, visual images, and the muscle cross-sections are included in the state of manifold automata. The Brodmann areas are modeled as recurrent image associations implemented as neurotransmitter fields. Symbols are defined by state transition behavior near reciprocal-image attractors in dynamical systems. Control masks overlay the images and regulate awareness of the environment and cognitive reflection.

关键词： natural intelligence consciousness perception cognition models of computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：