Using an Extension of Z. Viktor Friesen. Technische Universitat Berlin

Size: px
Start display at page:

Download "Using an Extension of Z. Viktor Friesen. Technische Universitat Berlin"

Transcription

1 An Exercise in Hybrid System Specication Using an Extension of Z Extended Abstract Viktor Friesen Technische Universitat Berlin Abstract. The main concepts of ZimOO are illustrated by a small case study, a specication of a protected cooker. ZimOO is an extended subset of Object-Z and allows descriptions of discrete and continuous features of systems in a common formalism. 1 Introduction The primary motivation for the development of ZimOO was the need to describe models for the dynamic simulation of complex energy systems in a readable and abstract but formal style. The investigation of models to be simulated shows that nearly all of them are hybrid in nature. Hence, the application domain of ZimOO has changed from dynamic simulation models to the more general area of hybrid systems [3, 4]. ZimOO is still under development; its present status is described in [2]. ZimOO is based on Object-Z [1], an object-oriented extension of Z [5]. A system specication in Z consists of a description of the global system state and a set of operations describing how this state can be changed. Object-Z provides additional means for describing systems in an objectoriented style, i.e., an Object-Z specication consists of a set of classes, each containing a state description and a set of operations. Z and Object-Z support only specications of discrete systems. ZimOO is an extended subset of Object-Z allowing descriptions of discrete and continuous features of a system in a common formalism. ZimOO supports three dierent kinds of classes: discrete (as in Object-Z), continuous, and hybrid classes. In the current version of ZimOO, discrete classes can inherit only from discrete classes, continuous only from continuous classes, and hybrid only from hybrid classes. Hybrid classes are created by introducing discrete and continuous object-valued variables. The information interchange between discrete and continuous objects is realized by control variables, which transfer data from the discrete to the continuous world and vice versa. A clear distinction between discrete and continuous classes is important in order to adequately treat the dierent aspects of a system. Thus, the system can be structured better and the well-known suitable formalisms can be applied to describe, analyze, and rene the dierent parts of the system. The bridge between the continuous and the discrete world is built by hybrid classes. Forschungsgruppe Softwaretechnik (FR5-6), Franklinstr. 28/29, D Berlin, Germany. friesen@cs.tu-berlin.de 1

2 2 A Specication Example We now illustrate the main features of ZimOO by a simple example: a cooker which is safeguarded against consuming too much power. This cooker consists of several plates which are safeguarded against overheating. In the last step of the specication, some pans containing water will be put to heat on the cooker. In the rst step, we specify a simple heat store which can be described by four continuous variables: temperature T, mass m, specic heat capacitance cp, and the change of heat dq, which are declared in the declaration part of the state schema of the continuous class HeatStore (continuous classes are recognizable by their round corners). Continuous state variables are semantically interpreted as total functions from T (time) to the type of the variable. The types Temperature, Mass etc. are equal to R and serve only to enhance readability of the specication. The relationship between the state variables is governed by the dierential equation T _ = dq =(m cp) described in the predicate part of the state schema, which species the state invariant of HeatStore. HeatStore T : Temperature [K ] m : Mass [kg] cp : SpecicCapacitance [J =kg=k ] dq : dheat [J =s] _T = dq=(m cp) An embedded heat store with a specic area A and a heat transfer coecient (both are constant and are thus declared in the so-called axiomatic part of the class) is a heat store with additional state variables T Env, dqheating, dqtransfer, and dqtransform. T Env denotes the temperature of the environment, dqheating is the power provided to the heat store, dqtransfer is the power transferred from the store to the environment, and dqtransform is the power lost through energy transformation. The two algebraic equations describe how dqtransfer and dq depend on the other state variables. EmbeddedHeatStore HeatStore A : Area [m 2 ] : Coecient [J =K =m 2 =s] T Env : Temperature dqheating; dqtransfer; dqtransform : dheat dqtransfer = A (T? T Env) dq = dqheating? dqtransfer? dqtransform A cooker plate is an embedded heat store which transforms electrical energy into heat. Thus, Plate contains the constant R and the variables U and I to describe the electrical 2

3 Plate EmbeddedHeatStore R : Resistance U : Voltage I : Current [Ohm ()] [Volt (V)] [Ampere (A)] dqheating = I 2 R dqtransform = 0 U = I R behaviour of the plate. A plate fuse consists of a discrete and a continuous part. The discrete class PlateFuseControl describes the computational behaviour of the fuse. The constants T min and T max mark the switching points of the controller. PowerReq is a discrete state variable indicating whether the plate requires energy. Discrete state variables are interpreted as partial functions from time to their types, because they are undened during the execution of operations which may take some time in our approach. Discrete variables can assume only a nite number of values in every nite period of time. T? is a continuous control variable representing the temperature of the process to be controlled (the plate in our example). (Control variables are labelled with a question mark.) The discrete operation VoltageControl species the computation instruction for the new value of PowerReq. PlateFuseControl T min; T max : Temperature T min < T max PowerReq : 0 j 1 T? : Temperature VoltageControl (PowerReq) PowerReq 0 = IF (T? > T max) THEN 0 ELSE IF (T? < T min) THEN 1 ELSE PowerReq VoltageAmplier species a simple \amplier", i. e. it multiplies the ingoing voltage by the value of the discrete control variable Factor? and provides the result as the output voltage. PlateFuse consists of a PlateFuseControl and a VoltageAmplier, and must therefore be described by a hybrid class. The current version of ZimOO does not allow the building of hybrid classes by inheritance from discrete and continuous classes, so we do this by declaring the object-valued variables Control and Ampl. The predicate part of the state schema species the connections between state and control variables. The usual dot notation is used to denote the access to attributes of objects. The control variables are connected by \" to the corresponding state variables of other objects, to distinguish this connection from simple equality (the -relation is weaker than equality because discrete variables may be partial). 3

