2. Specification and Modeling

Slides:



Advertisements
Similar presentations
Technische universität dortmund fakultät für informatik informatik 12 Models of computation Peter Marwedel TU Dortmund Informatik 12 Graphics: © Alexandra.
Advertisements

Network II.5 simulator ..
Technische universität dortmund fakultät für informatik informatik 12 Specifications and Modeling Peter Marwedel TU Dortmund, Informatik 12 Graphics: ©
Fakult ä t f ü r informatik informatik 12 technische universit ä t dortmund Data flow models Peter Marwedel TU Dortmund, Informatik 12 Graphics: © Alexandra.
Technische universität dortmund fakultät für informatik informatik 12 Discrete Event Models Peter Marwedel TU Dortmund, Informatik 12 Germany
Embedded System, A Brief Introduction
Petri Nets Jian-Jia Chen (slides are based on Peter Marwedel)
Technische universität dortmund fakultät für informatik informatik 12 Discrete Event Models Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund,
Parallel Processing & Parallel Algorithm May 8, 2003 B4 Yuuki Horita.
Models of Concurrency Manna, Pnueli.
Hardware Description Language (HDL)
Give qualifications of instructors: DAP
Fakultät für informatik informatik 12 technische universität dortmund Specifications - Session 5 - Peter Marwedel TU Dortmund Informatik 12 Germany Slides.
The Concept of Computer Architecture
CS 151 Digital Systems Design Lecture 37 Register Transfer Level
DATAFLOW PROCESS NETWORKS Edward A. Lee Thomas M. Parks.
Activity Diagrams [Arlow and Neustadt, 2005] CS 425 / 625 Seminar on Software Engineering University of Nevada, Reno Department of Computer Science & Engineering.
CS 584. A Parallel Programming Model We need abstractions to make it simple. The programming model needs to fit our parallel machine model. Abstractions.
A denotational framework for comparing models of computation Daniele Gasperini.
1 CS 426 Senior Projects Chapter 14: Activity Diagrams [Arlow and Neustadt, 2005] February 17, 2009.
Dataflow Process Networks Lee & Parks Synchronous Dataflow Lee & Messerschmitt Abhijit Davare Nathan Kitchen.
Models of Computation for Embedded System Design Alvise Bonivento.
Silicon Programming--Intro. to HDLs1 Hardware description languages: introduction intellectual property (IP) introduction to VHDL and Verilog entities.
VLSI DSP 2008Y.T. Hwang3-1 Chapter 3 Algorithm Representation & Iteration Bound.
Chapter 3 : Software Process and Other Models Juthawut Chantharamalee Curriculum of Computer Science Faculty of Science and Technology, Suan Dusit University.
Course Outline DayContents Day 1 Introduction Motivation, definitions, properties of embedded systems, outline of the current course How to specify embedded.
SOFTWARE DESIGN AND ARCHITECTURE LECTURE 21. Review ANALYSIS PHASE (OBJECT ORIENTED DESIGN) Functional Modeling – Use case Diagram Description.
Ch. 2. Specification and Modeling 2.1 Requirements Describe requirements and approaches for specifying and modeling embedded systems. Specification for.
Languages for HW and SW Development Ondrej Cevan.
SOFTWARE DESIGN. INTRODUCTION There are 3 distinct types of activities in design 1.External design 2.Architectural design 3.Detailed design Architectural.
© 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1 UML Activity Diagrams.
Modern VLSI Design 4e: Chapter 8 Copyright  2008 Wayne Wolf Topics VHDL register-transfer modeling: –basics using traffic light controller; –synthesis.
6. A PPLICATION MAPPING 6.3 HW/SW partitioning 6.4 Mapping to heterogeneous multi-processors 1 6. Application mapping (part 2)
Introduction Object oriented design is a method where developers think in terms of objects instead of procedures or functions. SA/SD approach is based.
1 Hardware description languages: introduction intellectual property (IP) introduction to VHDL and Verilog entities and architectural bodies behavioral,
Modelling by Petri nets
1 Copyright  2001 Pao-Ann Hsiung SW HW Module Outline l Introduction l Unified HW/SW Representations l HW/SW Partitioning Techniques l Integrated HW/SW.
CAP 4800/CAP 5805: Computer Simulation Concepts
Chapter 14: Activity Diagrams November 2015 [Arlow and Neustadt, 2005] CS 425/625 Senior Projects University of Nevada, Reno Department of Computer Science.
Finite State Machines (FSM) OR Finite State Automation (FSA) - are models of the behaviors of a system or a complex object, with a limited number of defined.
VHDL Discussion Subprograms IAY 0600 Digital Systems Design Alexander Sudnitson Tallinn University of Technology 1.
Digital System Design using VHDL
High Performance Embedded Computing © 2007 Elsevier Chapter 1, part 3: Embedded Computing High Performance Embedded Computing Wayne Wolf.
High Performance Embedded Computing © 2007 Elsevier Lecture 4: Models of Computation Embedded Computing Systems Mikko Lipasti, adapted from M. Schulte.
1 Advanced Embedded Systems Lecture 3 Specification Languages.
State Modeling. Introduction A state model describes the sequences of operations that occur in response to external stimuli. As opposed to what the operations.
Technische universität dortmund fakultät für informatik informatik 12 Finite state machines & message passing: SDL Peter Marwedel TU Dortmund, Informatik.
SUBJECT : DIGITAL ELECTRONICS CLASS : SEM 3(B) TOPIC : INTRODUCTION OF VHDL.
Data Flow Diagrams.
Object-Oriented Analysis and Design
Timing Model Start Simulation Delay Update Signals Execute Processes
Event Relation Graphs and Extensions in Ptolemy II
Embedded System Design Specifications and Modeling
UML Activity Diagrams & State Charts
CAP 4800/CAP 5805: Computer Simulation Concepts
CAP 4800/CAP 5805: Computer Simulation Concepts
Unified Modeling Language
CS341 Digital Logic and Computer Organization F2003
Chapter 14: Activity Diagrams
VHDL Discussion Subprograms
BPMN - Business Process Modeling Notations
Background and Motivation
Chapter 14: Activity Diagrams
VHDL Discussion Subprograms
Specifications and Modeling
CAP 4800/CAP 5805: Computer Simulation Concepts
Chapter 14: Activity Diagrams
Design Yaodong Bi.
Introduction to System-Level Modeling in SystemC 2.0
Petri Nets Laurie Frazier.
Presentation transcript:

2. Specification and Modeling 2. Spec. & Modeling 2.5 Data Flow 2.6 Petri nets 2.7 Discrete event based languages 2.8 Von-Neumann languages

2.5 Data flow 2.5.1 Scope 2.5.2 Kahn process networks Def: Data flow modeling “is the process of identifying modeling and documenting how data moves around an information system. Data flow modeling examines processes, data stores, external entities, data flows”. A data flow diagram is specified by a directed graph where the nodes, called actors, represent computation and the arc represent communication channels. 2.5.2 Kahn process networks KPNs consist of nodes and edges. Nodes correspond to computations performed by some program or task. Edges imply communication via channels containing potentially infinite FIFOs. Fig. 2.40 shows a graphical representation of the KPN (p. 63). 2. Spec. & Modeling

2.5.3 Synchronous data flow SDF can best be introduced by referring to its graphical notation. Graphical representation of synchronous data flow For each execution for computation in a node is called a firing. For each firing, a number of token, representing data, is consumed and produced. Constant edge labels denote the corresponding numbers of tokens. Multi-rate SDF model Let ns be the number of tokens produced by some sender per firing, and let fr be the corresponding rate. * + 1 A B * + 1 A B D 2. Spec. & Modeling fs fr FIFO ns nr

2.6 Petri Nets 2.6.1 Introduction Petri nets model only control and control dependencies. Conditions, events and a flow relation are the key elements of Petri nets. Conditions are either satisfied or not satisfied. Events can happens. The flow relation describes the condition that must be met before events can happen and it also describes the conditions that become true if events happen. 2. Spec. & Modeling

2.7 Discrete event based language The discrete event-based model of computation is based on the idea of simulating the generation of events and the processing of event over time. 2.7.1 VHDL VHDL uses processors for modeling concurrency. 2. Spec. & Modeling

2.7.2 SystemC and SystemVerilog SystemC is a C++ class library designed to solve these problems: concurrency, time, multiple-valued logic and determinate behavior. Verilog is another hardware description language. Verilog versions 3.0 and 3.1 are also known as SystemVerilog. They include numerous extensions to Verilog 2.0. (p.99) 2. Spec. & Modeling

2.8 Von-Neumann language 2.8.1 CSP 2.8.2 ADA CSP (communicating sequential processes) is one of the first language comprising mechanisms for inter-process communication. Both processes will wait for the other process to service at the input or output statement. This is a case of rendez-vous-based, blocking or synchronous message passing. 2.8.2 ADA 2. Spec. & Modeling

2.8.3 Java 2. Spec. & Modeling