2 - System Modeling

Question 1

(Non-)Deterministic State Machine with Inputs/Outputs

Answer 1

defined by 5-triple M = (Q;I;O;delta;Q0) with Q (set of states) - I/O (I/O messages) - delta (transition function) - Q0 (initial states)

Question 2

Interfaces

Answer 2

Boundary between system and its context

Question 3

Abstract Computation Structure

Answer 3

Set of all computation structures that realize same access view + abstract view on support set and available functions

Question 4

Stream

Answer 4

Communication history of a channel on the discrete time N (data stream: sequence of messages)

Question 5

Hybrid Automation

Answer 5

real systems: discrete + continuous phenomena - eg. automobile engine (continuous fuel injection + discrete microcontroller)

Question 6

Behavioral Refinement

Answer 6

s1/s2: s2 => s1

Question 7

Interface Refinement

Answer 7

allow to change syntactic interface of a system

Question 8

Computation Structure

Answer 8

Family of support set and functions // PRO: combination of data descriptions and operations & independence of usage/realization

Question 9

Parts of a system

Answer 9

Scope (defines domains) + Interface (type of interaction)+ Context (sets system environment) + Structure (describes internal system)

Question 10

Reasons for Using System Models

Answer 10

Clear Notion + Depict Views + State informal descriptions

Question 11

Types Of State Machines

Answer 11

Deterministic State Machine (DFA) & Non-Deterministic State Machine (NFA)

Question 12

State View

Answer 12

Modeling of the states of a system and its behavior via transitions

Question 13

State Machines can be …

Answer 13

partial + total + deterministic + non-deterministic

Question 14

Model

Answer 14

Abstracted reflection of reality or system that has to be developed

Question 15

SysML

Answer 15

Systems Modeling Language: UML based standardized modeling language for complex systems

Question 16

(Non-)Deterministic State Machine with marked Transitions

Answer 16

defined by 4-triple M = (Q;A;delta;Q0) with Q (set of states) - A (set of actions) - delta (transition function) - Q0 (initial states)

Question 17

In general State Machines are defined as triple. Clarify.

Answer 17

Triple M = (Q; delta; Q0). Q (set of states) - delta (transition function) - Q0 (initial states)

Question 18

Syntactic Interface describes …

Answer 18

structure & type

Question 19

System is defined by …

Answer 19

syntactic and semantic interface + architecture specification

Question 20

Reachable States

Answer 20

R = initial state + every state that can be reached with the transition function

Question 21

Types of Views

Answer 21

Usage View (Black Box/Access/Interface view) & Implementation View (Glass Box/Realization View)

Question 22

Data Structure

Answer 22

Internal structure of data element + defines data representation and amount of memory consumption

Question 23

Semantic Interface describes …

Answer 23

Observable logical and temporal behavior

Question 24

Views help to … and show the system from …

Answer 24

Views help to design complex systems and show the system from a distinctive perspective

Question 25

A typical system consists out of views. Name them!

Answer 25

Data View & State View & Interface View

Question 26

Behavioral Equivalence

Answer 26

s1/s2: s1 <=> s2

Question 27

Important for System Modeling

Answer 27

Detect Requirements & Inconsistencies + Basis for Implementation + Specification of Functionality & Context Behavior

Question 28

Difference between Mealy & Moore

Answer 28

Mealy: output depends on current state & input // Moore: output depends only on the current state

Question 29

Refinements of Interface Modeling

Answer 29

Behavioral Refinement/Equivalence + Interface Refinement/Equivalence

Question 30

Interface Equivalence

Answer 30

systems are interface compatible with each other (can be replaced by another system with no further consequences)