4 VoltageAmplier Factor? : R InU ; OutU : Voltage OutU = Factor? InU PlateFuse Control : PlateFuseControl Ampl : VoltageAmplier Control:PowerReq Ampl:Factor? A safe plate consists of a plate Pl and a fuse Fu, whereby the control variable Fu:Control :T? of the fuse inspects the temperature Pl :T of the plate, and the voltage Pl :U of the plate is connected to the outgoing voltage of the fuse. This small hybrid system is described in the hybrid class SafePlate. SafePlate Pl : Plate Fu : PlateFuse Pl:T Fu:Control:T? Pl:U = Fu:Ampl:OutU To specify a cooker with Number plates we start with a description of a control unit. It should ensure that the power consumption of the cooker never exceeds MaxPower. VoltageNeeded denotes the maximal voltage which, if transmitted to the plates, would make the current power equal to MaxPower. The discrete operation VoltageControl species the computation instruction for Factor to adjust the voltage transmitted to the plates. CookerFuseControl Number : N 1 MaxPower : Power MaxPower > 0 InU? : Voltage OutU? : Voltage I? : 1 : : Number! Current VoltageNeeded : Voltage Factor : R VoltageControl (VoltageNeeded ; Factor) q VoltageNeeded 0 = MaxPower (OutU P Number?= i=1 I?(i)) Factor 0 = IF (VoltageNeeded 0 InU?) _ VoltageNeeded 0 = 0 THEN 1 ELSE VoltageNeeded 0 =InU? Similar to PlateFuse, a CookerFuse is built from a discrete control unit and a simple amplier. 4

5 CookerFuse Control : CookerFuseControl Ampl : VoltageAmplier Control:Factor Ampl:Factor? Control:InU? Ampl:InU Control:OutU? Ampl:OutU A safe cooker consists of Number safe plates and a cooker fuse, whereby the i-th output voltage of the cooker fuse is connected to the voltage of the i-th safe plate. SafeCooker Number : N 1 Plates : 1 : : Number! SafePlate Fu : CookerFuse Number = Fu:Control:Number 8 i : 1 : : Number Plates(i):Fu:Ampl:InU = Fu:Ampl:OutU (i) 8 i : 1 : : Number Plates(i):Pl:I Fu:Control:I?(i) In the last step of the example, some pans containing water are put to heat on the cooker. A Pan is an extension of an embedded heat store, whereby the characteristics of Pan (m, cp) are determined by the characteristics of the pan itself and the water it contains. Pan contains two continuous state variants (WaterNotBoiling and WaterBoiling). Such a variant consists of a guard condition and the variant itself. The variant is relevant in a particular point of time only if the evaluation of the guard condition is true, otherwise it can be neglected. Pan EmbeddedHeatStore m Pan : Mass cp Water; cp Pan : SpecicCapacitance r : R [evaporation enthalpy] m Water : Mass cp = (cp Water m Water + cp Pan m Pan)=(m Water + m Pan) m = m Water + m Pan WaterNotBoiling T 373 _ m Water 0 dqtransform = 0 _ m Water = 0 WaterBoiling T > 373 ^ m Water > 0 dqtransform = dqheating? dqtransfer _ m Water =?dqheating=r 5

