The TASM Language Reference Manual Version 1.1 - Synrc

More documents

Recommendations

Info

• t < 1: (((memory, 400), (processor, 60)), ∅) • t = 1: (((memory, 400), (processor, 60)), ((fan, ON))) • 1 < t < 4: (((memory, 300), (processor, 25)), ∅) • t = 4: (((memory, 300), (processor, 25)), ((light, ON))) • t > 4: (((memory, 0), (processor, 0)), ∅) Formally, the state evolution can be tracked through the following stages: • T RS 0 = (1, ((memory, 0), (processor, 0)), ((light, OF F ), (fan, OF F ))) • T RU F AN CONT ROL,1 = (1, ((memory, 100), (processor, 35)), ((fan, ON))) • T RU LIGHT CONT ROL,1 = (4, ((memory, 300), (processor, 25)), ((light, ON))) • T RU 1 = T RU F AN CONT ROL,1 ⊙ T RU LIGHT CONT ROL,1 = (1, ((memory, 400), (processor, 60)), ((fan, ON))) • T RU 2 = T RU F AN CONT ROL,1 ⊙ T RU LIGHT CONT ROL,1 = (3, ((memory, 300), (processor, 25)), ((light, ON))) • T RS 1 = T RS 0 ◦ T RU 1 = (1, ((memory, 400), (processor, 60)), ((light, OF F ), (fan, ON))) • T RS 2 = T RS 1 ◦ T RU 2 = (4, ((memory, 300), (processor, 25)), ((light, ON), (fan, ON))) The time history of variable values and resource consumption for the run is also shown in Figure 2.2. ON light status ON fan status OFF 60 25 0 OFF 4 t 1 memory usage processor usage 400 300 0 1 4 t 1 4 t t Figure 2.2: Time history of variable values and resource consumption 30
Table 2.1: Special Operators Operator Signature Meaning ◦ State × Update Set → State Used to apply an update set to the state ⊗ Update Set × Update Set → Update Set Used to combine two update sets generated through hierarchical composition, for update sets from different effect expressions ⊕ Update Set × Update Set → Update Set Used to combine two update sets generated through hierarchical composition, for update sets between a parent machine and a child machine ⊙ Update Set × Update Set → Update Set Used to combine two update sets generated through parallel composition 2.6.1 Thoughts about composition From the point of view of the effects on the environment, there is no difference whether or not an update set is generated from a single main ASM or through multiple parallel main ASMs. The composition of main machines and the use of sub and function machines is not indistinguishable to the environment. The environment only sees a single update set, that is produced at each ”step” of the system. Once the composition has been achieved, the composed system behaves as a single main ASM with no composition. The difference occurs in the internal merging of update sets. In the case of hierarchical composition, that is, update sets produced by sub ASMs and function ASMs, the ⊗ and ⊕ operators are used to obtain the resulting update set from the use of auxiliary ASMs. For parallel composition, that is, multiple update sets produced by main ASMs, the ⊙ operator is used to obtain the resulting update set that is to be applied to the environment. The special operators are listed in table 2.1. 2.6.2 Communication Between Different Machines To enable communication between different machines, the TASM language provides communication channels, in the style of the Calculus of Communication Systems (CCS) [15]. A communication channel is defined as a global object, uniquely identified by its name, that is used by two machines to synchronize. When using a communication channel, one machine plays the role of sender and the other machine plays the role of receiver. The syntax for using a communication channel is based on CCS. For an example communication channel named x, a sender would use x! to send a notification and a receiver would use x to receive a notification. Communication channels carry no data and are used solely for synchronization. Communications are assumed to be instantaneous when both parties are available. When a sender sends a notification and a receiver is not waiting for it, the sender is blocked indefinitely. Time elapses in the sender until the receiver becomes available. Once the communication is received, the sender resumes executing steps. The same 31
Page 1 and 2: The TASM Language Reference Manual
Page 3 and 4: Contents 1 Introduction 5 2 The Lan
Page 5 and 6: List of Figures 2.1 Hierarchical co
Page 7 and 8: Chapter 1 Introduction This documen
Page 9 and 10: Chapter 2 The Language The Timed Ab
Page 11 and 12: 2.2 Basic Definitions The term spec
Page 13 and 14: TASM Example 1 Light Switch Version
Page 15 and 16: The keyword next, used with time sp
Page 17 and 18: of resource usage for the step. If
Page 19 and 20: • T RU 1 = (5, ((memory, 200), (p
Page 21 and 22: The composition of resources also f
Page 23 and 24: T RU ret = T RU 1 ⊕ ( (T RU 2 ⊕
Page 25 and 26: • T RS 0 = (0, ((memory, 0)), ((l
Page 27 and 28: RC 1 ⊙ RC 2 = (rc 11 , . . . , rc
Page 29 and 30: The example is further extended to
Page 31: TASM Example 8 Fan Main Machine Def
Page 35 and 36: main machine templates. The concept
Page 37 and 38: Chapter 3 Syntax This chapter descr
Page 39 and 40: Table 3.1: Reserved Keywords Keywor
Page 41 and 42: Table 3.2: Operators Operator Signa
Page 43 and 44: TASMUCaseLetter > ::= ′ A ′ |
Page 45 and 46: 3.2.2 Project < TASMProjectDef > ::
Page 47 and 48: 3.2.5 Syntax Common to all Machine
Page 49 and 50: 3.2.8 Function Machine < TASMFTempl
Page 51 and 52: Table 3.3: XML Tags for Top Level S
Page 53 and 54: env types rsrcs vars vname tname *
Page 55 and 56: sys confs * conf name desc viname v
Page 57 and 58: XML Example 4 XML for a list of tem
Page 59 and 60: cons cbody cparams body * cparam cp
Page 61 and 62: XML Example 5 XML for main ASM temp
Page 63 and 64: Table 3.11: XML Syntax Tree for Fun
Page 65 and 66: 3.4.2 Typing All variables are stat
Page 67 and 68: Table 4.1: Operator Precedence Oper
Page 69 and 70: 4.2.5 Rules The desugaring of the r
Page 71 and 72: is used to sum up all of the resour
Page 73: [10] Y. Gurevich. Evolving Algebras

The TASM Language Reference Manual Version 1.1 - Synrc

Create successful ePaper yourself

Delete template?

Save as template?