6 Now we can extend the safe cooker by Number pans and regard the pans as the environment of the plates (the energy transferred from the plate to the air is neglected). CookerWithPans SafeCooker Pans : 1 : : Number! Pan 8 i : 1 : : Number Plates(i):Pl:dQTransfer = Pans(i):dQHeating 8 i : 1 : : Number Plates(i):Pl:T Env = Pans(i):T 3 Conclusion The paper presented a case study in the formal specication of hybrid systems. Owing to lack of space, the presentation was unfortunately quite technical. Nevertheless, the example shows that ZimOO can, in principle, be used to produce descriptions of systems that are suitable for human readers and can be processed by machines. The rst property is achieved by familiar mathematics, object-oriented structuring means, and graphical notations. A wide use of comments can signicantly enhance the readability of ZimOO documents. ZimOO specications cannot be executed directly, because the level of description is too abstract. Nevertheless, such descriptions can be analyzed and manipulated by machines to support the interactive development of executable code. References [1] R. Duke, P. King, G. A. Rose, and G. Smith. The Object-Z specication language. In T. Korson, V. Vaishnavi, and B. Meyer, editors, Technology of Object-Oriented Languages and Systems: TOOLS 5, pages 465{483. Prentice Hall, [2] V. Friesen. Konzepte einer hybriden Spezikationssprache fur Simulationssysteme. Teilbericht der Gruppe H zur zweiten Projektphase des UF 4, Institut fur Angewandte Informatik (Softwaretechnik), TU Berlin, [3] O. Maler, Z. Manna, and A. Pnueli. From timed to hybrid systems. In J. W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science, pages 446{484. Springer-Verlag, [4] Z. Manna and A. Pnueli. Verifying hybrid systems. In R. Grossman, A. Nerode, H. Rischel, and A. Ravn, editors, Hybrid Systems, volume 736 of Lecture Notes in Computer Science, pages 4{35. Springer-Verlag, [5] M. Spivey. The Z Notation, A Reference Manual. Prentice Hall, second edition,

2 Real-Time Systems Real-time systems will be modeled by timed transition systems [7, 15]. A timed transition system S = hv; ; ; T ; L; Ui consists of

2 Real-Time Systems Real-time systems will be modeled by timed transition systems [7, 15]. A timed transition system S = hv; ; ; T ; L; Ui consists of Verication in Continuous Time by Discrete Reasoning? Luca de Alfaro and Zohar Manna Comper Science Department Stanford University Stanford, CA 94305, USA fluca,zmg@cs.stanford.edu 1 Introduction There

More information

An Algebraic Approach to Hybrid Systems

An Algebraic Approach to Hybrid Systems An Algebraic Approach to Hybrid Systems R. L. Grossman and R. G. Larson Department of Mathematics, Statistics, & Computer Science (M/C 249) University of Illinois at Chicago Chicago, IL 60680 October,

More information

Validating an A Priori Enclosure Using. High-Order Taylor Series. George F. Corliss and Robert Rihm. Abstract

Validating an A Priori Enclosure Using. High-Order Taylor Series. George F. Corliss and Robert Rihm. Abstract Validating an A Priori Enclosure Using High-Order Taylor Series George F. Corliss and Robert Rihm Abstract We use Taylor series plus an enclosure of the remainder term to validate the existence of a unique

More information

output H = 2*H+P H=2*(H-P)

output H = 2*H+P H=2*(H-P) Ecient Algorithms for Multiplication on Elliptic Curves by Volker Muller TI-9/97 22. April 997 Institut fur theoretische Informatik Ecient Algorithms for Multiplication on Elliptic Curves Volker Muller

More information

Differential Equations and Linear Algebra Supplementary Notes. Simon J.A. Malham. Department of Mathematics, Heriot-Watt University

Differential Equations and Linear Algebra Supplementary Notes. Simon J.A. Malham. Department of Mathematics, Heriot-Watt University Differential Equations and Linear Algebra Supplementary Notes Simon J.A. Malham Department of Mathematics, Heriot-Watt University Contents Chapter 1. Linear algebraic equations 5 1.1. Gaussian elimination

More information

7. F.Balarin and A.Sangiovanni-Vincentelli, A Verication Strategy for Timing-

7. F.Balarin and A.Sangiovanni-Vincentelli, A Verication Strategy for Timing- 7. F.Balarin and A.Sangiovanni-Vincentelli, A Verication Strategy for Timing- Constrained Systems, Proc. 4th Workshop Computer-Aided Verication, Lecture Notes in Computer Science 663, Springer-Verlag,

More information

Linguistics and logic of common mathematical language I. Peter Koepke and Merlin Carl, Mathematical Institute Universität Bonn

Linguistics and logic of common mathematical language I. Peter Koepke and Merlin Carl, Mathematical Institute Universität Bonn The NAPROCHE Project Linguistics and logic of common mathematical language I Peter Koepke and Merlin Carl, Mathematical Institute Universität Bonn Mathematical texts are formulated in a semi-formal language,

More information

conflict structure bis hpb test pt causality

conflict structure bis hpb test pt causality Causal Testing Ursula Goltz and Heike Wehrheim Institut fur Informatik, University of Hildesheim Postfach 101363, D{31113 Hildesheim, Germany Fax: (+49)(05121)883-768 fgoltz,wehrheimg@informatik.uni-hildesheim.de

More information

Approximate Map Labeling. is in (n log n) Frank Wagner* B 93{18. December Abstract

Approximate Map Labeling. is in (n log n) Frank Wagner* B 93{18. December Abstract SERIE B INFORMATIK Approximate Map Labeling is in (n log n) Frank Wagner* B 93{18 December 1993 Abstract Given n real numbers, the -CLOSENESS problem consists in deciding whether any two of them are within

More information

On Controllability and Normality of Discrete Event. Dynamical Systems. Ratnesh Kumar Vijay Garg Steven I. Marcus

On Controllability and Normality of Discrete Event. Dynamical Systems. Ratnesh Kumar Vijay Garg Steven I. Marcus On Controllability and Normality of Discrete Event Dynamical Systems Ratnesh Kumar Vijay Garg Steven I. Marcus Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin,

More information

Linking Duration Calculus and TLA

Linking Duration Calculus and TLA Linking Duration Calculus and TLA Yifeng Chen and Zhiming Liu Department of Computer Science, University of Leicester, Leicester LE1 7RH, UK Email: {Y.Chen, Z.Liu}@mcs.le.ac.uk Abstract. Different temporal

More information

Using Continuous Real Functions to Model Timed Histories

Using Continuous Real Functions to Model Timed Histories Using Continuous Real Functions to Model Timed Histories Brendan Mahony Ian Hayes Department of Computer Science University of Queensland 4072 Australia July, 1991 Abstract Continuous real functions are

More information

Lecture Notes on Combinatory Modal Logic

Lecture Notes on Combinatory Modal Logic Lecture Notes on Combinatory Modal Logic 15-816: Modal Logic Frank Pfenning Lecture 9 February 16, 2010 1 Introduction The connection between proofs and program so far has been through a proof term assignment

More information

COMP3151/9151 Foundations of Concurrency Lecture 4

COMP3151/9151 Foundations of Concurrency Lecture 4 1 COMP3151/9151 Foundations of Concurrency Lecture 4 and Kai Engelhardt CSE, UNSW (and data61) Revision: 1.5 of Date: 2017/08/14 00:35:24 UTC (Credits: parts may be borrowed from M. Ben-Ari, G Andrews,

More information

P 1 P * 1 T P * 1 T 1 T * 1. s 1 P 1

P 1 P * 1 T P * 1 T 1 T * 1. s 1 P 1 ME 131B Fluid Mechanics Solutions to Week Three Problem Session: Isentropic Flow II (1/26/98) 1. From an energy view point, (a) a nozzle is a device that converts static enthalpy into kinetic energy. (b)

More information

Safety Verication for Automated Platoon. Maneuvers: A Case Study. Ekaterina Dolginova and Nancy Lynch. fkatya,

Safety Verication for Automated Platoon. Maneuvers: A Case Study. Ekaterina Dolginova and Nancy Lynch. fkatya, Safety Verication for Automated Platoon Maneuvers: A Case Study Ekaterina Dolginova and Nancy Lynch MIT Laboratory for Computer Science Cambridge, MA 02139, USA fkatya, lynchg@theory.lcs.mit.edu Abstract.

More information

P Finite Automata and Regular Languages over Countably Infinite Alphabets

P Finite Automata and Regular Languages over Countably Infinite Alphabets P Finite Automata and Regular Languages over Countably Infinite Alphabets Jürgen Dassow 1 and György Vaszil 2 1 Otto-von-Guericke-Universität Magdeburg Fakultät für Informatik PSF 4120, D-39016 Magdeburg,

More information

Fundamental Algorithms 11

Fundamental Algorithms 11 Technische Universität München WS 2013/14 Institut für Informatik Worksheet Scientific Computing in Computer Science 20.01.2014 Fundamental Algorithms 11 Exercise 1 Hypergraphs A hypergraph extends the

More information

The State Explosion Problem

The State Explosion Problem The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis

More information

Diagram-based Formalisms for the Verication of. Reactive Systems. Anca Browne, Luca de Alfaro, Zohar Manna, Henny B. Sipma and Tomas E.

Diagram-based Formalisms for the Verication of. Reactive Systems. Anca Browne, Luca de Alfaro, Zohar Manna, Henny B. Sipma and Tomas E. In CADE-1 Workshop on Visual Reasoning, New Brunswick, NJ, July 1996. Diagram-based Formalisms for the Verication of Reactive Systems Anca Browne, Luca de Alfaro, Zohar Manna, Henny B. Sipma and Tomas

More information

An Introduction to Hybrid Systems Modeling

An Introduction to Hybrid Systems Modeling CS620, IIT BOMBAY An Introduction to Hybrid Systems Modeling Ashutosh Trivedi Department of Computer Science and Engineering, IIT Bombay CS620: New Trends in IT: Modeling and Verification of Cyber-Physical

More information

Objects usually are charged up through the transfer of electrons from one object to the other.

Objects usually are charged up through the transfer of electrons from one object to the other. 1 Part 1: Electric Force Review of Vectors Review your vectors! You should know how to convert from polar form to component form and vice versa add and subtract vectors multiply vectors by scalars Find

More information

Descriptional Complexity of Formal Systems (Draft) Deadline for submissions: April 20, 2009 Final versions: June 18, 2009

Descriptional Complexity of Formal Systems (Draft) Deadline for submissions: April 20, 2009 Final versions: June 18, 2009 DCFS 2009 Descriptional Complexity of Formal Systems (Draft) Deadline for submissions: April 20, 2009 Final versions: June 18, 2009 On the Number of Membranes in Unary P Systems Rudolf Freund (A,B) Andreas

More information

A Type-Coercion Problem in Computer Algebra

A Type-Coercion Problem in Computer Algebra Lecture Notes in Computer Science 737, pages 188 194 A Type-Coercion Problem in Computer Algebra Andreas Weber Wilhelm-Schickard-Institut Universität Tübingen W-7400 Tübingen, Germany hweber@informatik.uni-tuebingen.dei

More information

for Propositional Temporal Logic with Since and Until Y. S. Ramakrishna, L. E. Moser, L. K. Dillon, P. M. Melliar-Smith, G. Kutty

for Propositional Temporal Logic with Since and Until Y. S. Ramakrishna, L. E. Moser, L. K. Dillon, P. M. Melliar-Smith, G. Kutty An Automata-Theoretic Decision Procedure for Propositional Temporal Logic with Since and Until Y. S. Ramakrishna, L. E. Moser, L. K. Dillon, P. M. Melliar-Smith, G. Kutty Department of Electrical and Computer

More information

Asynchronous cellular automata for pomsets. 2, place Jussieu. F Paris Cedex 05. Abstract

Asynchronous cellular automata for pomsets. 2, place Jussieu. F Paris Cedex 05. Abstract Asynchronous cellular automata for pomsets without auto-concurrency Manfred Droste Institut fur Algebra Technische Universitat Dresden D-01062 Dresden droste@math.tu-dresden.de Paul Gastin LITP, IBP Universite

More information

AP Physics Study Guide Chapter 17 Electric Potential and Energy Name. Circle the vector quantities below and underline the scalar quantities below

AP Physics Study Guide Chapter 17 Electric Potential and Energy Name. Circle the vector quantities below and underline the scalar quantities below AP Physics Study Guide Chapter 17 Electric Potential and Energy Name Circle the vector quantities below and underline the scalar quantities below electric potential electric field electric potential energy

More information

Modelling of Electrical Faults in Induction Machines Using Modelica R

Modelling of Electrical Faults in Induction Machines Using Modelica R SIMS 27 Modelling of Electrical Faults in Induction Machines Using Modelica R Dietmar Winkler Clemens Gühmann Technische Universität Berlin Department of Electronic Measurement and Diagnostic Technology

More information

3-3 Complex Numbers. Simplify. SOLUTION: 2. SOLUTION: 3. (4i)( 3i) SOLUTION: 4. SOLUTION: 5. SOLUTION: esolutions Manual - Powered by Cognero Page 1

3-3 Complex Numbers. Simplify. SOLUTION: 2. SOLUTION: 3. (4i)( 3i) SOLUTION: 4. SOLUTION: 5. SOLUTION: esolutions Manual - Powered by Cognero Page 1 1. Simplify. 2. 3. (4i)( 3i) 4. 5. esolutions Manual - Powered by Cognero Page 1 6. 7. Solve each equation. 8. Find the values of a and b that make each equation true. 9. 3a + (4b + 2)i = 9 6i Set the

More information

(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea

(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea Torsion of dierentials on toric varieties Klaus Altmann Institut fur reine Mathematik, Humboldt-Universitat zu Berlin Ziegelstr. 13a, D-10099 Berlin, Germany. E-mail: altmann@mathematik.hu-berlin.de Abstract

More information

October 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable

October 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable International Journal of Wavelets, Multiresolution and Information Processing c World Scientic Publishing Company Polynomial functions are renable Henning Thielemann Institut für Informatik Martin-Luther-Universität

More information

Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time Jean-Francois Raskin and Pierre-Yves Schobbens Computer

Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time Jean-Francois Raskin and Pierre-Yves Schobbens Computer Facultes Universitaires Notre-Dame de la Paix Namur, Belgium Institut d'informatique Rue Grandgagnage, 21 B-5000 Namur BELGIUM Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time Jean-Francois

More information

What happens to the value of the expression x + y every time we execute this loop? while x>0 do ( y := y+z ; x := x:= x z )

What happens to the value of the expression x + y every time we execute this loop? while x>0 do ( y := y+z ; x := x:= x z ) Starter Questions Feel free to discuss these with your neighbour: Consider two states s 1 and s 2 such that s 1, x := x + 1 s 2 If predicate P (x = y + 1) is true for s 2 then what does that tell us about

More information

In this lecture, we will consider how to analyse an electrical circuit by applying KVL and KCL. As a result, we can predict the voltages and currents

In this lecture, we will consider how to analyse an electrical circuit by applying KVL and KCL. As a result, we can predict the voltages and currents In this lecture, we will consider how to analyse an electrical circuit by applying KVL and KCL. As a result, we can predict the voltages and currents around an electrical circuit. This is a short lecture,

More information

A Fixed Point Representation of References

A Fixed Point Representation of References A Fixed Point Representation of References Susumu Yamasaki Department of Computer Science, Okayama University, Okayama, Japan yamasaki@momo.cs.okayama-u.ac.jp Abstract. This position paper is concerned

More information

Electronic Notes in Theoretical Computer Science 18 (1998) URL: 8 pages Towards characterizing bisim

Electronic Notes in Theoretical Computer Science 18 (1998) URL:   8 pages Towards characterizing bisim Electronic Notes in Theoretical Computer Science 18 (1998) URL: http://www.elsevier.nl/locate/entcs/volume18.html 8 pages Towards characterizing bisimilarity of value-passing processes with context-free

More information

Design of Distributed Systems Melinda Tóth, Zoltán Horváth

Design of Distributed Systems Melinda Tóth, Zoltán Horváth Design of Distributed Systems Melinda Tóth, Zoltán Horváth Design of Distributed Systems Melinda Tóth, Zoltán Horváth Publication date 2014 Copyright 2014 Melinda Tóth, Zoltán Horváth Supported by TÁMOP-412A/1-11/1-2011-0052

More information

The Rayleigh Pulse Forming Network

The Rayleigh Pulse Forming Network The Rayleigh Pulse Forming Network The ideal power supply for many high current applications is one which supplies a square voltage wave over a short, but predetermined, time. Since these applications

More information

Lecture PowerPoints. Chapter 18 Physics: Principles with Applications, 6 th edition Giancoli

Lecture PowerPoints. Chapter 18 Physics: Principles with Applications, 6 th edition Giancoli Lecture PowerPoints Chapter 18 Physics: Principles with Applications, 6 th edition Giancoli 2005 Pearson Prentice Hall This work is protected by United States copyright laws and is provided solely for

More information

This week. 3/23/2017 Physics 214 Summer

This week. 3/23/2017 Physics 214 Summer This week Electrical Circuits Series or parallel that s the question. Current, Power and Energy Why does my laptop battery die? Transmission of power to your home Why do we have big transmission towers?

More information

This week. 6/2/2015 Physics 214 Summer

This week. 6/2/2015 Physics 214 Summer This week Electrical Circuits Series or parallel that s the question. Current, Power and Energy Why does my laptop battery die? Transmission of power to your home Why do we have big transmission towers?

More information

Electric Power * OpenStax HS Physics. : By the end of this section, you will be able to:

Electric Power * OpenStax HS Physics. : By the end of this section, you will be able to: OpenStax-CNX module: m54446 1 Electric Power * OpenStax HS Physics This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 4.0 1 : By the end of this section,

More information

A Preference Semantics. for Ground Nonmonotonic Modal Logics. logics, a family of nonmonotonic modal logics obtained by means of a

A Preference Semantics. for Ground Nonmonotonic Modal Logics. logics, a family of nonmonotonic modal logics obtained by means of a A Preference Semantics for Ground Nonmonotonic Modal Logics Daniele Nardi and Riccardo Rosati Dipartimento di Informatica e Sistemistica, Universita di Roma \La Sapienza", Via Salaria 113, I-00198 Roma,

More information

Basic Electronics. Introductory Lecture Course for. Technology and Instrumentation in Particle Physics Chicago, Illinois June 9-14, 2011

Basic Electronics. Introductory Lecture Course for. Technology and Instrumentation in Particle Physics Chicago, Illinois June 9-14, 2011 Basic Electronics Introductory Lecture Course for Technology and Instrumentation in Particle Physics 2011 Chicago, Illinois June 9-14, 2011 Presented By Gary Drake Argonne National Laboratory drake@anl.gov

More information

PES 1120 Spring 2014, Spendier Lecture 35/Page 1

PES 1120 Spring 2014, Spendier Lecture 35/Page 1 PES 0 Spring 04, Spendier Lecture 35/Page Today: chapter 3 - LC circuits We have explored the basic physics of electric and magnetic fields and how energy can be stored in capacitors and inductors. We

More information

1) Two lightbulbs, one rated 30 W at 120 V and another rated 40 W at 120 V, are arranged in two different circuits.

1) Two lightbulbs, one rated 30 W at 120 V and another rated 40 W at 120 V, are arranged in two different circuits. 1) Two lightbulbs, one rated 30 W at 120 V and another rated 40 W at 120 V, are arranged in two different circuits. a. The two bulbs are first connected in parallel to a 120 V source. i. Determine the

More information

SPN 2003 Preliminary Version. Translating Hybrid Petri Nets into Hybrid. Automata 1. Dipartimento di Informatica. Universita di Torino

SPN 2003 Preliminary Version. Translating Hybrid Petri Nets into Hybrid. Automata 1. Dipartimento di Informatica. Universita di Torino SPN 2003 Preliminary Version Translating Hybrid Petri Nets into Hybrid Automata 1 Marco Gribaudo 2 and Andras Horvath 3 Dipartimento di Informatica Universita di Torino Corso Svizzera 185, 10149 Torino,

More information

Bounded Retransmission in Event-B CSP: a Case Study

Bounded Retransmission in Event-B CSP: a Case Study Available online at www.sciencedirect.com Electronic Notes in Theoretical Computer Science 280 (2011) 69 80 www.elsevier.com/locate/entcs Bounded Retransmission in Event-B CSP: a Case Study Steve Schneider

More information

What Good Are Digital Clocks? y. Abstract. Real-time systems operate in \real," continuous time

What Good Are Digital Clocks? y. Abstract. Real-time systems operate in \real, continuous time What Good Are Digital Clocks? y Thomas A. Henzinger z Zohar Manna x Amir Pnueli { Abstract. Real-time systems operate in \real," continuous time and state changes may occur at any real-numbered time point.

More information

Lecture 14 - P v.s. NP 1

Lecture 14 - P v.s. NP 1 CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 27, 2018 Lecture 14 - P v.s. NP 1 In this lecture we start Unit 3 on NP-hardness and approximation

More information

König s Lemma and Kleene Tree

König s Lemma and Kleene Tree König s Lemma and Kleene Tree Andrej Bauer May 3, 2006 Abstract I present a basic result about Cantor space in the context of computability theory: the computable Cantor space is computably non-compact.

More information

The Simplex Method: An Example

The Simplex Method: An Example The Simplex Method: An Example Our first step is to introduce one more new variable, which we denote by z. The variable z is define to be equal to 4x 1 +3x 2. Doing this will allow us to have a unified

More information

Lecture Outline Chapter 21. Physics, 4 th Edition James S. Walker. Copyright 2010 Pearson Education, Inc.

Lecture Outline Chapter 21. Physics, 4 th Edition James S. Walker. Copyright 2010 Pearson Education, Inc. Lecture Outline Chapter 21 Physics, 4 th Edition James S. Walker Chapter 21 Electric Current and Direct- Current Circuits Units of Chapter 21 Electric Current Resistance and Ohm s Law Energy and Power

More information

An Algorithmic Approach to the Specication and Verication of. Abstract

An Algorithmic Approach to the Specication and Verication of. Abstract Hybrid Automata: An Algorithmic Approach to the Specication and Verication of Hybrid Systems 1 Rajeev Alur 2 Costas Courcoubetis 3 Thomas A. Henzinger 4 Pei-Hsin Ho 3 Abstract We introduce the framework

More information

DC Circuits Analysis

DC Circuits Analysis Western Technical College 10660117 DC Circuits Analysis Course Outcome Summary Course Information Description Career Cluster Instructional Level Total Credits 2.00 Total Hours 54.00 This course provides

More information

Verication of the Alternating-Bit-Protocol using Automated Theorem Provers in ILF - a case study Thomas Baar y Institute of Mathematics Humboldt Unive

Verication of the Alternating-Bit-Protocol using Automated Theorem Provers in ILF - a case study Thomas Baar y Institute of Mathematics Humboldt Unive Verication of the Alternating-Bit-Protocol using Automated Theorem Provers in ILF - a case study Thomas Baar y Institute of Mathematics Humboldt University Germany Ingo Dahn z Institute of Mathematics

More information

control in out in out Figure 1. Binary switch: (a) opened or off; (b) closed or on.

control in out in out Figure 1. Binary switch: (a) opened or off; (b) closed or on. Chapter 2 Digital Circuits Page 1 of 18 2. Digital Circuits Our world is an analog world. Measurements that we make of the physical objects around us are never in discrete units but rather in a continuous

More information

UNIVERSITY OF TECHNOLOGY, JAMAICA Faculty of Engineering and Computing School of Engineering

UNIVERSITY OF TECHNOLOGY, JAMAICA Faculty of Engineering and Computing School of Engineering UNIVERSITY OF TECHNOLOGY, JAMAICA Faculty of Engineering and Computing School of Engineering SYLLABUS OUTLINE FACULTY: SCHOOL/DEPT: COURSE OF STUDY: Engineering and Computing Engineering Diploma in Electrical

More information

Physics Module Form 5 Chapter 2- Electricity GCKL 2011 CHARGE AND ELECTRIC CURRENT

Physics Module Form 5 Chapter 2- Electricity GCKL 2011 CHARGE AND ELECTRIC CURRENT 2.1 CHARGE AND ELECTRIC CURRENT Van de Graaf 1. What is a Van de Graaff generator? Fill in each of the boxes the name of the part shown. A device that produces and store electric charges at high voltage

More information

E246 Electronics & Instrumentation. Lecture 1: Introduction and Review of Basic Electronics

E246 Electronics & Instrumentation. Lecture 1: Introduction and Review of Basic Electronics E246 Electronics & Instrumentation Lecture 1: Introduction and Review of Basic Electronics Course Personnel Instructor: Yi Guo Office: Burchard 207 Office Hours: Tuesday & Thursday 2-3pm Ph: (201) 216-5658

More information

Lecture #3. Review: Power

Lecture #3. Review: Power Lecture #3 OUTLINE Power calculations Circuit elements Voltage and current sources Electrical resistance (Ohm s law) Kirchhoff s laws Reading Chapter 2 Lecture 3, Slide 1 Review: Power If an element is

More information

Control of Hybrid Petri Nets using Max-Plus Algebra

Control of Hybrid Petri Nets using Max-Plus Algebra Control of Hybrid Petri Nets using Max-Plus Algebra FABIO BALDUZZI*, ANGELA DI FEBBRARO*, ALESSANDRO GIUA, SIMONA SACONE^ *Dipartimento di Automatica e Informatica Politecnico di Torino Corso Duca degli

More information

Compositionality in SLD-derivations and their abstractions Marco Comini, Giorgio Levi and Maria Chiara Meo Dipartimento di Informatica, Universita di

Compositionality in SLD-derivations and their abstractions Marco Comini, Giorgio Levi and Maria Chiara Meo Dipartimento di Informatica, Universita di Compositionality in SLD-derivations and their abstractions Marco Comini Giorgio Levi and Maria Chiara Meo Dipartimento di Informatica Universita di Pisa Corso Italia 40 56125 Pisa Italy fcomini levi meog@di.unipi.it

More information

Version 001 CIRCUITS holland (1290) 1

Version 001 CIRCUITS holland (1290) 1 Version CIRCUITS holland (9) This print-out should have questions Multiple-choice questions may continue on the next column or page find all choices before answering AP M 99 MC points The power dissipated

More information

Equivalence for the G 3-stable models semantics

Equivalence for the G 3-stable models semantics Equivalence for the G -stable models semantics José Luis Carballido 1, Mauricio Osorio 2, and José Ramón Arrazola 1 1 Benemérita Universidad Autóma de Puebla, Mathematics Department, Puebla, México carballido,

More information

Towards Co-Engineering Communicating Autonomous Cyber-physical Systems. Bujorianu, M.C. and Bujorianu, M.L. MIMS EPrint:

Towards Co-Engineering Communicating Autonomous Cyber-physical Systems. Bujorianu, M.C. and Bujorianu, M.L. MIMS EPrint: Towards Co-Engineering Communicating Autonomous Cyber-physical Systems Bujorianu M.C. and Bujorianu M.L. 009 MIMS EPrint: 00.53 Manchester Institute for Mathematical Sciences School of Mathematics The

More information

ELEC 250: LINEAR CIRCUITS I COURSE OVERHEADS. These overheads are adapted from the Elec 250 Course Pack developed by Dr. Fayez Guibaly.

ELEC 250: LINEAR CIRCUITS I COURSE OVERHEADS. These overheads are adapted from the Elec 250 Course Pack developed by Dr. Fayez Guibaly. Elec 250: Linear Circuits I 5/4/08 ELEC 250: LINEAR CIRCUITS I COURSE OVERHEADS These overheads are adapted from the Elec 250 Course Pack developed by Dr. Fayez Guibaly. S.W. Neville Elec 250: Linear Circuits

More information

Lecture 2: Axiomatic semantics

Lecture 2: Axiomatic semantics Chair of Software Engineering Trusted Components Prof. Dr. Bertrand Meyer Lecture 2: Axiomatic semantics Reading assignment for next week Ariane paper and response (see course page) Axiomatic semantics

More information

Hybrid Transition Modes in (Tissue) P Systems

Hybrid Transition Modes in (Tissue) P Systems Hybrid Transition Modes in (Tissue) P Systems Rudolf Freund and Marian Kogler Faculty of Informatics, Vienna University of Technology Favoritenstr. 9, 1040 Vienna, Austria {rudi,marian}@emcc.at Summary.

More information

1. Introduction Bottom-Up-Heapsort is a variant of the classical Heapsort algorithm due to Williams ([Wi64]) and Floyd ([F64]) and was rst presented i

1. Introduction Bottom-Up-Heapsort is a variant of the classical Heapsort algorithm due to Williams ([Wi64]) and Floyd ([F64]) and was rst presented i A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort 1 by Rudolf Fleischer 2 Keywords : heapsort, bottom-up-heapsort, tight lower bound ABSTRACT Bottom-Up-Heapsort is a variant of Heapsort. Its

More information

Goal specification using temporal logic in presence of non-deterministic actions

Goal specification using temporal logic in presence of non-deterministic actions Goal specification using temporal logic in presence of non-deterministic actions Chitta Baral Matt Barry Department of Computer Sc. and Engg. Advance Tech Development Lab Arizona State University United

More information

ENGG 225. David Ng. Winter January 9, Circuits, Currents, and Voltages... 5

ENGG 225. David Ng. Winter January 9, Circuits, Currents, and Voltages... 5 ENGG 225 David Ng Winter 2017 Contents 1 January 9, 2017 5 1.1 Circuits, Currents, and Voltages.................... 5 2 January 11, 2017 6 2.1 Ideal Basic Circuit Elements....................... 6 3 January

More information

A Duration Calculus Semantics. for. Real-Time Reactive Systems. Michael R. Hansen. Ernst-Rudiger Olderog. Michael Schenke.

A Duration Calculus Semantics. for. Real-Time Reactive Systems. Michael R. Hansen. Ernst-Rudiger Olderog. Michael Schenke. A Duration Calculus Semantics for Real-Time Reactive Systems Michael R. Hansen Ernst-Rudiger Olderog Michael Schenke Martin Franzle Markus Muller-Olm Burghard von Karger Hans Rischel Date: 17 August 1993

More information

hapter 8 Simulation/Realization 8 Introduction Given an nth-order state-space description of the form x_ (t) = f (x(t) u(t) t) (state evolution equati

hapter 8 Simulation/Realization 8 Introduction Given an nth-order state-space description of the form x_ (t) = f (x(t) u(t) t) (state evolution equati Lectures on Dynamic Systems and ontrol Mohammed Dahleh Munther Dahleh George Verghese Department of Electrical Engineering and omputer Science Massachuasetts Institute of Technology c hapter 8 Simulation/Realization

More information

Methods for the specification and verification of business processes MPB (6 cfu, 295AA)

Methods for the specification and verification of business processes MPB (6 cfu, 295AA) Methods for the specification and verification of business processes MPB (6 cfu, 295AA) Roberto Bruni http://www.di.unipi.it/~bruni 20 - Workflow modules 1 Object We study Workflow modules to model interaction

More information

ConcepTest PowerPoints

ConcepTest PowerPoints ConcepTest PowerPoints Chapter 19 Physics: Principles with Applications, 6 th edition Giancoli 2005 Pearson Prentice Hall This work is protected by United States copyright laws and is provided solely for

More information

7 RC Simulates RA. Lemma: For every RA expression E(A 1... A k ) there exists a DRC formula F with F V (F ) = {A 1,..., A k } and

7 RC Simulates RA. Lemma: For every RA expression E(A 1... A k ) there exists a DRC formula F with F V (F ) = {A 1,..., A k } and 7 RC Simulates RA. We now show that DRC (and hence TRC) is at least as expressive as RA. That is, given an RA expression E that mentions at most C, there is an equivalent DRC expression E that mentions

More information

COP4020 Programming Languages. Introduction to Axiomatic Semantics Prof. Robert van Engelen

COP4020 Programming Languages. Introduction to Axiomatic Semantics Prof. Robert van Engelen COP4020 Programming Languages Introduction to Axiomatic Semantics Prof. Robert van Engelen Assertions and Preconditions Assertions are used by programmers to verify run-time execution An assertion is a

More information

Abstract. the aid of a computer. The smallest parameter set found is 7-(24; 8; 4): for determining the isomorphism types. Further designs are derived

Abstract. the aid of a computer. The smallest parameter set found is 7-(24; 8; 4): for determining the isomorphism types. Further designs are derived Some simple 7-designs A. Betten R. Laue A. Wassermann Abstract Some simple 7-designs with small parameters are constructed with the aid of a computer. The smallest parameter set found is 7-(24; 8; 4):

More information

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition) Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational

More information

General Physics (PHY 2140)

General Physics (PHY 2140) General Physics (PHY 2140) Lecture 7 Electrostatics and electrodynamics Capacitance and capacitors capacitors with dielectrics Electric current current and drift speed resistance and Ohm s law http://www.physics.wayne.edu/~apetrov/phy2140/

More information

Electrical Machines-I Prof. D. Kastha Department of Electrical Engineering Indian Institute of Technology, Kharagpur

Electrical Machines-I Prof. D. Kastha Department of Electrical Engineering Indian Institute of Technology, Kharagpur Electrical Machines-I Prof. D. Kastha Department of Electrical Engineering Indian Institute of Technology, Kharagpur Lecture - 20 Potential and Current Transformers (Refer Slide Time: 00:37) So far we

More information

MICROWAVE EFFECTS ON CFRP PROCESSING SUMMARY 1. MICROWAVE BACKGROUND

MICROWAVE EFFECTS ON CFRP PROCESSING SUMMARY 1. MICROWAVE BACKGROUND MICROWAVE EFFECTS ON CFRP PROCESSING MATTHIAS MEYER AND DR.-ING. LARS HERBECK German Aerospace Center Institute of Composite Structures and Adaptive Systems SUMMARY Microwave heating of CFRP is a new method

More information

Physics Module Form 5 Chapter 2- Electricity GCKL 2011 CHARGE AND ELECTRIC CURRENT

Physics Module Form 5 Chapter 2- Electricity GCKL 2011 CHARGE AND ELECTRIC CURRENT 2.1 CHARGE AND ELECTRIC CURRENT Van de Graaf 1. What is a Van de Graaff generator? Fill in each of the boxes the name of the part shown. A device that... and... at high voltage on its dome. dome 2. You

More information

To do something else

To do something else To do something else Ju Fengkui School of Philosophy, Beijing Normal University May 21, 2016 Joint work with Jan van Eijck from Centrum Wiskunde & Informatica Outline 1 Background 2 Our ideas 3 A deontic

More information

Intermediate Algebra Section 9.1 Composite Functions and Inverse Functions

Intermediate Algebra Section 9.1 Composite Functions and Inverse Functions Intermediate Algebra Section 9. Composite Functions and Inverse Functions We have added, subtracted, multiplied, and divided functions in previous chapters. Another way to combine functions is called composite

More information

a + b Time Domain i(τ)dτ.

a + b Time Domain i(τ)dτ. R, C, and L Elements and their v and i relationships We deal with three essential elements in circuit analysis: Resistance R Capacitance C Inductance L Their v and i relationships are summarized below.

More information

Coulomb s constant k = 9x10 9 N m 2 /C 2

Coulomb s constant k = 9x10 9 N m 2 /C 2 1 Part 2: Electric Potential 2.1: Potential (Voltage) & Potential Energy q 2 Potential Energy of Point Charges Symbol U mks units [Joules = J] q 1 r Two point charges share an electric potential energy

More information

The Decent Philosophers: An exercise in concurrent behaviour

The Decent Philosophers: An exercise in concurrent behaviour Fundamenta Informaticae 80 (2007) 1 9 1 IOS Press The Decent Philosophers: An exercise in concurrent behaviour Wolfgang Reisig Humboldt-Universität zu Berlin Institute of Informatics Unter den Linden 6,

More information

in series Devices connected in series will have the same amount of charge deposited on each capacitor. But different potential difference. That means

in series Devices connected in series will have the same amount of charge deposited on each capacitor. But different potential difference. That means Electric Field Electricity Lecture Series Electric Field: Field an area where any charged object will experience an electric force Kirchoff s Laws The electric field lines around a pair of point charges

More information

HW1 Solutions. October 5, (20 pts.) Random variables, sample space and events Consider the random experiment of ipping a coin 4 times.

HW1 Solutions. October 5, (20 pts.) Random variables, sample space and events Consider the random experiment of ipping a coin 4 times. HW1 Solutions October 5, 2016 1. (20 pts.) Random variables, sample space and events Consider the random experiment of ipping a coin 4 times. 1. (2 pts.) Dene the appropriate random variables. Answer:

More information

Lab #6 Ohm s Law. Please type your lab report for Lab #6 and subsequent labs.

Lab #6 Ohm s Law. Please type your lab report for Lab #6 and subsequent labs. Dr. Day, Fall 2004, Rev. 06/22/10 HEFW PH 262 Page 1 of 4 Lab #6 Ohm s Law Please type your lab report for Lab #6 and subsequent labs. Objectives: When you have completed this lab exercise you should be

More information

Simulation of Spiking Neural P Systems using Pnet Lab

Simulation of Spiking Neural P Systems using Pnet Lab Simulation of Spiking Neural P Systems using Pnet Lab Venkata Padmavati Metta Bhilai Institute of Technology, Durg vmetta@gmail.com Kamala Krithivasan Indian Institute of Technology, Madras kamala@iitm.ac.in

More information

Pitfalls in public key cryptosystems based on free partially commutative monoids and groups

Pitfalls in public key cryptosystems based on free partially commutative monoids and groups Pitfalls in public key cryptosystems based on free partially commutative monoids and groups María Isabel González Vasco 1 and Rainer Steinwandt 2 1 Área de Matemática Aplicada, Universidad Rey Juan Carlos

More information

Computability and Complexity

Computability and Complexity Computability and Complexity Sequences and Automata CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard Janicki Computability

More information

OAKTON COMMUNITY COLLEGE COURSE SYLLABUS. I. Course Course Course Prefix Number Name Credit: Lecture Lab. PHY 132 College Physics II 4 3 2

OAKTON COMMUNITY COLLEGE COURSE SYLLABUS. I. Course Course Course Prefix Number Name Credit: Lecture Lab. PHY 132 College Physics II 4 3 2 OAKTON COMMUNITY COLLEGE COURSE SYLLABUS I. Course Course Course Prefix Number Name Credit: Lecture Lab PHY 132 College Physics II 4 3 2 II. Prerequisites: PHY 131 III. Course (catalog) Description: Course

More information

An Introduction to Hybrid Systems Modeling

An Introduction to Hybrid Systems Modeling CS620, IIT BOMBAY An Introduction to Hybrid Systems Modeling Ashutosh Trivedi Department of Computer Science and Engineering, IIT Bombay CS620: New Trends in IT: Modeling and Verification of Cyber-Physical

More information

Introduction to the Simplex Algorithm Active Learning Module 3

Introduction to the Simplex Algorithm Active Learning Module 3 Introduction to the Simplex Algorithm Active Learning Module 3 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology Background Material Almost any

More information

Mixing Problems. Solution of concentration c 1 grams/liter flows in at a rate of r 1 liters/minute. Figure 1.7.1: A mixing problem.

Mixing Problems. Solution of concentration c 1 grams/liter flows in at a rate of r 1 liters/minute. Figure 1.7.1: A mixing problem. page 57 1.7 Modeling Problems Using First-Order Linear Differential Equations 57 For Problems 33 38, use a differential equation solver to determine the solution to each of the initial-value problems and

More information

Control of Industrial Systems to Avoid Failures: Application to Electrical System

Control of Industrial Systems to Avoid Failures: Application to Electrical System Control of Industrial Systems to Avoid Failures: Application to Electrical System Yamen EL TOUATI Department of Computer Science Faculty of Computing and Information Technology Northern Border University

More information