Schneider Electric PL7 Micro/Junior/Pro User Guide

Below you will find brief information for PL7 Micro, PL7 Junior, PL7 Pro. This manual details programming languages (ladder, instruction list, structured text, Grafcet) for Micro and Premium PL7 programmable logic controllers (PLCs). It covers object addressing, memory structures, operating modes, and multitasking features. Learn how to develop applications using various programming styles and manage PLC resources effectively.

PDF

Document

Reference manual

PL7 Micro/Junior/Pro

Description of the PL7 software

07/2008 eng www.schneider-electric.com

Document Set

Presentation This manual is in two volumes: z z z

Volume 1: Description of the PL7 software z z

General points

Ladder language z z z

Instruction list language

Structured text language

Grafcet language

DFB function blocks z z Function modules

Volume 2: Detailed description of instructions and Functions z z

Basic instructions

Advanced instructions z Bit objects and system words

Volume 3: Appendices z z z z z z

Differences between PL7-2/3 and PL7-Micro/Junior

Memory aids

Reserved words

Compliance with IEC standard 1131-3

OLE Automation Server

Performances

Document Set

35015365.01 07/2008

Document Set

35015365.01 07/2008

About the Book . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

Part I

Description of PL7 software . . . . . . . . . . . . . . . . . . . . . . 13

Presentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13

Chapter 1 Introducing PL7 software. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15

Presentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15

Presentation of PL7 Software . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16

Presenting PL7 languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17

PL7 software structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21

Function modules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23

Chapter 2 Description of PL7 object language . . . . . . . . . . . . . . . . . . . . . 25

Presentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25

Definition of the Main Boolean Objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26

Definition of Main Word Objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27

Addressing bit objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29

Addresing input/output module objects for the TSX 37 . . . . . . . . . . . . . . . . . . . . 31

Addressing input/output module objects in rack . . . . . . . . . . . . . . . . . . . . . . . . . 34

Addressing of Remote Module Language Objects on a FIPIO Bus . . . . . . . . . . 36

Addressing of language objects associated with AS-i bus . . . . . . . . . . . . . . . . . 38

Addressing word objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40

Overlay rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43

Function block objects. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44

Table type PL7 objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47

Indexed objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50

Grafcet objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53

Symbolizing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54

Presymbolized objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56

Chapter 3 User memory. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57

Presentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57

Memory structure of Micro PLCs. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58

Memory structure for Premium PL7s. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60

Description of bits memory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62

Word memory outline. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64

Characteristics of TSX 37 PL7 memory. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65

Memory characteristics of TSX/PCX 57 10/15/20/25/26/28 PLCs. . . . . . . . . . . . 67

Characteristics of TSX/PCX 57 30/35/36 PL7 memories . . . . . . . . . . . . . . . . . . 70

Characteristics of TSX 57 453/4823 PL7 memory. . . . . . . . . . . . . . . . . . . . . . . . 72

Chapter 4 Operating modes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75

Presentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75

Dealing with power cuts and power restoration . . . . . . . . . . . . . . . . . . . . . . . . . . 76

Dealing with a warm restart . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78

Dealing with a cold start. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80

Chapter 5 Software structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85

Presentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85

5.1

Description of tasks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86

Presentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86

Presenting the master task . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87

Description of sections and subroutines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88

Presenting the fast task . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92

Presenting event processing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93

5.2

Mono task structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95

Presentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95

Mono task software structure. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96

Cyclic run . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97

Periodic run . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99

Checking cycle time . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102

5.3

Multi task structure. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103

Presentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103

Multitask software structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104

Sequencing tasks in a multitask structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106

Assigning input/output channels to master and fast tasks . . . . . . . . . . . . . . . . . 107

Exchanging inputs/outputs in event processes . . . . . . . . . . . . . . . . . . . . . . . . . 108

5.4

Function modules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110

Structuring in Function Modules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110

Part II

Description of PL7 languages . . . . . . . . . . . . . . . . . . . . 113

Presentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113

Chapter 6 Contact language . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115

Presentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115

General presentation of contact language . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116

Structure of a contact network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117

Contact network label . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118

Contact network comments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119

Contact language graphic elements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120

Rules for programming a contact network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123

35015365.01 07/2008

Rules for programming function blocks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 124

Rules for programming operation blocks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125

Running a contact network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126

Chapter 7 Instruction list language . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129

Presentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129

General presentation of instruction list language . . . . . . . . . . . . . . . . . . . . . . . 130

Structure for an instruction list program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131

Label for a sequence in instruction list language . . . . . . . . . . . . . . . . . . . . . . . 132

Comments on a sequence in instruction list language . . . . . . . . . . . . . . . . . . . 133

Presenting instructions in instruction list language . . . . . . . . . . . . . . . . . . . . . . 134

Rule for using parentheses in instruction list language . . . . . . . . . . . . . . . . . . . 138

Description of the MPS, MRD and MPP instructions . . . . . . . . . . . . . . . . . . . . 140

Principles of programming pre-defined function blocks. . . . . . . . . . . . . . . . . . . 142

Rules for running an instruction list program. . . . . . . . . . . . . . . . . . . . . . . . . . . 144

Chapter 8 Structured text language . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145

Presentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145

Presentation of structured text language. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146

Structuring a program in structured text language . . . . . . . . . . . . . . . . . . . . . . 147

Label for a sequence in structured text language . . . . . . . . . . . . . . . . . . . . . . . 148

Comments on a sequence in structured text language . . . . . . . . . . . . . . . . . . . 149

Bit object instructions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 150

Arithmetic and logic instructions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151

Instructions for tables and character strings . . . . . . . . . . . . . . . . . . . . . . . . . . . 153

Instructions for numerical conversions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 156

Instructions for Programs and Specific Instructions . . . . . . . . . . . . . . . . . . . . . 157

Conditional check structure IF...THEN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159

Conditional check structure WHILE...END_WHILE. . . . . . . . . . . . . . . . . . . . . . 161

Conditional check structure REPEAT...END_REPEAT. . . . . . . . . . . . . . . . . . . 162

Conditional check structure FOR...END_FOR . . . . . . . . . . . . . . . . . . . . . . . . . 163

Output Instruction for the EXIT Loop. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 164

Rules for running a structured text program . . . . . . . . . . . . . . . . . . . . . . . . . . . 165

Chapter 9 Grafcet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 169

Presentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 169

9.1

General presentation of Grafcet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 170

Presentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 170

Presenting Grafcet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171

Description of Grafcet Graphic Symbols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172

Description of specific Grafcet objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 174

Grafcet possibilities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 176

9.2

Rules for constructing Grafcet. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 178

Presentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 178

Ilustration of Grafcet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179

Using OR divergences and convergences . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180

35015365.01 07/2008

Using AND divergences and convergences . . . . . . . . . . . . . . . . . . . . . . . . . . . 181

Using connectors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 182

Using directed links . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 185

Grafcet comments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 186

9.3

Programming actions and conditions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187

Presentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187

Programming actions associated with steps . . . . . . . . . . . . . . . . . . . . . . . . . . . 188

Programming actions for activating or deactivating . . . . . . . . . . . . . . . . . . . . . . 190

Programming continuous actions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191

Programming transition conditions associated with transitions . . . . . . . . . . . . . 193

Programming transition conditions in ladder . . . . . . . . . . . . . . . . . . . . . . . . . . . 195

Programming transition conditions in instruction list language . . . . . . . . . . . . . 196

Programming transition conditions in structured text language . . . . . . . . . . . . . 197

9.4

Macro steps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 198

Presentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 198

Presentation of Macro Steps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199

Structure of a Macro Step . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200

Characteristics of macro steps. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201

9.5

Grafcet section. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 203

Presentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 203

Structure of a Grafcet section . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204

Description of preliminary processing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 206

Pre-setting the Grafcet. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 207

Initializing the Grafcet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 208

Resetting the Grafcet to Zero. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209

Freezing Grafcet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 210

Resetting the Macro-Steps to Zero . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211

Running sequential processing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 213

Description of subsequent processing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215

35015365.01 07/2008

Chapter 10 DFB function blocks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217

Presentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217

Presenting DFB function blocks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 218

How to set up a DFB function block . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 219

Defining DFB type function block objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221

Definition of DFB parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 224

Definition of DFB Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225

Coding rules for DFB types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 227

Creating DFB Instances . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 229

Rules for using DFBs in a program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 230

Using a DFB in a ladder language program . . . . . . . . . . . . . . . . . . . . . . . . . . . 232

Using a DFB in a program in instruction list or text language . . . . . . . . . . . . . . 234

Running a DFB instance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 235

Example of how to program DFB function blocks . . . . . . . . . . . . . . . . . . . . . . . 236

Index

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 239

35015365.01 07/2008

About the Book

At a Glance

Document Scope This manual describes the instructions and objects that can be addressed in programmable Micro, Premium and Atrium PL7 programming languages.

Validity Note The updating of this publication takes into account the functions of PL7V4.5.

Nevertheless it can be used to set up earlier PL7 versions.

User Comments We welcome your comments about this document. You can reach us by e-mail at [email protected]

35015365.01 07/2008

About the Book

35015365.01 07/2008

Description of PL7 software

Presentation

Aim of this part

What's in this

Part?

This part introduces the PL7 software. It describes the basic elementary ideas for programming Micro and Premium PL7s.

This part contains the following chapters:

Chapter

Chapter Name

Introducing PL7 software

Description of PL7 object language

User memory

Operating modes

Software structure

Page

35015365.01 07/2008

Description of PL7 software

35015365.01 07/2008

Introducing PL7 software

Presentation

Subject of this chapter

What's in this

Chapter?

This chapter introduces the main characteristics of PL7 software.

This chapter contains the following topics:

Topic

Presentation of PL7 Software

Presenting PL7 languages

PL7 software structure

Function modules

Page

35015365.01 07/2008

Introducing PL7 software

Presentation of PL7 Software

General Points

PL7 Software

Writing

Conventions

Designing and setting up applications for Micro and Premium PLCs is done using

PL7 software.

3 types of PL7 software are available: z z z

PL7 Micro

PL7 Junior

PL7 Pro

The following table shows the differences between the 3 types of software.

Services

Programming/Debugging/Use

User function blocks Creation

Use

Operating screens Creation

Use

Function modules

Diagnostic DFB function block

PL7 Micro

PL7 Junior

M/P/A

P/A

M/P/A

PL7 Pro

M/P/A

P/A

M/P/A

P/A

Key:

A = Atrium PLCs

M = Micro PL7s

P = Premium PL7s

- = not available

In the continuation of the document: z z the notation PL7 or PL7 software is used to refer to any of the 3 types of PL7 software, Micro, Junior and Pro.

the Premium notation is used to refer to any of the processors TSX 57, PMX 57 and PCX 57.

35015365.01 07/2008

Introducing PL7 software

Presenting PL7 languages

General points The PL7 software has 4 programming languages: z z z z ladder instruction list structured text

Grafcet

The following table gives the possible uses of the languages according to the type of PL7.

Language

Ladder

Instruction list

Structured text

Grafcet

Micro PL7

X (except for macro steps)

Premium PL7

Key:

X = available

- = not available

These languages can be mixed within the same application. One section of program can be written in ladder, another in text…

These languages set up: z z z pre-defined function blocks (Timing, counters,….), application specific functions (analogue, communication, counting…), specific functions (time management, character strings…),

Language objects can be symbolized using the variables editor or on-line in the program editors.

The PL7 software complies with the IEC 1131-3 standard (See Reference Manual,

Volumes 2 and 3).

35015365.01 07/2008

Introducing PL7 software

Ladder Ladder (LD) is a graphic language. It is used to transcribe diagrams to relays. It is adapted in the combination process.

It offers basic graphic symbols: contacts, coils, blocks.

Writing numerical calculations is possible within the operation blocks.

Example of a contact network

LD : MAST - CHART

%L100

(*Awaiting drying*)

%I1.0

%M12 %I1.7

%MT4.Q %M17

%I1.10

%Q2.3

%M27 %MT0

IN MT Q

SOUND MODE

TB: 1 mn

TMP: 9999

MODIF: Y

%M25 %MW0.X

OPERATE

%MW15:=%MW18+500

%M2 %I1.4

%Q2.5

SR2

F2 F3

F5 F6 F7

F8 F9 F10 F11

F12

S.F1

S.F2

OPER

S.F3

COHP

S.F4

COHP

S.F5

S.F6

S.F7

F (...)

S.F8

35015365.01 07/2008

Instruction list language

Introducing PL7 software

Instruction list language (IL) is a Boolean "machine" language used to write logic and numeric processes.

Example of how to program in instruction list language

IL : MAST - SR1

! %L0:

! %L5:

! %L10:

ANDN

OR (

AND

)

AND

ANDN

AND

[ %MW15 :=

AND

SR2

%I1.0

%M12

%MT4.Q

%M17

%I1.7

%Q2.5

%I1.10

%Q2.3

%M27

%MT0

%MT0.Q

%M25

%MW0:X5

%MW18+500]

%I1.2

%I1.4

Structured text language

Structured text language (ST) is an "IT" type language used to write structured logic and numeric processes.

Example of how to program in structured text language

ST : MAST - SR10

( * Searching for the first element which is not zero in a table of 32 words

Determining its value (%MW10 ) , its rank (%MW11)

This search is done if %M0 is set to 1

%M1 is set to 1 if an element without a nought exists, unless it is set to 0 *)

IF %M0 THEN

FOR %MW 99 := 0 TO 31 DO

IF %MW100 [%MW99]< > 0 THEN

%MW 10 : =%MW100 [%MW99];

%MW 11 : =%MW 99;

%M1 : = TRUE;

EXIT; (*Exiting the loop FOR*)

ELSE

%M1 : = FALSE;

END_IF;

END_FOR;

ELSE

%M1 : = FALSE;

END_ IF;

35015365.01 07/2008

Introducing PL7 software

Grafcet language Grafcet language is used to represent the operation of a sequential automatic system in a structured and graphic form.

Example of how to program in Grafcet language.

GRAFCET : MAST - CHART

1 3

F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 F12

35015365.01 07/2008

Introducing PL7 software

PL7 software structure

General points

Principle

PL7 software has two types of structure: z z

Mono task this is the simplified default structure, where a single master task made up of a program of several sections and sub-programs is carried out.

Multi-task: this structure, which is better suited for applications running in real time, is made up of a master task, a fast task and priority event processes.

PL7 master and fast program tasks are made up of several parts called sections and subroutines.

Each of these sections can be programmed in a language appropriate to the process to be performed.

The following illustration shows an example of dividing a PL7 program.

MAST master task FAST fast task event processes

Sas (LD)

Oven_1

Section in ladder language

Alarm_sas (ST)

Monitor_drying

(LD)

Section in text language

Section in ladder language

EVT0

Sas (LD)

CHART

Sas (LD)

Section in

Grafcet

Alarm_Oven (ST)

Section in text language

Sas (LD)

Cleaning (ST)

Section in ladder language

Section in text language

Subroutines SR0

35015365.01 07/2008

Introducing PL7 software

This division into sections is used to create a structured program and to generate or incorporate program modules easily.

Sub-routines can be called up from any section of the task to which they belong or from other sub-routines in the same task.

35015365.01 07/2008

Introducing PL7 software

Function modules

General points

Function view

The PL7 Pro software is used to structure an application for the Premium PL7 in function modules.

A function module is a regrouping of program elements to carry out an automatic system function.

You can define a multi level tree structure in the automatic system application independently of the PL7 multitask structure.

At each level you can attach program sections written in ladder, text, instruction list or Grafcet language, as well as animation tables and operating screens.

The function view in modules enables you to have a view of coherent functions with regard to the process to be ordered.

The structure view gives a view of the running order for program sections on the

PL7.

The following illustration shows the 2 possible views for an application.

Application Browser

Structure View

MACHINE_PROPORTIONING

Configuration

Program

MAST Task

FAST Task

Events

DFB types

Variables

Animation tables

File

Runtime Screens

Function View

MACHINE_PROPORTIONING

Md_march

Program

Animation tables

Process

Program

Animation tables

Fill in

Program

Animation tables

Proportion

Program

Animation tables

Mixer

Program

Animation tables

Empty

Program

Animation tables

Services associated with the function view

The operating services are available in one view or the other. In particular, with a single command, it is possible to force a function module to run or not.

In this case all sections attached to the function module are automatically forced.

35015365.01 07/2008

Introducing PL7 software

Exporting/ importing function modules

You can export all or part of the tree structure in function modules.

In this case all program sections on different module levels are exported.

35015365.01 07/2008

Description of PL7 object language

Presentation

Subject of this chapter

What's in this

Chapter?

This chapter describes all the PL7 language objects. These objects are used as operands in the instructions.

This chapter contains the following topics:

Topic

Definition of the Main Boolean Objects

Definition of Main Word Objects

Addressing bit objects

Addresing input/output module objects for the TSX 37

Addressing input/output module objects in rack

Addressing of Remote Module Language Objects on a FIPIO Bus

Addressing of language objects associated with AS-i bus

Addressing word objects

Overlay rules

Function block objects

Table type PL7 objects

Indexed objects

Grafcet objects

Symbolizing

Presymbolized objects

Page

35015365.01 07/2008

PL7 object language

Definition of the Main Boolean Objects

Description

Bits

The following table describes the main boolean objects.

Description Examples

Immediate values

0 or 1 (False or True) 0

Inputs/outputs These bits are the "logic images" of the electrical states of the inputs/ outputs.

They are stored in the data memory and are updated every time the task in which they are configured is scanned.

%I23.5

%Q51.2

Internal

Note: The unused input/output bits may not be used as internal bits.

The internal bits are used to store intermediary states during execution of the program.

%M200

System

Function blocks

The system bits %S0 to %S127 monitor the correct operation of the PLC and the running of the application program.

%S10

The function block bits correspond to the outputs of the function blocks or DFB instance.

These outputs may be either directly connected or used as an object.

%TM8.Q

Word extracts With the PL7 software it is possible to extract one of the 16 bits of a word object.

%MW10:X5

Grafcet steps and macrosteps

The status bits enable you to know the status of a step, a macro-step or a step of a macro-step.

%X21

%X5.9

Write access

Yes

Accordin g to i

Accordin g to the type of words

Yes

35015365.01 07/2008

PL7 object language

Definition of Main Word Objects

Description

Words

Immediate values

Inputs/ outputs

Internal

Constants

System

Function blocks

Common

Grafcet

The following table describes the main word objects.

Description

These are algebraic values with the same format as single and double length words (16 or 32 bits), which are used to assign values to these words.

Examples Write access

2542 _ no yes

These are the "logic images" of electrical input/output values (e.g.: analogue inputs/outputs).

They are stored in the data memory and are updated every time the task in which they are configured is scanned.

%IW23.5

%QW51.1

They are used to store values during the program. They are arranged inside the data space in the same memory field.

%MW10

%MD45 yes yes yes (only by the terminal)

They store constants or alphanumeric messages. Their content can only be written or modified by the terminal.

They are stored in the same place as the program. They can therefore be stored to FLASH EPROM memory.

%KW30

These words perform several functions: z some provide information on the state of the system (system and z application operating time, etc.).

others are used to act on the application (running modes, etc.).

These words correspond to current parameters or values of standard function blocks or DFB instances.

%SW5

%TM2.P

They are meant to be exchanged automatically on all stations connected to the communications network.

%NW2.3

according to i yes yes

Grafcet words are used to find out the activity time of steps.

%X5.T

yes

35015365.01 07/2008

PL7 object language

Format of Values Word values can be coded in the following formats:

Type Size

Base 10 integer Single length.

Double length

Base 2 integer Single length.

Double length

Base 16 integer Single length.

Double length

Floating

Example of value

1506

578963

2#1000111011111011011

2#10001110111110110111111

111011111011111

16#AB20

16#5AC10

-1.32E12

Lower limit

-32768

-2 147 483 648

2#10...0

16#0000

16#000000000

-3.402824E+38 (1)

1.175494E-38 (1)

Key

(1) excluded limits

Upper limit

+32767

2 147 483 647

2#01...1

16#FFFF

16#FFFFFFFF

-1.175494E-38 (1)

3.402824E+38 (1)

35015365.01 07/2008

PL7 object language

Addressing bit objects

Presentation Addressing internal, system and step bits observes the following rules:

Symbol

M, S or X

Object type i

Number

Syntax

Family

Symbol

Object type

Number

The table below describes the different elements that make up addressing.

Element Values

% -

M -

Description

Internal bits used to store intermediate states while the program is running. They are arranged inside the data space in the same memory field.

System bits (See Reference Manual, Volume 2), these bits fulfil several functions : z some find out about the status of the system by reading bits %Si z

(watch dog overflow,…).

others are used to act on the application (initializing Grafcet,…).

Step bits , step bits (see

Grafcet objects, p. 53

) give the status of step activities.

The maximum number value depends on the number of objects configured.

Examples: z z z

%M25 = internal bit number 25

%S20 = system bit number 20

%X6 = step bit number 6

35015365.01 07/2008

PL7 object language

Bits extracted from words

PL7 software is used to extract one of the 16 bits from single length words. The address of the word is then completed by the bit row extracted according to the syntax below:

WORD : X j

Word address Position j= 0 - 15 bit rank in the word.

Examples: z z

%MW10:X4 = bit number 4 of internal word %MW10

%QW5.1:X10 = bit number 10 of output word %QW5.1

Note: extracting bits from words can also be done on indexed words.

35015365.01 07/2008

PL7 object language

Addresing input/output module objects for the TSX 37

Presentation

Illustration

Addressing input/output module bit and word principal objects is done geographically. That means that it depends: z z z on the number (address) of the rack, the physical position of the module in the bac, the module channel number.

Addressing is defined in the following way:

% I,Q,M,K X, W, D, F

Symbol Object type Format

Position

• i • r

Channel no. Rank

35015365.01 07/2008

PL7 object language

Syntax

Family

Symbol

Object type

Format (size)

Module position

Channel no.

Row

The table below describes the different elements that make up addressing.

F i

Element Values Description

% -

Picture of the physical input of the module,

Picture of the physical output of the module,

This information is exchanged implicitly each cycle of the task to which it is attached.

Internal variable

This reading or writing information is exchanged at the request of the application.

Internal constant

This configuration information is available as read only.

X x r

16 bits

32 bits

Boolean

For Boolean objects the X can be omitted.

Single length.

Double length.

Floating. The floating format used is the IEEE Std 754-1985 standard

(equivalent to IEC 559).

0 - 8

0 - 10

0 - 31 or

MOD

TSX 37 -10

TSX 37-21/22

Note: a module in standard format (taking up 2 positions) is addressed as

2 modules in the superimposed 1/2 format (see explanations below).

Module channel number

MOD: channel reserved for managing the module and parameters common to all the channels.

0 - 127 or

ERR

Position of the bit in the word.

ERR: indicates a module or channel fault.

Examples

Object

%I1.5

%MW2.0.3

%I5.MOD.ERR

The table below shows some examples of addressing objects.

Description

See input number 5 of the input/output module in position 1.

Status word of row 3 of channel 0 of the input/output module on position 2.

Information on input/output module fault on position 5.

35015365.01 07/2008

PL7 object language

Standard format modules

Module

Channel number

Addressing:

Channel position/ number

(x=position)

They are addressed as 2 modules in superimposed 1/2 format.

For example, a module with 64 I/O occupying positions 5 and 6 is seen as 2 1/2 format modules: z z a 1/2 module of 32 inputs on position 5, a 1/2 module of 32 inputs on position 6,

The table below describes coding for the channel position/number according to the module.

1/2 format

0 - 3

0 - 7 x.0

to x.3

x.0

to x.7

12I

0 - 11 x.0

to x.11

Standard format

28I/O 32I

0 - 15 (I) 0 - 15 (I)

0 - 11 (O) 0 - 15 (I) x.0

to x.15

(x+1).0

(x+1).11

x.0

to x.15

(x+1).0

(x+1).15

32O 64I/O

0 - 15 (O) 0 - 31 (I)

0 - 15 (O) 0 - 31 (O) x.0

to x.15

(x+1).0

(x+1).15

x.0

to x.31

(x+1).0

(x+1).31

Examples

Object

%I3.6

%Q4.2

The table below shows two examples of addressing standard 28 I/O module objects occupying positions 3 and 4.

Description

Input channel module number 6

Output channel module number 2

35015365.01 07/2008

PL7 object language

Addressing input/output module objects in rack

Presentation

Illustration

Addressing input/output module bit and word principal objects is done geopgraphically. That means that it depends: z z z on the number (address) of the rack, the physical position of the module in the rack, the module channel number.

Addressing is defined in the following way:

% I, Q, M, K X, W, D, F

Symbol Object type Format

Rack

Position

• i • r

Channel no. Rank

Syntax The table below describes the different elements that make up addressing.

Family

Symbol

Object type

Format (size)

Element Values Description

% -

Picture of the physical input of the module,

Picture of the physical output of the module,

This information is exchanged automatically each cycle of the task to which they are attached.

Internal variable

This reading or writing information is exchanged at the request of the application.

Internal constant

This configuration information is available as read only.

Boolean

For Boolean objects this element can be omitted.

16 bits

32 bits

Single length.

Double length.

Floating. The floating format used is the IEEE Std 754-1985 standard

(equivalent to IEC 559).

Rack address x 0 or 1

0 - 7

TSX 5710/102/103/153, PMX 57102, PCX 571012).

Other processors.

(1) : the maximum number of slots means that 2 racks must be used for the same address.

35015365.01 07/2008

PL7 object language

Family

Module position

Channel no.

Row i

Element Values y r

00 - 14

(1)

Description

Position number in the rack.

When the rack number (x) is not 0, the position (y) is coded with 2 digits:

00 - 14; on the other hand, if the rack number (x) is 0, you remove the zeros which are not significant (elimination from the left) from "y" ("x" does not appear and "y" is 1 digit for values less than 9).

0 - 127 or

MOD

MOD : channel reserved for managing the module and parameters common to all the channels.

0 - 127 or

ERR

Position of the bit in the word.

ERR: indicates a module or channel fault.

(1) : the maximum number of slots means that 2 racks must be used for the same address.

Examples

Object

%MW2.0.3

%MW103.0.3

%I102.MOD.ERR

%I204.3.ERR

The table below shows some examples of addressing objects.

Description Illustration

Status word of row 3 of track 0 of the discrete input module on position 2 of rack

Status word of row 3 of track 0 of the discrete input module on position 3 of rack

Information on analogue input module fault on position 2 of rack 1.

Information on a fault on channel 3 of the analogue output module on position 4 of rack 2.

0 1

L p s o o o o o m

0 1 2 3 4

35015365.01 07/2008

PL7 object language

Addressing of Remote Module Language Objects on a FIPIO Bus

At a Glance

Illustration

The addressing of the main bit and word objects of remote modules on the FIPIO bus is performed on a geographical basis. That means that it depends on: z z z the connection point,

The type of module (base or extended),

The channel number.

Addressing is defined in the following way:

% I, Q, M, K

Symbol Type of object

X, W, D, F

Format

\ p.2.c

\ m

Address of module/channel and connection point

Rack n°

• i •

Channel

No.

Rank

Syntax The table below describes the different elements that make up addressing.

Family

Symbol

Type of object

Format (size)

Module/channel address and connection point p

2 c

Module position m

Element Values Meaning

% -

Image of the physical input of the module,

Image of the physical output of the module,

This information is exchanged automatically for each cycle of the task to which they are attached.

Internal variable

This read or write information is exchanged at the request of the application.

Internal constant

This configuration information is available as read only.

Boolean

For Boolean objects the X can be omitted.

16 Bit

32 Bit

Single length.

Double length.

Floating point. The floating point format used is the IEEE Std 754-1985 standard (equivalent to IEC 559).

0 or 1

Position number of the processor in the rack.

Channel number of the built-in FIPIO link in the processor.

1 to 127 Connection point number.

0 or 1 0: base module, 1: extension module.

35015365.01 07/2008

Family

Channel No.

Rank

PL7 object language i

Element Values Meaning r

0 to 127 or MOD

0 to 255 or ERR

MOD: channel reserved for managing the module and parameters common to all the channels.

ERR: indicates a module or channel fault.

Examples The table below shows some examples of addressing objects.

Object

%MW\0.2.1\0.5.2

Meaning

Status word at rank 2 of the image bit of input 5 of the remote input base module situated at connection point 1 on the FIPIO bus.

%I\0.2.1\0.7

%Q\0.2.1\1.2

Image bit of output 2 of the remote output extension module situated at connection point 1 on the FIPIO bus.

%I\0.2.2\0.MOD.ERR Fault information for Momentum module situated at connection point

2 on the FIPIO bus.

%Q\1.2.3\0.0.ERR

Image bit of input 7 of remote input base module situated at connection point 1 on the FIPIO bus.

Fault information for channel 0 of CCX17 module situated at connection point 3 on the FIPIO bus.

TSX 57253 FIPIO manager

1 TBX LEP 030 0 TBX DES 1622 1 TBX DSS 1622

2 170 FNT 110 01 0 170 AAI 030 00

3 TSX FPP 010 0 T CCX 17 20 F

35015365.01 07/2008

PL7 object language

Addressing of language objects associated with AS-i bus

Presentation

Illustration

Addressing for the main bit and word objects associated with the AS-i bus is geographical. This means that it depends on: z z z the number (address) of the rack where the interface card is positioned, the physical position of the interface card in the rack, the number (address) of the slave device on the AS-i bus.

Addressing is defined as follows:

% I ou Q

Symbol Object type

\ xy.0

Rack/module/channel addrss for TSX SAY 100

\ n

Slave number

• i

Bit rank

Syntax The table below describes the different elements which constitute addressing.

Family

Symbol

Object type

Rack address

Module position

Element Values Description

Q x y

0 or 1

0 to 7

00 to 14

(1)

Image of the module's physical input,

Image of the module's physical output,

This data is exchanged automatically on every cycle of the task to which it is connected.

TSX 5710/102/103/153, PMX 57102, PCX 571012).

Other processors

Rack position number.

When the rack number (x) is other than 0, the position (y) has a 2 digit code: 00 to 14; however, if the rack number (x) = 0, the non-meaningful zeros are deleted (from the left) from "y" ("x" does not appear and "y" takes 1 digit for values of less than 9).

Channel no.

Slave no.

Position i

0 n

0 to 31

0 to 3

The interface card TSX SAY 100 only has one channel.

Physical address of slave.

Position of output or input image bit.

(1) : The maximum number of slots requires an extension rack to be used.

35015365.01 07/2008

Example

PL7 object language

The table below gives some examples of object addressing.

Object

%I3.0\2.2

%Q3.0\4.3

Description

Input 2 of slave 2, the module TSX SAY 100 being positioned at slot 3 of rack 0.

Output 3 of slave 4, the module TSX SAY 100 being positioned at slot 3 of rack 0.

1 o

C o m m

1 2 3

P ABE-8R44SB11

4 P

XVA-S102

35015365.01 07/2008

PL7 object language

Addressing word objects

Presentation

Illustration

Addressing words (except for input/output module and function block words) follows the same syntax described below.

Addressing internal, constant and system words observes the following rules:

Symbol

M, K or S

Object type

B, W, D or F

Format i

Number

Syntax

Family

Symbol

Object type

The table below describes the different elements that make up addressing.

Element Values

% -

M -

Description

Internal words used to store values during the program. They are arranged inside the given space in the same memory field.

Constant words store constant values or alphanumeric messages.

Their content can only be written or modified by the terminal. They are stored in the same place as the program. They can therefore have the FLASH EPROM memory as a support.

System words (See Reference Manual, Volume 2), these words fulfil several functions: z some find out about the state of the system by reading the %SWi words (system and application operating time,…).

z others are used to act on the application (running modes,…).

35015365.01 07/2008

Family

Format

Number

PL7 object language

Element Values

B 8 bits

16 bits

32 bits

Description

Octet , this format is used exclusively for operations on character strings.

Single length.

: these 16 bit words can contain an algebraic value between - 32 768 and 32 767,

15 14 13 12

0 1 1 1

11 10 9 8

Most Significant Bit

0 1 1 1

7 6 5 4

0 0 1 1

Bit position

3 2 1 0

0 1 0 0

Least Significant Bit

Double length : these 32 bit words can contain an algebraic value between -2 147 483 648 and 2 147 483 647. These words are stored in the memory on two consecutive single length words.

F 32 bits

15 14 13 12

0 1 1 1

11 10 9 8

0 1 1 1

0 0 1 1 0 1 1 0

Most Significant Bit

Least Significant Bit

7 6 5 4

0 0 1 1

0 1 0 1

3 2 1 0

0 1 0 0

0 0 1 0

Floating : the floating format used is the IEEE Std 754-1985 standard (equivalent to IEC 559). The length of the words is 32 bits, which corresponds to single precision floating numbers.

i -

Examples of floating values:

1285.28

12.8528E2

The maximum number value depends on the number of objects configured.

Examples: z z z z

%MW15 = single length internal word number 15

%MF20 = floating internal word number 20

%KD26 = constant double word number 26

%SW30 = system word number 30

35015365.01 07/2008

PL7 object language

Addressing words on the network

Addressing words on the network is described in the manual Application communication.

Otherwise networks use specific objects: common words. These are single length object words (16 bits) common to all stations connected on the communications network.

Addressing: %NW{i.j}k with: i = 0 - 127 network number, j = 0 - 31 station number and k= 0 - 3 word number

35015365.01 07/2008

PL7 object language

Overlay rules

Principles

Illustration

Bytes, single, double length and floating words are arranged inside the space given in the same memory field.

Thus overlay is possible between: z z z the double length word %MDi and the single length words %MWi and %MWi+1

(the word %MWi being the least significant and the word %MWi+1 the most significant of the word %MDi), the single length word %MWi and the bytes %MBj and %MBj+1 (with j=2 x i), the floating %MFk and the single length words %MWk and %MWk+1.

This illustration shows overlay of internal words.

%MD1

%MD0

%MD2

%MW0

%MW1

%MW2

%MW3

%MB1

%MB3

%MB5

%MB7

%MD3

%MDi

%MWi

%MWi+1

%MB0

%MB2

%MB4

%MB6

%MFk

%MWk

%MWk+1

Examples z z z z

%MD0 corresponds to %MW0 and %MW1 (see illustration above).

%MW3 corresponds to %MB7 and %MB6 (see illustration above).

%KD543 corresponds to %KW543 and %KW544.

%MF10 corresponds to %MW10 and %MW11.

35015365.01 07/2008

PL7 object language

Function block objects

General points

Example of a function block

Function blocks set up bit objects and specific words that can be accessed by the program.

The following illustration shows a counter/count down function block.

%Ci

%C.P:9999

MODIF:Y

Counter/count down block

Bit objects

Word objects

They correspond to block outputs. These bits can be accessed by Boolean test instructions.

They correspond: z z to block configuration parameters. These parameters can be accessed (e.g.: pre-selection parameters) or not (e.g.: base time) by the program, to current values (e.g.: %Ci.V counting value in progress).

35015365.01 07/2008

PL7 object language

List of function block objects that can be accessed by the program

Function blocks

Timer

Counter/Down counter

Monostable

%Ci

The following table describes all the function block objects.

Symbol No. of

Maxi

Micro

%TMi 64

%MNi

No. of

Maxi

Premium

255

(128 default)

255

(64 default)

Types of objects

Word

Bit

Word

Description

Current value

255

(32 default)

Bit

Word

Bit

Preset value

Timer output

Current value

Preset value

Overflow output (empty)

Pre-selection output reached

Overflow output (full)

Current value

Preset value

Overflow output (empty)

Word register

Drum

%Ri

%DRi

Series 7 timeer %Ti

255

(4 default)

Word

Bit

255

(8 default)

Word

Bit

255

(0 default)

Word

Bit

Address Write access

%TMi.V

%TMi.P

%TMi.Q

%Ci.V

%Ci.P

%Ci.E

%Ci.D

%Ci.F

%MNi.V

%MNi.P

%MNi.R

Access to register

%Ri.I

%Ri.O

%Ri.F

yes yes no

Number of step in progress %DRi.S

Status of step j no yes

%DRi.Wj

%DRi.V

%DRi.F

no no

Activity time of step

Last defined step in progress

Current value

Preset value

Output in progress

Timer output elapsed

%Ti.V

%Ti.P

%Ti.R

%Ti.D

no yes no no no no yes no no yes no no yes no no

35015365.01 07/2008

PL7 object language

Note: the total number of timers %TMi + %Ti is limited to 64 for a Micro, and 255 for a Premium.

35015365.01 07/2008

PL7 object language

Table type PL7 objects

Bit table Bit tables are sets of adjacent bit objects of the same type and defined length: L

Example of bit tables : %M10:6

%M10 %M11 %M12 %M13 %M14 %M15

%M10:6

This table defines bit objects which can be put into the form of a bit table.

Type

Discrete input bits

Discrete output bits

Internal bits

Grafcet bits

Address

%Ix.i:L

%Qx.i:L

%Mi:L

%Xi:L, %Xj.i:L

Example

%I25.1:8

%Q34.0:16

%M50:20

%X50:30

Write access

Yes

Note: the maximum length of the tables depends on the object type z For discrete input/output bits : the maximum size depends on the modularity

(number of module inputs/outputs).

z For internal or Grafcet bits when configuring.

: the maximum size depends on the sized defined

35015365.01 07/2008

PL7 object language

Word tables Word tables are sets of adjacent bit objects of the same type and defined length: L

Example of word tables: %KW10:5

%KW10 16 bits

%KW14

This table defines word objects which can be put into the form of a word table.

Type Format

Internal words Single length.

Double length

Floating point

Constant words Single length.

Double length

Floating point

Grafcet words Grafcet words

System words System words

Address Example

%MWi:L

%MDi:L

%MFi:L

%KWi:L

%MW50:20

%MD30:10

%MF100:20

%KW50:20

%KDi:L

%KFi:L

%KD30:10

%KF100:20

%Xi.T:L, %Xj.i.T:L %X12.T:8

%SWi:L %SW50:4

Yes

Write access

Yes

Note: The maximum lengths of the tables depend on the object type.

z For internal, constant or Grafcet words : the maximum size depends on the z sized defined when configuring.

For system words : only the words %SW50 to 53 can be set out in the form of a table.

35015365.01 07/2008

Character strings

PL7 object language

Character strings are sets of adjacent bytes of the same type and defined length: L

Example of character string: %MB10:5

%MB10 8 bits

%MB14

This table defines bit objects which can be put into the form of a character string.

Type

Internal words

Constant words

Address

%MBi:L

%KBi:L

Example

%MB10:8

%KB20:6

Write access

Yes

Note: the index i must be even.

35015365.01 07/2008

PL7 object language

Indexed objects

Direct

Addressing

Indexed

Addressing

Object addressing is called direct when the address of these objects is fixed and defined when the program was written.

Example: %MW26 (internal word with address 26)

In indexed addressing, the object's direct address is completed with an index: the contents of the index is added to the object address.

The following table shows the type of index that can be used depending on the type of PLC:

Type of index an internal word %MWi a constant word %KWi an immediate value

Premium/Atrium PLCs

Micro PLCs

Key

X: useable

- : unusable

There is no limit to the number of "index words".

This type of addressing is used to run through a set of objects of the same type

(internal words, constant words, etc.), successively: the contents of the index is added to the object address.

Example:

MW108[%MW2]: direct address word 108 + contents of word %MW2.

If the word %MW2 has the value 12 for its content, writing %MW108[%MW2] is therefore equivalent to writing %MW120.

35015365.01 07/2008

Description of

Indexable

Objects

PL7 object language

The following table defines the objects that can be indexed.

Type

Input bits

Output bit

Internal bit

Grafcet bit

Internal words

Constant word

Grafcet words

Word table

Format

Boolean

Single length

Double length

Floating point

Single length

Double length

Floating point

Single length

Address

%Ixy.i[index]

%Qxy.i[index]

%Mi[index]

%Xi[index]

%Xj.i[index]

%MWi[index]

%MDi[index]

%MFi[index]

%KWi[index]

%KDi[index]

%KFi[index]

%Xi .T[index]

Example

%I21.3[%MW5]

%Q32.4[%MW5]

%M10[%MW5]

%X20[%MW5]

%X2.3[%MW5]

%MW30[%MW5]

%MD15[%MW5]

%MF15[%MW5]

%KW50[%MW5]

%KD50[%MW5]

%KF50[%MW5]

%X20 .T[%MW5]

Yes

Write access

Yes

%Xj.i .T[index] %X2.3 .T[%MW5] No

%MWi[index]:L %MW50[%MW5]:10 Yes

%MDi[index]:L

%KWi[index]:L

%KDi[index]:L

%MD40[%MW5]:10

%KW70[%MW5]:20

%KD80[%MW5]:10

Yes

Note: the maximum values of the indexes depend on the types of object indexed.

z For discrete input/output bits : 0<i+index<m (m being the maximum number z of module inputs/outputs).

For all other objects (except double length or floating objects):

0<i+index<Nmax, Nmax = maximum size depends on the size defined in the configuration.

For double length or floating words: 0<i+index<Nmax-1.

Indexing Double

Words

The real address = direct address of the indexed double word + twice the content of the index word.

Example: %MD6[%MW100]

If %MW100=10, the word addressed will be 6 + 2 x 10 -->%MD26.

35015365.01 07/2008

PL7 object language

Index Overflow The index will overflow as soon as the address of an indexed object exceeds the limits of the field containing the same type of object, i.e. when: z z object address + index content less than zero, object address + index content greater than the maximum limit configured.

If the index overflows, the system resets the system bit %S20 to 1 and the object is assigned with an index value of 0.

The following table gives the conditions for setting the system bit %S20 to 1 and 0.

Set to 1 z set to 1 by the system on index overflow

Reset to 0 z set to 0 by the user after modifying the index

35015365.01 07/2008

PL7 object language

Grafcet objects

Bit objects

Word objects

The following table summarizes all the Grafcet bit objects available and describes their role.

Type

%Xi

%XMj

%Xj.i

Description status of step i of the main graph (Chart).

status of the Grafcet macro step j.

status of the i step of the Grafcet j macro step

%Xj.IN

status of the input step of the macro step

%Xj.OUT

status of the output step of the macro step

These bits are set to 1 when the step or the macro step is active, to 0 when it is inactive.

The following table summarizes all the Grafcet word objects available and describes their role.

Type

%Xi.Ti

Description activity time for Grafcet step i.

%Xj.i.T

%Xj.IN.T

activity time for the i step of the Grafcet j macro step activity time for step i of macro step j which allows it to find out about the status of step i of the Grafcet macro step j.

%Xj.OUT.T

activity time for the input step of the macro step

%Xj.OUT

activity time for the output step of the macro step

These words are incremented every 100 ms and take a value of between 0 and

9999.

35015365.01 07/2008

PL7 object language

Symbolizing

Role Symbols are used to address PL7 language objects by name or customized mnemonics.

Syntax

Characters that can be used

A symbol is a string of a maximum of 32 alphanumeric characters the first character of which is alphabetic.

A symbol begins with a capital letter, the others are in lower case (e.g.: Burner_1 ).

When it is being entered the symbol can be written in capitals or lower case

(e.g.: BURNER_1 ), the program automatically puts the symbol in the correct form.

The following table provides the characters that can be used when creating symbols.

Type alphabetic capitals alphabetic lower case

Description

"A - Z" and the following letters

"ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏDÑÒÓÓÕÖØÙÚÛÜYp"

"a - z" and the accented letters àáâãäåæçèéêëìíîïñòóôõöØùúûüypßÿ numerical figures from 0 - 9 (they cannot be in first place of the symbol).

the character "_" it cannot be either at the beginning of the symbol nor at the end.

A certain number of words are reserved by the language and cannot be used as symbols, see (See Reference Manual, Volume 3).

Editing symbols Symbols are defined and associated with language objects by the variables editor.

A comment of 508 characters can be associated with each symbol.

Symbols and their comments are stored on the terminal hard disk and not in the PL7.

35015365.01 07/2008

PL7 object language

Objects which can be made into symbols

All PL7 objects can be symbolized except for table type structured objects and indexed objects, but if the base object or index is symbolized the symbol is used in the structured object.

Examples: z z if the word %MW0 has "Temperature" for a symbol, the word table %MW0:12 is symbolized by Temperature:12 , the word %MW10 has Oven_1 for a symbol, the indexed word %MW0[%MW10] is symbolized by Temperature[Oven_1] .

Object bits extracted from words, bits or function block words can be symbolized but if they are not symbolized they can inherit the symbol from the base object.

Examples: z z if the word %MW0 has Pump_state for a symbol and if the bit extracted from the word %MW0:X1 is not symbolized, it inherits the symbol from the word,

%MW0:X1 has as its symbol: Pump_ state:X1 , if the function block %TM0 has for its symbol Time_oven1 and if the output

%TM0.D is not symbolized, it inherits the block symbol, %TM0.D has as its symbol: Time_oven.D

Object which are only symbolic

DFB function block parameters can only be accessed in the form of symbols. These objects are defined by the following syntax:

Name_DFB.Name_parameter

The elements have the following meaning and characteristics.

Element

Name_DFB

Name_parameter

Maximum number of charactes

Description name given to the DFB function block used.

name given to the output parameter or public variable.

Example: Gap.check

for the gap output of the DFB instance named Check .

35015365.01 07/2008

PL7 object language

Presymbolized objects

Role

Syntax

Certain application specific functions (example: counting, axes request, …) support an automatic symbolization of the objects which are linked to them.

If you give the generic symbol of the module’s %CHxy.i channel, all of the symbols of the objects linked to this channel can then be automatically generated on request.

These objects are symbolized with the following syntax:

PREFIX_USER_SUFFIX_MANUFACTURER

The elements have the following meaning and characteristics:

Description Element

PREFIX_USER

SUFFIX_MANUFACT

URER

Maximum number of characters

20 generic symbol given to the channel by the user part of the symbol which corresponds to the bit object or word of the channel given by the system

Example

Note: as well as the symbol, a manufacturer’s comment is automatically generated, this comment recalls succinctly the object’s role.

This example shows a counting module situated in slot 3 of the automatic tray.

If the generic symbol (prefix-user) given to channel 0 is Pieces_count , the following symbols are automatically generated.

Address Type

%CH3.0

Symbol Comment

%ID3.0

DWORD Pieces_count_cur-meas

%ID3.0.4

DWORD Pieces_count_capt

%I3.0

%I3.0.1

EBOOL

Pieces_count_enab_activ

Pieces_count_pres_done

Counter current value

Counter captured value

Counter enable active

Preset done

35015365.01 07/2008

User memory

Presentation

Aim of this

Chapter

What's in this

Chapter?

This chapter describes the memory structure of Micro and Premium PL7s.

This chapter contains the following topics:

Topic

Memory structure of Micro PLCs

Memory structure for Premium PL7s

Description of bits memory

Word memory outline

Characteristics of TSX 37 PL7 memory

Memory characteristics of TSX/PCX 57 10/15/20/25/26/28 PLCs

Characteristics of TSX/PCX 57 30/35/36 PL7 memories

Characteristics of TSX 57 453/4823 PL7 memory

Page

35015365.01 07/2008

User memory

Memory structure of Micro PLCs

General

Bit memory

Role of word memory

The memory space of Micro PLCs that is user-accessible can be broken down into two distinct sub-sets: z z bit memory word memory

The bit memory is located in the processor's built-in RAM. It contains an image of the 1280 bit objects.

The word memory (16 bits) supports: z z z data : dynamic application data and system data, the program : descriptors and executable code of tasks, constants : constant words, initial values and input/output configuration.

Structure without memory extension card

The data, program and constants are supported by the processor's internal RAM.

The following diagram shows the memory structure.

Internal

RAM

Internal

Flash

EPROM

Data

Program

Constants

Backup of program and constants

%MW backup

The processor's built-in Flash EPROM memory can be used to back up: z z the application program (9 or 15 KWords depending on the processor),

1000 %MWi internal words.

35015365.01 07/2008

Structure with memory extension card

User memory

The data are supported by the processor's internal RAM.

The program and constants are supported by the memory extension card.

The following diagram shows the memory structure.

Internal

RAM Data

Internal

Flash

EPROM

Zone cannot be used

%MW backup

External RAM or

Flash EPROM memory card

Program

Constants

The 10/16 KWords of Flash EPROM memory (depending on the processor) built into the processor can be used to back up 1000 %MWi internal words.

Memory backup The RAM can be backed up using a Ni-Cad battery: z z supported by the processor for the bit memory and internal RAM, inserted into the card for a RAM memory card.

In order to copy the application to the internal FLASH EPROM memory, the PLC must not have a PCMCIA card fitted and the application must be of less than or equal to 9/15 KWords in size (depending on the processor).

The application is automatically transferred from the internal FLASH EPROM to

RAM when the application is lost from RAM (failed backup or no battery).

A manual transfer can also be requested from a programming terminal.

35015365.01 07/2008

User memory

Memory structure for Premium PL7s

General Premium PL7 memory space comprises only one set.

The bit memory is integrated into the word memory (in the data field). It is limited to

4096 bits.

Role of the words memory

The words memory (16 bits) supports: z z z data : dynamic application data and system data (the system reserves a RAM memory field of at least 5 K words) the program : descriptors and executable code for tasks, constants : constant words, initial values and input/output configuration.

Structure without extension memory card

Program, data and constants are supported by the internal RAM memory in the processor module.

The following diagram describes the memory structure. internal

RAM

Data

Program

Constants

Structure with extension memory card

Data is supported by the processor module internal RAM memory.

Programs and constants are supported by the extension memory card.

The following diagram describes the memory structure. internal

RAM Data

RAM memory card or external

EPROM

Flash

Program

Constants

35015365.01 07/2008

Saving the memory

User memory

The bit memory and internal RAM are backed up by the nickel cadmium battery supported by the processor module.

The internal RAM memory card is backed up by a nickel cadmium battery.

35015365.01 07/2008

User memory

Description of bits memory

General points

Operation

For Micro PL7s: this memory contains 1280 bit objects whatever the type of PL7.

For Premium PL7s: this bit memory does not exist and its contents are in the word memory in the application data field.

PL7 bit object coding is used to test the rising or falling edges on: z z input/output bits, internal bits.

Each bit object contained in the bit memory is stored using 3 bits allocated in the following way:

F P C

Current status (only bit that can be accessed by the application program)

Previous status

Forcing status

When updating the bit memory the system maintains:

Phase

Description

Transferring the map from the current status to the past status.

Re-updating the current status by the program, the system or the terminal (by forcing a bit).

Forcing When forcing is requested by the terminal: z z

Forcing status F is set to 1 current status C is set to : z 1 if forcing to 1 is requested z 0 if forcing to 0 is requested

These states do not develop any more until: z z forcing is stopped and the bit involved updated, reverse forcing is requested, only the current status is modified.

35015365.01 07/2008

User memory

Advice for using rising or falling edges

These rising or falling edge contact instructions only operate correctly if you follow the rules below: z z z z z in each case, to process the same object: z input bit: the edge contact in the task or input module is exchanged, z output or internal bit: process reading and writing to it within the same task.

Any bit object tested on an edge must be written only once using normal coils -

( ) - or negated coils -(/)- (and/or equivalent in Instruction List language). Do not use -(S)- or -(R)- coils. When an output is declared in an event processing exchange list, it triggers the exchange of the group of channels assigned to it; this disrupts the management of the edges in the task which normally manages this group of channels.

do not SET or RESET an object whose edge you are testing because even if the result of the equation that sets SET/RESET is 0, the SET/RESET action is not carried out but the object history is updated (edge is lost).

do not test the edge of inputs/outputs used in the event task, a master task or a fast task for internal bits: detecting an edge is not dependent on the task cycle. An edge on internal bit %Mi is detected when its status has changed between 2 readings.

This edge remains detected as long as this internal bit is not scanned in the action field.

Example : And so in the example below, if you force bit %M0 to 1 in an animation table, the edge remains permanent.

%M0

P INC %M0

So that the edge is only detected once, you must use an intermediate internal bit. In this case the %M1 history is updated, therefore the edge is only present once.

%M0 %M1

%M1

P INC %M0

35015365.01 07/2008

User memory

Word memory outline

General information

This 16 bit word memory consists of 3 logic spaces: z z z

Data,

Program,

Constants.

Space size is defined by configuration.

Note: symbols and comments associated with the objects are not recorded in the

PL7 memory but stored in the local application (terminal hard disk).

Application data memory

Data memory comprises the following fields:

Word type

System

Function blocks

Internal

Inputs/outputs

Network commons

Description

Fixed number

Contains words and inputs/outputs for these blocks (current values, adjustment values).

Number of function blocks of each type is set by configuration

Size defined by configuration.

Contains words associated with each module. Number depends on modules configured.

4 common words per PL7 station (only available if communications module is present and configured for common words exchange).

Application program memory

Contains executable program code, graphic information (contact network) and program comments.

Note: number of programming elements (contact networks, program comments, etc.) is restricted, irrespective of language used or program memory size. PL7 displays warning before limit is reached.

Application constant memory

Contains function block and input/output module parameters defined by configuration and constant words %KW.

35015365.01 07/2008

User memory

Characteristics of TSX 37 PL7 memory

Size of bit memory

The following table describes the bit object memory division.

TSX Processor

Size available on processor

Type

of objects system bits %Si input/output bits %I/O (?)x.i

internal bits %Mi step bits %Xi

Key

(1)

37 05/08/10

1280

128

(1)

256

37 21/22

1280

128

(1)

256

128 depends on the hardware configuration declared (input/output modules, devices on AS-i bus)

Size of the words memory

The following table describes the word object memory division.

TSX Processor 3705/08

Cartridge internal RAM

3710

9 Kwords 14

Kwords

Data (%MWi) 0,5

Kwords(1)

0,5

Kwords

(1)

100% Boolean program

• LD language

• IL language

• ST language

90% Boolean program

• LD language

• IL language

• ST language

65% Boolean program

• LD language

• IL language

• ST language

1,6 Ki

2 Ki

1,3 Ki

1,1 Ki

1,4 Ki

1,1 Ki

0,9 Ki

1,0 Ki

3,8 Ki

4,9 Ki

3,3 Ki

3,1 Ki

3,8 Ki

2,9 Ki

2,2 Ki

2,5 Ki

3721

Kwords

0,5

Kwords

(1)

6,6 Ki

8,4 Ki

5,6 Ki

5,4 Ki

6,6 Ki

5,1 Ki

4,0 Ki

4,6 Ki

32 Kwords 64 Kwords 128 Kwords

52 Kwords 84 Kwords 148

Kwords

17,5

Kwords

17,5

Kwords

17,5

Kwords

13,7 Ki

17,5 Ki

11,7 Ki

11,8 Ki

14,3 Ki

11,1 Ki

9,1 Ki

10,3 Ki

28,5 Ki

36,3 Ki

24,2 Ki

24,7 Ki

30,0 Ki

23,3 Ki

18,9 Ki

21,3 Ki

58,2 Ki

74,2 Ki

49,5 Ki

50,1 Ki

61 Ki

47,3 Ki

38,4 Ki

43,4 Ki

35015365.01 07/2008

User memory

TSX Processor 3705/08 3710

Constants (1) 128 words 128 words

Key

(1)

3721

128 words

256 words 512 words 512 words

Default size, can be extended at the expense of the application program size.

K instructions (1024 instructions)

The following table describes the word object memory division.

TSX Processor 37 22

Cartridge internal RAM

Data (%MWi)

20 Kwords

32 Kwords

52 Kwords

0,5 Kwords (1) 17,5 Kwords

100% Boolean program

• LD language 6,3 Ki

• IL language 8,1 Ki

• ST language 5,4 Ki

90% Boolean program

• LD language 5,2 Ki

13,6 Ki

17,3 Ki

11,5 Ki

11,6 Ki

14,2 Ki

11,0 Ki

• IL language

• ST language

6,3 Ki

4,9 Ki

65% Boolean program

• LD language

• IL language

• ST language

3,9 Ki

4,4 Ki

128 words

8,9 Ki

10,1 Ki

256 words Constants (1)

Key

(1)

64 Kwords

84 Kwords

17,5 Kwords

28,4 Ki

36,1 Ki

24,1 Ki

24,5 Ki

29,8 Ki

23,2 Ki

18,8 Ki

21,2 Ki

512 words

128 Kwords

148 Kwords

17,5 Kwords

57,6 Ki

73,5 Ki

49 Ki

50 Ki

60,8 Ki

47,2Ki

38,4 Ki

43,4 Ki

512 words

Default size, can be extended at the expense of the application program size.

K instructions (1024 instructions)

Note: the PL7 AP/memory usage command is used to find out about the application memory division in the PL7 memory.

35015365.01 07/2008

User memory

Memory characteristics of TSX/PCX 57 10/15/20/25/26/28 PLCs

Size of bit memory

This table describes the memory distribution of word objects in TSX 57 1••,

TSX 572••, TSX 57 2•23 and PCX 57 203 PLCs.

Processor

Type

of objects system bits %Si.

input/output bits %I/Qx.i

internal bits %Mi (max no.) step bits %Xi (max. no.)

TSX 57 103/153 and

PCX 57 203

TSX57 203/

253/2623/2823

128

(1)

128

(1)

3962

1024

8056

1024

Legend

(1) (1) depends on the declared hardware configuration (I/O modules, devices on AS-interface bus).

35015365.01 07/2008

User memory

Size of the words memory

The following table describes the memory distribution of word objects in TSX 57 1••,

TSX 57 2••, TSX 57 2•23 and PCX 57 203 PLCs.

Processor

Cartridge internal

RAM

Data

(%MWi)

TSX 57-103 - TSX 57 153

32K

0.5 K (1) 26 K

64K

32K

26 K

TSX

PCX 57/

203/

2623

TSX- 57

253/

2823

TSX-PCX

57 203/

TSX 57

253/2623/

2823

32K

48K/64K 48K/64K 48K/64K

1K (1) 1K (1) 30.5K

100% Boolean program

• LD

Langage

8.8 Ki 12.3 Ki 26.9 Ki 15.5 Ki 22.8 Ki 12.3 Ki

29.1 Ki 15.6 Ki • IL language

11.2 Ki

• ST language

7.6 Ki

90% Boolean program

5.2 Ki

15.6 Ki

10.5 Ki

8.6 Ki

34.3 Ki

22.9 Ki

21.4 Ki

19.7 Ki

13.1 Ki

11.0 Ki • LD language

• IL language

6.2 Ki 10.3 Ki 25.6 Ki 13.1 Ki

8.3Ki

20.5 Ki 10.5 Ki • ST language

5.0 Ki

65% Boolean program

• LD language

3.6 Ki

3.7 Ki • IL language

• ST language

4.2 Ki

6.7 Ki

6.8 Ki

7.9 Ki

16.7 Ki

17.0 Ki

19.7 Ki

8.1 Ki

8.3 Ki

9.6 Ki

19.4 Ki

17.4 Ki

20.7 Ki

16.6 Ki

13.1 Ki

13.4 Ki

15.5 Ki

10.4 Ki

8.6 Ki

10.3 Ki

8.3 Ki

6.6 Ki

6.8 Ki

7.8 Ki

Constants

(1)

Key

(1)

128 words

Default size, can be extended at the expense of the application program size.

Kinstructions

Kwords

256 words

512 words

256 words

TSX-PCX

57 203/

TSX 57

253/2623/

2823

64K

48K/64K

30.5K

26.6 Ki

33.9 Ki

22.6 Ki

21.1 Ki

25.2 Ki

20.2 Ki

16.4 Ki

16.8 Ki

19.4 Ki

TSX-PCX

57 203/

TSX 57

253/2623/

2823

128K

48K/64K

30.5K

56.5 Ki

71.6 Ki

47.8 Ki

46.9 Ki

56.0 Ki

44.9 Ki

36.6 Ki

37.5 Ki

43.3 Ki

256 words 512 words 512 words

TSX-PCX

57 203/

TSX 57

253/2623/

2823

35015365.01 07/2008

User memory

Note: z when this table indicates for a given characteristic two values separated by a

"/", they are respectively associated with each processor type (separated by a

"/" in the table header).

z the AP/Mem usage command of the PL7 program indicates the memory distribution of the application in the PLC memory.

35015365.01 07/2008

User memory

Characteristics of TSX/PCX 57 30/35/36 PL7 memories

Size of bit memory

This table describes the memory division of word objects in TSX 57 3•3,

TSX 57 3623, and PCX 57 353 PL7s.

TSX/PCX processor

Type

of objects system bits %Si input/output bits %I/Qx.i

internal bits %Mi (max. no.) step bits %Xi (max. no.)

Key

(1)

57 303/353/3623

128

(1)

16250

1024 depends on the hardware configuration declared (input/output modules, devices on AS-I bus)

35015365.01 07/2008

User memory

Size of the words memory

This table describes the memory division of word objects in TSX 57 3•3, TSX 57

3623, and PCX 57 353 PL7s.

Processor TSX 57

303/3623

TSX/

PCX 57 353

Cartridge internal RAM

Data (%MWi)

64K/80K 64K/80K

1K (1) 1K (1)

100% Boolean program

• LD language 28,8 Ki

• IL language 36,7 Ki

30,1 Ki

38,4 Ki

25,6 Ki • ST language 24,5 Ki

90% Boolean program

• LD language 22,6 Ki

• IL language

• ST language

27,1 Ki

21,7 Ki

65% Boolean program

23,8 Ki

28,4 Ki

22,7 Ki

TSX 57 303/

3623 / TSX/

PCX57 353

32K

80K/96K

30,5K

12,3 Ki

15,6 Ki

10,4 Ki

8,6 Ki

10,3 Ki

8,3 Ki

TSX 57 303/

3623 / TSX/

PCX57 353

64K

80K/96K

30,5K

26,6 Ki

33,9 Ki

22,6 Ki

21,1 Ki

25,2 Ki

20,2 Ki

TSX 57 303/

3623 / TSX/

PCX57 353

128K

80K/96K

30,5K

56,2 Ki

71,6 Ki

47,8 Ki

46,9 Ki

56,0 Ki

44,9 Ki

TSX 57 303/

3623 / TSX/

PCX57 353

TSX 57

303/3623 /

TSX/

PCX57 353

256K

80K/96K

30,5K

115,3 Ki

147,1 Ki

98,0 Ki

98,4 Ki

117,5 Ki

94,2 Ki

• LD language 17,4 Ki

• IL language 17,8 Ki

• ST language 20,5 Ki

256 K Constants (1)

Key

(1)

18,2 Ki

18,6 Ki

21,5 Ki

256 K

6,6 Ki

6,8 Ki

7,8 Ki

256 K

16,4 Ki

16,8 Ki

19,4 Ki

1024 K

36,6 Ki

37,5 Ki

43,3 Ki

1024 K

77,0 Ki

78,8 Ki

91,1 Ki

1024 K

Default size, can be extended at the expense of the application program size.

Kinstructions

Kwords

384K

80K/96K

30,5K

150,5 Ki

148,3 Ki

149,9 Ki

157,6 Ki

142,9 Ki

117,4 Ki

120,1 Ki

138,8 Ki

1024 K

Note: z when this table mentions as a characteristic 2 values separated by a "/", they are associated with each type of processor respectively (separated by a "/" in z the table heading).

the PL7 AP/memory usage command is used to find out about the application memory division in the PL7 memory.

35015365.01 07/2008

User memory

Characteristics of TSX 57 453/4823 PL7 memory

Size of bit memory

This table describes the memory division of word objects in TSX 57 453/4823 PL7s.

Processor TSX

Type

d’objets system bits %Si input/output bits %I/Qx.i

internal bits %Mi (max. no.) step bits %Xi (max. no.)

Key

(1)

57 453/4823

128

(1)

32634

1024 depends on the hardware configuration declared (input/output modules, devices on AS-I bus)

35015365.01 07/2008

User memory

Size of the words memory

The following table describes the memory division of word objects in TSX 57 453/

4823 PL7s.

Processor

Cartridge

TSX 57 453/4823

internal RAM 96K

Data (%MWi) 1K (1)

100% Boolean program

• LD language 37,5 Ki

32K

176K

30,5K

64K

176K

30,5K

128K

176K

30,5K

256K

176K

30,5K

384K (2) 512K (2) 2*480K

(2)

176K 176K 176K

30,5K 30,5K 30,5K

• IL language

• ST language

47,8 Ki

31,9 Ki

90% Boolean program

• LD language

• IL language

• ST language

30,2 Ki

36,0 Ki

28,9 Ki

12,3 Ki

15,6 Ki

10,4 Ki

8,6 Ki

10,3 Ki

8,3 Ki

26,6 Ki

33,9 Ki

22,6 Ki

21,1 Ki

25,2 Ki

20,2 Ki

56,2 Ki

71,6 Ki

47,8 Ki

46,9 Ki

56,0 Ki

44,9 Ki

115,3 Ki 150,5Ki 150,5 Ki 150,5 Ki

147,1 Ki 150,5 Ki 150,5 Ki 150,5 Ki

98,0 Ki 148,3 Ki 150,7 Ki 150,7 Ki

98,4 Ki 149,9 Ki 157,6 Ki 157,6 Ki

117,5 Ki 157,6 Ki 157,6 Ki 157,6 Ki

94,2 Ki 142,9 Ki 157,8 Ki 157,8 Ki

Key

(1)

(2)

65% Boolean program

• LD language

• IL language

• ST language

Constants (1)

23,2 Ki

23,7 Ki

6,6 Ki

6,8 Ki

16,4 Ki

16,8 Ki

27,4 Ki 7,8 Ki 19,4 Ki

256 words 256 words 1024 words

36,6 Ki

37,5 Ki

43,3 Ki

1024 words

Default size, can be extended at the expense of the application program size.

The programmation element number is reached.

Kinstructions

Kwords

77,0 Ki

78,8 Ki

91,1 Ki

1024 words

117,4 Ki

120,1 Ki

138,8 Ki

1024 words

157,8 Ki

161,3 Ki

171,3 Ki

1024 words

157,8 Ki

161,3 Ki

171,3 Ki

1024 words

Note: z when this table mentions as a characteristic 2 values separated by a "/", they are associated with each type of processor respectively (separated by a "/" in the table heading).

z The PL7 AP/memory usage command is used to find out about the application memory division in the PL7 memory.

35015365.01 07/2008

User memory

35015365.01 07/2008

Operating modes

Presentation

Aim of this

Chapter

What's in this

Chapter?

This chapter deals with the behavior of the user program on a warm restart and cold start.

This chapter contains the following topics:

Topic

Dealing with power cuts and power restoration

Dealing with a warm restart

Dealing with a cold start

Page

35015365.01 07/2008

Operating modes

Dealing with power cuts and power restoration

Illustration The illustration shows the various power restarts detected by the system. If the duration of the cut is less than the power supply filtering time (about 10 ms for an alternating current supply or 1 ms for a direct current supply), this is not noticed by the program which runs normally.

Application

RUN

Power failure

Standby power

Restoration of power

Power cut detected

Running the program normally

Yes

Saving

Context OK

Yes

Memory card

identical

Yes

Warm restart

Start up from cold

35015365.01 07/2008

Operation

Operating modes

The table below describes the processing phases for power cuts.

Phase

Description

In the event of a power cut the system stores the application context and the time of the cut.

It sets all outputs to fallback status (status defined in configuration).

When power is restored, the context saved is compared with the one in progress which defines the type of start to run: z if the application context has changed (loss of system context or new application), the PL7 initializes the application: start up from cold, z if the application context is the same, the PL7 restarts without initializing data: warm restart.

Supply failure on a rack other than rack 0

All the channels on this rack are seen as in error by the processor but the other racks are not affected. The values of the error inputs are no longer updated in the application memory and are set to 0 in the case of a discrete input module unless they have been forced in which case they are kept at the forcing value.

If the cut lasts less than 10 ms for alternating current supplies or up to 1 ms for a direct current supply, these are not noticed by the program which runs normally.

35015365.01 07/2008

Operating modes

Dealing with a warm restart

Cause of a warm restart

A warm restart can occur: z z z z when power is restored without loss of context, when the system bit %S1 is set to 1 by the program, from the PL7 by the terminal, by pressing the RESET button on the supply module on rack 0 (except on a station with a PCX 57 processor).

Illustration The drawing below describes a warm restart operation.

Acquisition of inputs

Running the Zero marker program.

Stopping the processor context saving application

Si %S1=1, possible process with warm restart

Restoration of power

Configuration self-test

Power cut detected

Bit %S1 set to 1

Bit %S1 set to 0

Updating outputs

35015365.01 07/2008

Operation

Operating modes

The table below describes the restart phases for running a program after a warm restart.

Phase

Description

The program starts up again from the element where the power cut took place, without updating the outputs.

At the end of the restart cycle the system: z z initializes message and event files sends configuration parameters to all discrete and application specific input/ output modules, z deactivates the fast task and event processes (until the end of the first master task cycle).

The system carries out a restart cycle in which it: z z z z takes into account again all the input modules, relaunches the master task with the bits %S1 (warm restart) set to 1, resets bit %S1 to 0 at the end of this first master task cycle, reactivates the fast task and event processes at the end of this first master task cycle.

General note on warm restarts

Note: when a warm restart is triggered, either by setting the system bit %S1 to 1, or by the warm restart button of the PLC debug screen, the system bit %S1 remains at 1 during 2 PLC cycles.

Warm restart processes per program

Developing outputs

In the event of a warm restart, if you require a particular application process, you have to write the corresponding program by testing %S1 at 1 at the beginning of the master task program.

As soon as a power failure is detected the outputs are set to fallback position: z z

either they take the fallback value,

or they keep the current value,

depending on the choice made at configuration.

When power is restored, outputs are at zero until they are updated again by the task.

35015365.01 07/2008

Operating modes

Dealing with a cold start

Cause of a cold start

The following table describes the different possible causes for a cold start.

Causes

Loading an application

Characteristics of the start

Cold start forced to STOP

Pressing the processor RESET button

Pressing the processor RESET button after a blocking fault

Cold start forced to STOP or RUN according to the definition at configuration

Cold start forced to STOP

Manipulating the prehensile or inserting/ extracting a PCMCIA memory card

Initializing from a Junior or Pro PL7

Forcing the system bit %S0

Restart after a power failure with loss of context

Cold start forced to STOP or RUN according to the definition at configuration

Cold start forced to STOP or RUN according to the definition at configuration, without initializing the discrete and application specific input/output modules.

Cold start forced to STOP or RUN according to the definition at configuration

35015365.01 07/2008

Illustration

Operating modes

The drawing below describes a cold restart operation.

Acquisition of inputs

Running the Zero marker program.

Stopping the processor context saving application

Si %S0=1, possible process for cold start up

Restoration of power

Configuration self-test

Yes

Micro power> cut

BOT

Bit %S0 set to 0

Initializing the application

Bit %S0 set to 1

Updating outputs

35015365.01 07/2008

Operating modes

Operation The table below describes the restart phases for running a program after a cold restart.

Phase

Description

Start up is in RUN or in STOP depending on the parameter Automatic start up in RUN defined at configuration or if this is used according to the status of the RUN/STOP input.

The program run restarts at the beginning of the cycle.

z z z z z z z z

The system: z resets bits, the I/O map and internal words to zero (if the %MW reset to zero option on restart from cold is checked in the processor Configuration screen).

If the %MW reset is not active and if internal words %MWi are saved in the internal EPROM Flash memory (TSX 37), these are restored in the event of a cold start.

initializes system bits and words.

initializes function blocks from configuration data.

deactivates tasks, other than the master task, up till the end of the first master task cycle.

sets Grafcet to initial steps.

cancels forcings.

initializes data declared in the DFBs: either to 0 or to the initial value declared in the code, i.e. with the saved value from the SAVE function initializes message and event files sends configuration parameters to all discrete and application specific input/ output modules,

For this first restart cycle the system: z relaunches the master task with bit %S0 (cold restart) set to 1, the word z

%SW10 (detecting cold restart on the first revolution of a task) is set to 0, resets bit %S0 to 0 and resets to 1 each word bit %SW10 to the end of this first master task cycle, z activates the fast task and event processes at the end of this first master task cycle.

Dealing with cold start for each program

To carry out an application process after the PL7 has started from cold, it is possible to test the bit %SW10:X0 per program (if %SW10:X0=0, there is a cold restart).

Note on Cold starts

When a cold start is made, either by %S0 set to 1, or by the cold start button on the

PLC screen, system bit %S13 cannot be set to 1 and the PLC remains in use. The main effect is initialization of the application variables.

35015365.01 07/2008

Developing outputs

Operating modes

As soon as a power failure is detected the outputs are set to fallback position: z z

either they take the fallback value,

or they keep the current value,

depending on the choice made at configuration.

When power is restored, outputs are at zero until they are updated again by the task.

35015365.01 07/2008

Operating modes

35015365.01 07/2008

Software structure

Presentation

Introduction

What's in this

Chapter?

This chapter describes the tasks and how they run in the PL7.

This chapter contains the following sections:

Section

5.1

5.2

5.3

5.4

Topic

Description of tasks

Mono task structure

Multi task structure

Function modules

Page

103

110

35015365.01 07/2008

Software structure

5.1 Description of tasks

Presentation

Introduction to this section

What's in this

Section?

This section describes the role and content of each of the tasks that can make up a

PL7 program.

This section contains the following topics:

Topic

Presenting the master task

Description of sections and subroutines

Presenting the fast task

Presenting event processing

Page

35015365.01 07/2008

Software structure

Presenting the master task

General points

Illustration

The master task represents the main program. It is compulsory whatever the monotask or multitask structure adopted.

The master task program (MAST) is made up of several program modules called sections (see

Description of sections and subroutines, p. 88 ), and subroutines.

How the master task is run can be chosen (in configuration). It can be cyclical (see

Cyclic run, p. 97

) or periodic (see

Periodic run, p. 99 ).

The following illustration shows an example of a master task made up of 4 sections and 3 subroutines.

Sections

Sas (LD)

Oven_1 (Grafcet)

PRL (LD)

CHART

POST (IL)

Drying (LD)

Cleaning (ST)

Subroutines

SR0

35015365.01 07/2008

Software structure

Description of sections and subroutines

Presenting the sections

Presenting subroutines

The sections are autonomous programming entities. Instruction line and contact network location labels … belong to the section (no program jump possible to another section).

They are programmed either in: z z z z ladder language, instruction list language, structured text language,

Grafcet.

Sections are run in programming order tin the browser window (structure view).

Sections are linked to a task. One section cannot belong to several tasks at the same time.

Subroutine modules are also programmed as separate entities either in: z z z ladder language, instruction list language, structured text language,

Calling up subroutines is done in the sections or from another subroutine (a maximum of 8 overlay levels).

Subroutines are also linked to a task. One subroutine cannot be called up by several tasks.

35015365.01 07/2008

Example

Software structure

The following drawing gives an example of the structure of a task in sections and subroutines.

Mast

Sections

Sas

Oven_1

Prl

Chart

Post

Drying

Cleaning

SR0

SR1

SR2

35015365.01 07/2008

Software structure

Characteristics of a section

The following table describes the characteristics of a section.

Characteristic

Name

Language

Task

Condition

(optional)

Description

24 characters maximum

Ladder, instruction list , structured text or Grafcet language

Master or fast

Objects allowed as a condition: z z z

%M,%S,%X indexed bits, bits extracted from words

%I , %Q

All these objects can be forced from the terminal except for %S bits, indexed bits, extracted bits, %Ixy.i.ERR,and %I xy.MOD.ERR.

Comments

Protection

The condition must be status 1 for the section to be run.

250 characters maximum.

Write protection, read/write protection. Protection can be global or partial.

Note: on a cold start run conditions are at 0. All sections associated with a condition are disabled.

Grafcet section The following table describes program elements for a Grafcet section.

Processing

Preliminary

Grafcet

Subsequent

Name

PRL

CHART

POST

Characteristics

Programmed in ladder language LD, instruction list language IL or structured text language ST. It is run before Grafcet.

Transition conditions associated with transitions and actions associated with steps or macro step steps are programmed in the Grafcet pages.

Programmed in ladder language LD, instruction list language IL or structured text language ST. It is run after

Grafcet.

35015365.01 07/2008

Software structure

Characteristics of a subroutine

The following table describes the characteristics of an Sri subroutine.

Characteristic

Number

Language

Task

Comments

Description

0 à 253

Ladder, instruction list , structured text

Master or fast

250 characters maximum.

35015365.01 07/2008

Software structure

Presenting the fast task

General points This task which has a higher priority than the master task MAST is periodic so that tasks that have a lower priority have time to run.

Also, processes associated with it must therefore be short in order not to hinder the master task. As with the master task, the associated program is made up of sections and subroutines.

Fast task period The fast task period FAST is set at configuration from 1 - 255 ms. This may be defined as greater than the master task MAST so that it can be adapted for slow but priority periodic processes.

The program run, however, must remain short to avoid exceeding tasks with lower priority.

The fast task is checked by a watch dog which is used to detect an abnormal period in the application program. In the case of overflow, system bit %S11 is set at 1 and the application is declared as having a PL7 blocking fault.

Fast task check The system word %SW1 contains the period value. It is initialized when starting from cold by the value set in the configuration. It can be modified by the user by the program or the terminal.

System bits and words, are used to check the running of this task: z z

%S19: indicates that the period has been exceeded. It is set to 1 by the system when the cycle time is greater that the task period.

%S31: is used to confirm or disable the fast task. It is set to 0 by the system when the application is on cold start, at the end of the first master task cycle. It is set to

1 or 0 to confirm or disable the fast task.

Displaying fast task running time

The following system words are used for information on the cycle time: z z z

%SW33 contains the running time for the last cycle.

%SW34 contains the running time for the longest cycle,

%SW35 contains the running time for the shortest cycle.

35015365.01 07/2008

Software structure

Presenting event processing

General points Event processes are used to reduce the software reaction time for command events coming from certain application specific modules.

These processes take priority over any other task. They are therefore suitable for processes which require very short reaction times in relation to the arrival of the event.

The number of event processes that can be programmed depends on the type of processor.

PL7 type

Micro TSX 37-05/08/10

Micro TSX 37-21/22

Premium TSX/PCX 57-1•

Premium TSX/PCX 57-2•/3•/4•

Number of processes

Name

EVT1 - EVT8

EVT0 - EVT15

EVT0 - EVT31

EVT0 - EVT63

Operation

Command events

The appearance of an event diverts the application program to the process that is associated with the input/output channel which has caused the event.

Inputs (%I, %IW, %ID) associated with the I/O channel which triggered the event are updated by the system before calling up the event process.

Association between a channel and an event number is made in the channel configuration screen.

These are external events linked to application specific functions.

On Micro PL7s event processes can be triggered by: z z z z inputs 0 - 3 of position 1 module, on rising or falling edge, the counting module counting channel(s), module 1 counting channels (if this is configured in the counter), receiving telegrams in a TSX 37-21/22 equipped with a TSX FPP20 module.

On Premium PL7s event processes can be triggered by: z z z z z z inputs from modules DEY 16 FK, DMY 28 FK, DMY 28 RFK counting module channels, channels for axis command modules TSX CAY •, channels for step by step command modules TSX CFY •,

"FPP20" communication channels,

...

35015365.01 07/2008

Software structure

Managing event processes

Event processes can be confirmed or disabled globally by the application program using system bit %S38.

If one or more events occur while they are disabled, the associated processes are lost.

Two PL7 language instructions, MASKEVT() and UNMASKEVT() , used in the application program are also used to mask or unmask event processes.

If one or more events occur while they are masked, they are stored by the system and the associated processes will only be carried out when they have been unmasked.

Process priority Micro TSX 37-05/08/10 PL7s

The 8 possible command events all have the same priority level, therefore, one event process cannot be interrupted by another.

Micro TSX 37-21/22 or Premium PL7s

There are 2 priority levels for command events: event 0 (EVT0) has a higher priority than the other events.

35015365.01 07/2008

5.2 Mono task structure

Presentation

Introduction to this section

What's in this

Section?

This section describes how a mono task application runs.

This section contains the following topics:

Topic

Mono task software structure

Cyclic run

Periodic run

Checking cycle time

Software structure

Page

102

35015365.01 07/2008

Software structure

Mono task software structure

Description The mono task application program is associated with a single user task, the master task MAST (see

Presenting the master task, p. 87

The program associated with the master task (MAST) is made up of several sections and subroutines.

Running the master task can be selected (at configuration) as z z cyclic (see

Cyclic run, p. 97 )

or periodic (see

Periodic run, p. 99 )

35015365.01 07/2008

Software structure

Cyclic run

Description

Operation

This type of operation corresponds to a normal PL7 cycle run (default selection).

It consists of linking master task cycles (MAST) one after the other.

After updating the outputs, the system carries out the appropriate processes then links another task cycle.

The following drawing shows the running phases of the PL7 cycle.

I.P.

Processing the program

%Q I.P.

Processing the program

Cycle n Cycle n+1

Description of the various phases

The table below describes the operating phases.

Address Phase

I.P.

Internal processing

Acquisition of inputs

Program processing

Updating outputs

Description

The system implicitly monitors the PL7 (managing system bits and words, updating current timer values, updating status lights, detecting RUN/STOP switches,…) and processes requests from the terminal (modifications and animation).

In the case of the Premium PL7 internal processing is done in parallel with input and output processes.

Writing to the memory the status of information on discrete and application specific module inputs associated with the task,

Running the application program written by the user,

Writing output bits or words associated with discrete and application specific modules associated with the task according to the status defined by the application program.

35015365.01 07/2008

Software structure

Operating mode PL7 in RUN, the processor carries out the internal processing order, acquiring inputs, processing the application program and updating outputs.

PL7 in STOP, the processor carries out: z z z internal processing, acquisition of inputs, and depending on the selected configuration: z z fallback mode: outputs are set to "fallback", maintenance mode: outputs are maintained at their last value.

Illustration The following illustration shows the operating cycles.

Internal processing

Acquisition of inputs

RUN

Program processing

STOP

Updating outputs

Check cycle The check cycle is carried out by watch dog (see

Checking cycle time, p. 102 ).

35015365.01 07/2008

Software structure

Periodic run

Description

Operation

In this operating mode, acquiring inputs, processing the application program and updating outputs are done periodically according to the time defined at configuration

(from 1 - 255 ms).

At the beginning of the PL7 cycle, a timer, the value of which is initialized at the period defined at configuration, starts to count down.

The PL7 cycle must end before the timer has finished and relaunches a new cycle.

The following drawing shows the running phases of the PL7 cycle.

Processing the program

I.P.

%I %Q I.P. I.P. %I %Q I.P.

Cycle n Cycle n+1

Description of the various phases

The table below describes the operating phases.

Address Phase

I.P.

Internal processing

Acquisition of input

Program processing

Updating outputs

Description

The system implicitly monitors the PL7 (managing system bits and words, updating current timer values, updating status lights, detecting RUN/STOP switches, …) and processes requests from the terminal (modifications and animation)

In the case of the Premium PL7 internal processing is done in parallel with input and output processes.

Writing to the memory the status of information on discrete and application specific module inputs associated with the task,

Running the application program written by the user,

Writing output bits or words associated with discrete and application specific modules associated with the task according to the status defined by the application program.

35015365.01 07/2008

Software structure

Operating mode PL7 in RUN, the processor carries out the internal processing order, acquiring inputs, processing the application program and updating outputs. z z

If the period has not yet finished, the processor completes it operating cycle until the end of the internal processing period.

If the operating time is longer than that allocated to the period, the PL7 indicates that the period has been exceeded by setting the task system bit %S19 to 1. The process continues and is run completely (however, it must not exceed the watch dog time limit). The following cycle is linked in after writing the outputs of the cycle in progress implicitly.

PL7 in STOP, the processor carries out: z z z internal processing, acquisition of inputs, and depending on the selected configuration: z fallback mode: outputs are set to "fallback", z maintenance mode: outputs are maintained at their last value.

100

35015365.01 07/2008

Illustration The following illustration shows the operating cycles.

Starting the period

Internal processing

Acquisition of inputs

RUN

Program processing

STOP

Updating outputs

Internal processing

End of period

Check cycle Two checks are carried out : z z period overflow (see

Checking cycle time, p. 102 ),

par watch dog (see

Checking cycle time, p. 102

Software structure

35015365.01 07/2008

101

Software structure

Checking cycle time

General points The duration of the master task operation when running cyclically or periodically, is controlled by the PL7 (watch dog) and must not exceed the value set out in the

T max configuration (250ms default, 500ms maximum).

Software watch dog (periodic or cyclic operation).

If this is exceeded, an error is declared in the application which causes the PL7 to stop immediately: z z on the Micro setting the %Q2.0 alarm output to 0 if it has been configured, on the Premium , setting the power supply alarm relay to 0

The bit %S11 is used to check the running of this task. It indicates that the watch dog has been exceeded. It is set to 1 by the system when the cycle time is greater than the watch dog.

Note: on the Premium the watch dog value must be greater than the period.

Check on periodic operation

In periodic operation an additional check is used to detect the period being exceeded: z z

%S19: indicates that the period has been exceeded. It is set to 1 by the system when the cycle time is greater that the task period.

%SW0 : this word contains the period value (in ms). It is initialized when starting from cold by the value set in the configuration. It can be modified by the user.

Using master task running time

The following system words are used for information on the cycle time: z z z

%SW30 contains the running time for the last cycle.

%SW31 contains the running time for the longest cycle,

%SW32 contains the running time for the shortest cycle.

Note: this different information can also be accessed from the configuration editor explicitly.

102

35015365.01 07/2008

5.3 Multi task structure

Presentation

Introduction to this section

What's in this

Section?

This section describes how a multi task application runs.

This section contains the following topics:

Topic

Multitask software structure

Sequencing tasks in a multitask structure

Assigning input/output channels to master and fast tasks

Exchanging inputs/outputs in event processes

Software structure

Page

35015365.01 07/2008

103

Software structure

Multitask software structure

Description Task structure for such an application is as follows:

Task

Master

Fast

Event

Name

MAST

FAST

EVTi

Description

Always present which can be cyclic or periodic.

Optional which is always periodic.

Called up by the system when an event appears on an input/output data module.

These processes are optional and are used for applications which need short response times to act on inputs/outputs.

Illustration The following drawing shows multitask structure tasks and their priority level.

Master task Fast task Event processes

Priority

104

35015365.01 07/2008

Example

Software structure

The following example shows a multitask structure made up of a master task MAST, a fast task FAST and 2 event processes EVTO and EVTI.

MAST FAST

Sas (LD) Alarm_Sas (LD)

EVT0

Oven_1 (Grafcet)

Monitor_drying (LD)

Alarm_Oven (ST)

PRL (LD)

Alarm_Cleaning (ST)

CHART

POST (IL)

SR0

Drying (LD)

SR0

Cleaning (ST)

35015365.01 07/2008

105

Software structure

Sequencing tasks in a multitask structure

General points

Operation

The master task default is active.

The fast task default is active if it is programmed.

The event process is activated when the event associated with it occurs.

The following table describes running priority tasks.

Phase

Description

Arrival of an event or beginning of the fast task cycle.

Stopping the running of tasks in progress that have a lower priority,

Running the priority task.

The interrupted task takes over again when the priority task processes have finished.

Description of sequencing tasks

Checking tasks

The following drawing illustrates task sequencing for a multitask process including a cyclical master task, a fast 20ms task and an event process.

E v e n t

F a s t

E T S E T S E T S E

T S E T S

E T T S E T T S E T Ma s t e r

Sy s t e m

2 0 m s 2 0 m s 2 0 m s 2 0 m s

Key:

E: Acquisition of inputs

T: program processing

S: updating outputs

Running fast and event tasks can be checked by the program by using system bits: z z z

%S30 is used to activate or not the master task MAST.

%S31 is used to activate or not the fast task FAST.

%S38 is used to activate or not event tasks EVTi.

106

35015365.01 07/2008

Software structure

Assigning input/output channels to master and fast tasks

General points

Discrete modules

Counting modules

Analogue modules

As well as the application program master MAST and fast FAST tasks run system functions linked to managing implicit inputs/outputs associated with them.

Associating a channel or group of channels to a task is defined in the configuration screen of the corresponding data module, the associated default task being the

MAST task.

As the modularity of discrete modules is 8 successive channels (channels 0 - 7, channels 8 - 15,…), inputs/outputs can be assigned by groups of 8 channels either to the MAST task or the FAST task.

Example: it is possible to assign channels of a 28 input/output module in the following way: z z z z inputs 0 - 7 assigned to the MAST task, inputs 8 -15 assigned to the FAST task, outputs 0 - 7 assigned to the MAST task, outputs 8 - 15 assigned to the FAST task.

Each counting module channel can be assigned either to the MAST task or the

FAST task.

Example: for a 2 channel counting module it is possible to assign : z z channel 0 to the MAST task, channel 1 to the FAST task.

Micro analogue input module channels must be assigned to the MAST task. On the other hand it is possible to assign analogue output channels or groups of channels either to the MAST task or the FAST task with a 2 channel modularity.

Example : for a 4 analogue output module it is possible to assign: z z channels 0 and 1 to the MAST task and, channels 2 and 3 to the FAST task.

The Premium analogue input and output module channels can be assigned to the

MAST task or the FAST task. This assigning is individual for each of the isolated analogue input or output module channels (4 isolated channels) and with a modularity of 4 channels for the other modules.

Note: in order to achieve the best performance, it is preferable to regroup the channels of a module into the same task.

35015365.01 07/2008

107

Software structure

Exchanging inputs/outputs in event processes

General points

Operation

It is possible to use input/output channels other than those relating to the event for each process.

Exchanges are then made implicitly by the system before (%I) and after (%Q) in the process to be applied.

These exchanges can be related to a channel (e.g. counting module) or to a group of channels (discrete module). In the second case, if, for example, the process modifies outputs 2 and 3 of a discrete module, the map of outputs 0 - 7 will be transferred to the module.

The following table describes the exchanges and processes carried out.

Phase

Description

The appearance of an event diverts the application program to the process that is associated with the input/output channel which has caused the event.

All the inputs associated with the channel that has caused the event are acquired automatically.

All the inputs used by the user in the EVTi process are acquired.

The event process is carried out. It must be as short as possible.

All the outputs used by the user in the EVTi process are updated. The outputs associated with the channel that caused the event must also be used, so that they are updated.

Programming rules

General rule:

The inputs exchanged (and the associated group of channels) when the event process is carried out are updated again (loss of historic values and therefore edges). You must therefore avoid testing edges on these inputs in master tasks

(MAST) or fast tasks (FAST).

In the case of modules TOR TSX DEY16FK, TSX DMY28FK or TSX DMY28RFK :

The input which triggered the event must not be tested in the event process (the value is not updated).

Testing the edge which triggered the event must be done on the status word: z z

%IWxy.i:X0 = 1 --> rising edge,

%IWxy.i:X0 = 1 --> rising edge.

108

35015365.01 07/2008

Performance

Software structure

On Micro PL7s : z z analogue input modules which can only be used in the MAST task must not be exchanged in an event process.

for each event process, it is possible to declare at the most the exchanges for 2 input modules (before the event process) and 2 output modules (after the event process).

On Premium PL7s, according to the processor used, the number of exchanges used is limited:

P57-2• /3• /4• Number of exchanges that can be used in event processes by processor

P57-1•

Discrete inputs/outputs

Analogue inputs/outputs

Other application specific

32 exchanges

8 exchanges

4 exchanges

128 exchanges

16 exchanges

For discrete inputs/outputs an exchange involves a group of 8 channels. It is generated when using inputs from a group of 8 channels (other than the group of channels that generated the event) and when writing the output for a group of 8 channels.

For analogue inputs/outputs or another application specific, an exchange is generated when using the inputs from one channel (other than the channel which generated the event and when writing from channel outputs).

Note: z as input/output exchanges in the EVTi task are done by channel (for some analogue and application specific modules) or by group of channels (for discrete z modules and some analogue modules), if the process modifies outputs 2 and 3 of a discrete module for example, the map (automatic memory) of outputs 0 - 7 will be transferred to the module.

any exchange of an input/output in an event task can cause the loss of edge information with regard to the process carried out on this channel (or group of channels), in the task where it was declared. MAST or FAST

Displaying the number of events processed

The system word %SW48 gives the number of events processed.

This word is initialized at 0 on starting from cold, then incremented by the system when an event is launched.

This word can be modified by the user.

The system bit %S39 indicates the loss of an event.

35015365.01 07/2008

109

Software structure

5.4 Function modules

Structuring in Function Modules

General Points

Structure

Illustration

A function module is a group of program elements used to carry out a control function.

A function module is defined by the following attributes: z z z short name: 8 characters (e.g.: TR371) long name: 16 characters (e.g.: Continue/Withdraw for BT371) a descriptive form (with no limit to the number of characters) not stored in the PLC but stored in the .STX file of the application.

The illustration below shows how a function module is made up:

Prod1

Program

Animation tables

Operating screens

110

35015365.01 07/2008

Software structure

Description of

Function Module

Elements

The table describes the role of each of the elements:

Element

Program

Composition

One or more code modules: z z z z z sections events macro steps animation tables

...

One or more animation tables.

Animation tables

Mdm1 Lower level function modules. These modules take on one or more automatic system sub functions in relation to the main function.

Limitations of

Use

Only the PL7 PRO can be used to set up function modules on Premium PLCs.

35015365.01 07/2008

111

Software structure

112

35015365.01 07/2008

Description of PL7 languages

Presentation

What's in this spacer

What's in this

Part?

This spacer describes the programming languages for Micro and Premium PL7s.

This part contains the following chapters:

Chapter

Chapter Name

Contact language

Instruction list language

Structured text language

Grafcet

DFB function blocks

Page

113

35015365.01 07/2008

PL7 languages

114

35015365.01 07/2008

Contact language

Presentation

Aim of this

Chapter

What's in this

Chapter?

This chapter describes programming in contact language.

This chapter contains the following topics:

Topic

General presentation of contact language

Structure of a contact network

Contact network label

Contact network comments

Contact language graphic elements

Rules for programming a contact network

Rules for programming function blocks

Rules for programming operation blocks

Running a contact network

Page

35015365.01 07/2008

115

Contact language

General presentation of contact language

General points A section of program written in contact language is made up of a suite of network contacts run one after the other by the PL7.

A contact network diagram is similar to an electrical circuit diagram.

Illustration of a contact network

The following screen shows a PL7 contact network.

1 2 3

LD : MAST - CHART

%L100

(*Awaiting drying*)

%I1.0

%M12 %I1.7

%MT4.Q %M17

%I1.10

%Q2.3

%M27 %MT0

IN MT Q

SOUND MODE

TB: 1 mn

TMP: 9999

MODIF: Y

%M2 %MW0.X

OPERATE

%MW15:=%MW18+500

%M2 %I1.4

%Q2.5

SR2

F2 F3

F5 F6 F7

F8 F9 F10 F11

F12

S.F1

S.F2

OPER

S.F3

COHP

S.F4

COHP

S.F5

S.F6

S.F7

F (...)

S.F8

Composition of a contact network

This table describes how a contact network is made up.

Address Element

1 Label

Comments

Graphic elements

Function

Contact network address (optional):

Gives information on a network address (optional): z z z

They represent: z the PL7 inputs and outputs (push buttons, detectors, relays, indicators..) automatic system functions (timers, counters…,), arithmetic, logic and specific operations, the PL7 internal variables.

116

35015365.01 07/2008

Contact language

Structure of a contact network

Introduction

Illustration

A network is entered between two potential bars. The current goes from the left potential bar to the right potential bar.

The drawing below describes the structure of a contact network.

1 2 3 4 5 6 7 8 9 10 11

Potential bar

Action zone

Test zone

Description of a contact network

A contact network is made up of a group of graphic elements placed on a grid of: z z

16 lines maximum and 11 columns (for Premium PL7s),

7 lines maximum and 11 columns (for Micro PL7s),

It is divided into two areas: z z the test area, in which the necessary conditions for an action appear the action area which applies the consequent result to a test link.

35015365.01 07/2008

117

Contact language

Contact network label

General points

Syntax

Illustration

The label is used to locate a network in a program entity (main program, subprogram,…). It is optional.

This label has the following syntax: %Li with i between 0 - 999.

It is in the top left section in front of the potential bar.

The following contact networks illustrate how a label is used.

%M20

%L245

Rules

Label

%L245

%Q2.3

%M155

A label address can only be allocated to a single network within the same program entity.

It is necessary to label a network in order to allow a connection after a program jump

(see illustration below).

The order of label addresses does not matter, (it is the order of entering the networks that is taken into account by the system when scanning).

118

35015365.01 07/2008

Contact language

Contact network comments

General points

Syntax

Illustration

The comments are used to interpret the network to which they are assigned, but they are not obligatory.

The comments are integrated into the network and are made up of a maximum of

222 alphanumeric characters, on either side of which are the characters (* and *).

The drawing below shows the position of the comments.

Comments field

Rules The comments are displayed in the reserved field in the upper part of the contact network.

If a network is deleted, the comments with it are also deleted.

The comments are stored in the PL7 and can be accessed by the user at any time.

In this case they take up program memory.

35015365.01 07/2008

119

Contact language

Contact language graphic elements

General points

Contacts

Graphic elements are the contact language instructions.

The contacts graphic elements are programmed in the test area and take up one cell

(1 line high and 1 column wide).

Name

Normally open contact

Computer art Functions

Passing contact when the bit object which controls it is at state 1.

Normally closed contact

Contact for detecting a rising edge

Contact for detecting a falling edge

Passing contact when the bit object which controls it is at state 0.

Rising edge: detecting the change from 0 to 1 of a bit object which controls it.

Falling edge: detecting the change from 1 to 0 of a bit object which controls it.

Link elements The graphic link elements are used to connect the test and action graphic elements.

Name

Horizontal connection

Computer art Functions is used to link in series the test and action graphic elements between the two potential bars.

Potential vertical connection

Short circuit by pass is used to link the test and action graphic elements in parallel.

is used to link 2 objects through several connections.

120

35015365.01 07/2008

Coils

Contact language

The coil graphic elements are programmed in the test area and take up one cell (1 line high and 1 column wide).

Name

Direct coil

Computer art Functions

The associated bit object takes the value of the test field result.

Negated coil

Set coil

The associated bit object takes the negated value of the test field result.

The associated bit object is set to 1 when the result of the test field is 1.

Reset coil The associated bit object is set to 0 when the result of the test field is 1.

Conditional jump to another network

(JUMP)

Transition condition coil

Coil calling up a sub-program

(CALL)

Return of the sub-program

->>%Li

<RETURN> is used to connect to a labeled network, upstream or downstream.

Jumps are only made within the same programming entity z z

(main program, sub-program,…). Making a jump causes: z scanning of a network in progress to stop, running of the required labeled network, the part of the program between the jump action and the designated network not to be scanned.

provided in Grafcet language, used when the programming of the transition conditions associated with the transitions causes a changeover to the next step.

is used to connect at the start of a sub-program when the result of the sub-program test field is at 1.

z z z

Calling up a sub-program means that: scanning of the network in progress stops, the sub-program runs, the scanning of the network that was interrupted resumes.

Reserved for SR sub-program and allows the calling module to return when the result of the test field is at 1.

Stop program stops the program running when the result of the test field is at 1.

<HALT>

35015365.01 07/2008

121

Contact language

Standard function blocks

The graphic elements of DFB function blocks are programmed in the test field and take up a maximum of 16 lines in height and 3 columns wide.

Name

Timer blocks, counter, monostable, register, cyclical programmer

Computer art Functions

Each of the standard function blocks uses inputs, outputs, inputs/outputs which enable links to the other graphic elements.

DFB function blocks

The graphic elements of DFB function blocks are programmed in the test field and take up a maximum of 16 lines in height and 3 columns wide.

Name

Programmable blocks

Computer art Functions

Each of the DFB function blocks uses inputs, outputs, inputs/outputs which enable links to other graphic elements for bit objects or which can be assigned to numeric or table objects

Operation blocks Operation block graphic elements are programmed in the test field and take up the space mentioned below.

Name

Vertical comparison block

Computer art Functions is used to compare 2 operands, according to the result the corresponding output changes to 1.

Size: 2 columns/ 4 lines

Horizontal comparison block

Operation block is used to compare 2 operands, the output changes to 1 when the result is checked (one block can contain up to 4096 characters).

Size: 2 columns/ 1 line carries out the arithmetic and logic operations…calls up the structured text language syntax.

(One block can contain up to 4096 characters).

Size: 4 columns/ 1 line

122

35015365.01 07/2008

Contact language

Rules for programming a contact network

General points

Programming rules

Programming a network contact is done using graphic elements, observing the following programming rules.

Single test and action graphic elements each take up one cell within a network.

Each contact line begins on the left potential line and must finish on the right potential line.

Tests are always in columns 1 - 10.

Actions are always in column 11.

The direction of the current is as follows: z z for horizontal links from left to right , for vertical links, in both directions.

Example of a contact network

The following screen shows an example of a contact network.

35015365.01 07/2008

123

Contact language

Rules for programming function blocks

General points

Rules for programming function blocks

Standard function blocks are found in the test field of the contact networks.

Whatever type of function block used, it must be linked at the input to the left potential bar, directly or through other graphic elements.

z z outputs "in the air": it is not necessary to link function block outputs to other graphic elements, outputs that can be tested: function block outputs can be accessed by the user in the form of a bit object.

Internal block variables and graphic outputs are objects that can be used remotely from another part of the program.

Non hardwired standard function block inputs are set to 0.

Just as with the contact type graphic elements, it is possible to have combinations of function blocks.

Example of a contact network

The following illustration shows an example of a contact network containing 2 function blocks.

124

35015365.01 07/2008

Contact language

Rules for programming operation blocks

General points Comparison blocks are in the test field and operation blocks are in the action field.

Rules for programming operation blocks

Whatever type of operation block used, it must be linked at the input to the left potential bar, directly or through other graphic elements.

Just as with the contact type graphic elements, it is possible to have combinations of function and operation blocks.

Example of operation blocks

The following illustration shows an example of a contact network containing 2 comparison blocks and one operation block.

%I3.6

%MW1>100

%I1.2

%MW2>500

%MT10

IN Q

TYP:TP

TB:100ms

TM.P:200

MODIF:Y

%TM2.P:=3450

%Q6.3

35015365.01 07/2008

125

Contact language

Running a contact network

Rung

Illustration of rungs

A rung contains graphic elements which are all linked to each other by link elements

(except potential bar), but independent of the other network graphic elements (no vertical links to the top or bottom within the rung).

The following contact network is made up of 3 rungs.

Rung 2

Rung 1

Rung 3

Rules for running rungs

The first rung evaluated is the one with the left corner in the top left.

A rung is evaluated in the direction of the equation: evaluating the network from top to bottom, line by line and each line from left to right.

When a vertical convergence line is encountered, the sub network associated with it is evaluated (according to the same logic) before continuing evaluating the network surrounding it.

126

35015365.01 07/2008

Running elements in a rung

Example 1: illustration

Contact language

The following table describes the running order for elements in a rung.

Phase

Description

The system evaluates the logic state of each contact according to: z z the current value of application internal objects, the state of input/output module entries from the beginning of the cycle

The system runs the processes associated with the functions, block functions and sub programs,

The system updates the bit objects associated with the coils (updating the input/ output module outputs is done at the end of the cycle),

The system disconnects and goes to another labeled network on the same program module (jump to another %Li ->>network), goes back to a calling module <RETURN>, or program stop<HALT>,

The following drawing displays the running order for graphic elements.

Example 1: operation

The following table describes the running of graphic elements in the network illustrated above.

Phase

Description

Evaluating the network up to the first vertical convergence link: contacts A, B, C.

Evaluating the first sub network: contact D,

Continuing the evaluation of the network up to the second vertical convergence line: contact E,

Evaluating the 2nd sub network: contacts F and G,

Evaluating coil H.

35015365.01 07/2008

127

Contact language

Example 2: illustration

The following drawing displays the running order for graphic elements.

Example 2: operation

The following table describes the running of graphic elements in the network illustrated above.

Phase

Description coil 1: INIT, %M5, %M7, %Q2.1, coil 2: %M4, %MW2:X1,AUTO, UP_1,

Operation block

128

35015365.01 07/2008

Instruction list language

Presentation

Aim of this

Chapter

What's in this

Chapter?

This chapter describes the rules for programming in instruction list language.

This chapter contains the following topics:

Topic

General presentation of instruction list language

Structure for an instruction list program

Label for a sequence in instruction list language

Comments on a sequence in instruction list language

Presenting instructions in instruction list language

Rule for using parentheses in instruction list language

Description of the MPS, MRD and MPP instructions

Principles of programming pre-defined function blocks

Rules for running an instruction list program

Page

35015365.01 07/2008

129

Instruction list language

General presentation of instruction list language

General points

Illustration of a program

A section written in instruction list language is made up of a suite of instructions run in sequence by the PL7.

The following illustration shows a PL7 instruction list program and an instruction detail.

!%L0:

!%L2:

ANDN

OR(

AND

)

AND

%I1.0

%M12

%TM4.Q

%M17

%I3.7

%Q2.5

%I3.5

Code instruction

%I1.0

Operand

Composing an instruction

This tables describes what an instruction is made up of.

Element

Instruction code

Opérand

Function

The instruction code determines the operation to be run. There are 2 types of instruction code: z test , in which the necessary conditions for an action appear (e.g.:

AND , OR ...),

LD , z action , which applies the consequent result to a test link. (e.g.:

STN , R , ...).

ST ,

An instruction acts on an operand. This operand can be: z z z z a PL7 input/output (push buttons, detectors, relays, indicators...), automatic system functions (timers, counters…), an arithmetic logic operation or a transfer operation, a PL7 internal variable.

130

35015365.01 07/2008

Instruction list language

Structure for an instruction list program

General points

Example of a sequence

Just as with contact language, instructions are organized in instruction sequence

(equivalent to a contact network) called a sequence.

The following illustration shows a PL7 instruction list sequence.

!(*Awaiting drying*)

%L2:

AND

%I1.0

%M10

%Q2.5

Description of a sequence

Each sequence begins with an exclamation mark (generated automatically). It includes the following elements.

Address Element

1 Comments

Label

Instructions

Function

Enter a sequence (optional).

Locate a sequence (optional).

One or more test instructions, the result of these instructions being applied to one or more action instructions.

One instruction takes up a maximum of one line

35015365.01 07/2008

131

Instruction list language

Label for a sequence in instruction list language

General points

Syntax

Illustration

The label is used to locate a sequence in a program entity (main program, subprogram,…). It is optional

This label has the following syntax: %Li with i between 0 and 999. It is at the beginning of a sequence.

The following program shows how the label is used.

%L0:

JMPC

%M40

%L10

!(*Awaiting drying*)

%L2:

AND

%I1.0

%M10

%Q2.5

...

%L10:

LD%I3.5

ANDN

%Q4.3

%M20

%Q2.5

Label

Rules The same label can only be allocated to a single sequence within the same program entity.

It is necessary to label a sequence so that connection can be made after a program jump.

The order of label addresses does not matter, (it is the order of entering the sequences that is taken into account by the system when scanning).

132

35015365.01 07/2008

Instruction list language

Comments on a sequence in instruction list language

General points

Syntax

Illustration

The comments make interpreting a sequence to which they are assigned easier.

They are optional.

The comments can be integrated at the beginning of a sequence and can take up up to 3 lines (i.e. 222 alphanumeric characters), on either side of which are the characters (* and *).

The following illustration locates the position of the comments in a sequence.

!(*Awaiting drying*)

%L2:

LD %I1.0

AND

%M10

%Q2.5

Comments

Rules The comments are only displayed from the first line of the sequence.

If a sequence is deleted, the comments with it are also deleted.

The comments are stored in the PL7 and can be accessed by the user at any time.

In this case they take up program memory.

35015365.01 07/2008

133

Instruction list language

Presenting instructions in instruction list language

General points The instruction list language is made up of the following : z z z z test instructions action instructions on a function block numerical

Test instructions The following table describes test instructions in instruction list language.

Name Equivalent computer art

Functions

LDN

LDR

The Boolean result is the same as the status of the operand.

The Boolean result is the same as the reverse status of the operand.

The Boolean result changes to 1 on detection of the operand (rising edge) changing from 0 to 1.

LDF

AND

ANDN

ANDR

ANDF

The Boolean result changes to 1 on detection of the operand (falling edge) changing from 1 to 0.

The Boolean result is equal to the And logic between the

Boolean result of the previous instruction and the status of the operand.

The Boolean result is equal to the And logic between the

Boolean result of the previous instruction and the reverse status of the operand.

The Boolean result is equal to the And logic between the

Boolean result of the previous instruction and the detection of the operand's rising edge (1 = rising edge).

The Boolean result is equal to the And logic between the

Boolean result of the previous instruction and the detection of the operand's falling edge (1 = falling edge).

The Boolean result is equal to the Or logic between the

Boolean result of the previous instruction and the status of the operand.

ORN The Boolean result is equal to the Or logic between the

Boolean result of the previous instruction and the reverse status of the operand.

134

35015365.01 07/2008

Name

ORR

ORF

AND(

Instruction list language

Equivalent computer art

Functions

The Boolean result is equal to the Or logic between the

Boolean result of the previous instruction and the detection of the operand's rising edge (1 = rising edge).

The Boolean result is equal to the Or logic between the

Boolean result of the previous instruction and the status of the operand and the detection of the operand's falling edge

(1 = falling edge).

Logic And (8 parenthesis levels)

OR( Logic Or (8 parenthesis levels)

XOR, XORN,

XORR, XORF

MPS

MRD

MPP

N -

Exclusive Or

Switching to the coils.

Negation

135

Instruction list language

Action instructions

The following table describes test instructions in instruction list language.

Name

Computer art Functions

The associated operand takes the value of the test field result.

STN

The associated operand takes the reverse value of the test field result.

The associated operand is set to 1 when the result of the test field is 1.

The associated operand is set to 0 when the result of the test field is 1.

JMP

JMPC

JMPCN

SRn

RET

RETC

RETCN

END

ENDC

ENDCN

is used to connect unconditionally to a labeled sequence, upstream or downstream.

is used for a conditioned connection to a Boolean result at

1, to a labeled sequence upstream or downstream.

is used for a conditioned connection to a Boolean result at

0, to a labeled sequence upstream or downstream.

Connection at the beginning of a sub program.

Return of the sub-program

Return of the conditioned sub program to a Boolean result at 1.

Return of the conditioned sub program to a Boolean result at 0.

End of program.

End of the conditioned program at a Boolean result of 1.

End of the conditioned program at a Boolean result of 0.

Instruction on a function block

The following table describes test instructions in instruction list language.

Name

Timer blocks, counter, monostable, register, cyclical programmer

Computer art Functions

For each of the standard function blocks, there are instructions for controlling the block.

A structured form is used to hardwire the block inputs and outputs directly.

136

35015365.01 07/2008

Numeric instructions

Instruction list language

The following table describes test instructions in instruction list language.

Name

Test element

Action element

Instructions

LD[.....]

AND[.....]

OR[.....]

[.....]

Functions is used to compare 2 operands. The output goes to

1 when the result is checked.

Example : LD[%MW10<1000]

Result to 1 when %MW10<1000.

carry out arithmetic logic operations… use the structured text language syntax.

Example : [%MW10:=%MW0+100]

The result of the %MW0+100 operation is placed in the internal word %MW10.

35015365.01 07/2008

137

Instruction list language

Rule for using parentheses in instruction list language

General points

Principle

Example: AND(

The instructions AND and OR can use parentheses.

These parentheses are used to make up simple contact diagrams.

Opening parentheses is associated with the instruction AND or OR .

Closing parentheses is an instruction. It must be done for each open parenthesis.

The 2 following programs show how parentheses are used.

AND

%I1.0

%I1.1

%I1.2

%Q2.0

AND(

)

%I1.0

%I1.1

%I1.2

%Q2.0

Example: OR( The following program shows how the parenthesis is used.

AND

OR(N

AND

)

%I1.0

%I1.1

%I1.2

%I1.3

%Q2.0

138

35015365.01 07/2008

Instruction list language

Associating parentheses to modifiers

The following "modifiers" can be associated with parentheses.

Code

[

Role

Negation

Falling edge

Rising edge

Comparison

Example

AND(N

AND(F

OR(R

OR([%MW0>100]

Overlapping of parentheses

It is possible to overlap up to 8 parenthesis levels.

The following rules must be observed: z z z

Each open parenthesis must be closed

The labels %Li: must not be put in expressions in parentheses, or the jump instructions JMP and calling up sub program instructions SRi ,

Assigning instructions ST , STN , S and R must not be programmed in parentheses.

Example:

The following programs show how to use overlapping of parentheses.

AND(

OR(N

AND

)

%I1.0

%I1.1

%I1.2

%M3

%Q2.0

AND(

AND

OR(N

AND

)

AND

OR(N

AND

)

ST %Q2.0

%I1.1

%I1.2

%I1.3

%I1.5

%I1.6

%I1.4

%I1.7

%I1.8

35015365.01 07/2008

139

Instruction list language

Description of the MPS, MRD and MPP instructions

General points The 3 instruction types are used to switch to the coils.

These instructions use an intermediate memory called a stack which can store up to

3 Boolean instructions…

Note: these instructions cannot be used in an expression in parentheses

Role

Example 1

The following table describes the role of each of the instructions

Instruction

MPS (Memory PuSh)

MRD (Memory ReaD)

MPP (Memory PoP)

Role

This instruction stores the results of the last test instruction at the top of the stack and moves the other values to the bottom of the stack.

This instruction reads the top of the stack.

This instruction reads, draws down the top of the stack and moves the other values towards the top of the stack.

This example shows how to use the MPS, MRD and MPP instructions.

AND

MPS

AND

MRD

AND

MRD

AND

MPP

AND

%I1.0

%M0

%I1.1

%Q2.0

%I1.2

%Q2.1

%I1.3

%Q2.2

%I1.4

%Q2.3

140

35015365.01 07/2008

Example 2

Instruction list language

This example shows how the MPS, MRD and MPP instructions operate.

MPS

AND

MPS

%I1.0

%I1.1

AND( %I1.3

OR %M0

)

%Q2.0

MPP

AND %M1

%Q2.1

MRD

AND

MPP

%I1.4

%Q2.2

AND

%M10

%Q2.3

35015365.01 07/2008

141

Instruction list language

Principles of programming pre-defined function blocks

General points

Principle of direct programming

Automatic system function blocks can be programmed in 2 different ways: z z with specific instructions for each function block (e.g.: CU %Ci ), this method is the simplest and the most direct, with block structuring instructions BLK , OUT_BLK , END_BLK .

The instructions control the block inputs (e.g.: CU ). The outputs can be accessed in bit form (e.g.: %C8.D

Example:

This example shows direct programming of a counter function block.

LDN

%I1.1

%CS

%I1.2

ANDN %M0

CU %CS

%CS.D

%Q2.0

Processing inputs

Processing outputs

142

35015365.01 07/2008

Principle of structured programming

Instruction list language

This type of programming uses a set of instructions with instructions round them: z z z

BLK indicates the beginning of the block

OUT_BLK is used to hardwire the block outputs directly

END_BLK indicates the end of the block

Example:

This example shows structured programming of a counter function block.

BLK

%C8

%I1.1

LDN %I1.2

ANDN %M0

OUT_BLK

LD D

ST %Q2.0

END_BLK

Processing inputs

Processing outputs

Note: this principle of structured programming which needs the additional instructions BLK, OUT_BLK and END_BLK requires a greater amount of memory than direct programming. It must, however, be used if you want to keep the similarity between reversible programs for nano TSX 07 PL7s.

35015365.01 07/2008

143

Instruction list language

Rules for running an instruction list program

Principle

Example 1

Running an instruction list program is done sequentially instruction by instruction.

The first instruction for an instruction sequence must always be an LD instruction, i.e. an unconditional instruction (e.g.: JMP ).

Each instruction (except for LD and unconditional instructions) uses the Boolean result of the previous instruction.

The program below describes the complete run of a sequence.

AND

%I1.1

%M0

%M10 result = status of bit %I1.1

result = AND of previous Boolean result and the status of bit %M0 result = OR of previous Boolean result and the status of bit %M10

%Q2.0

%Q2.0 has the status of the previous Boolean result

Example 2 The parentheses are used to modify the order that the Boolean results are taken into account:

AND

OR(

AND

)

%I1.1

result = status of bit %I1.1

%M0 result = AND of previous Boolean result and the status of bit %M0

%M10 result = status of bit %M10

%I1.2

result = AND of previous Boolean result and the status of bit %M10

%Q2.0

%Q2.0 has the status of the previous Boolean result

Example 3 Sequencing instructions can be modified by jump instructions JMP for calling up a sub program.

JMPC

AND

%L10:

AND

......

%M0

%L10

%I1.1

%M10

%Q2.0

%I1.3

%M20

Jump to label %L10 if %M0=1

144

35015365.01 07/2008

Structured text language

Presentation

Subject of this chapter

What's in this

Chapter?

This chapter describes the rules for programming in structured text language.

This chapter contains the following topics:

Topic

Presentation of structured text language

Structuring a program in structured text language

Label for a sequence in structured text language

Comments on a sequence in structured text language

Bit object instructions

Arithmetic and logic instructions

Instructions for tables and character strings

Instructions for numerical conversions

Instructions for Programs and Specific Instructions

Conditional check structure IF...THEN

Conditional check structure WHILE...END_WHILE

Conditional check structure REPEAT...END_REPEAT

Conditional check structure FOR...END_FOR

Output Instruction for the EXIT Loop

Rules for running a structured text program

Page

35015365.01 07/2008

145

Structured text language

Presentation of structured text language

General points

Limits of use

Illustration of a program

Structured text language is a developed algorithmic language that is specially adapted for programming complex arithmetic functions, manipulating tables and managing messages.

It is used to make up programs by writing programming lines made up of alphanumeric characters.

This language can be used with Micro, Junior and Pro PL7 software on Premium and Micro PL7s.

In the Pro PL7 version, this language is used to create DFB user function blocks on

Premium PL7s.

The following illustration shows a program in PL7 structured language.

in a

(* Searching for the first element that is not zero table of 32 words, determining its value

(%MW10), its rank (%MW11). This search is done if %M0 is set to 1, %M1 is set to 1 if an element which is not zero exists unless it is set to 0*)

IF %M0 THEN

FOR %MW99:=0 TO 31 DO

IF %MW100[%MW99]<>0 THEN

%MW10:=%MW100[%MW99];

%MW11:=%MW99;

%M1:=TRUE;

EXIT; (*Exit the loop*)

ELSE

%M1:=FALSE;

END_IF;

END_FOR;

ELSE

%M1:=FALSE;

END_IF;

146

35015365.01 07/2008

Structured text language

Structuring a program in structured text language

General points

Example of a sequence

A section of text program is organized into sequences.

A text sequence is the equivalent of a contact network in contact language.

The following illustration shows a sequence in PL7 structured language.

1 !

%L20: (*Awaiting drying*)

SET %M0;

%MW4:=%MW2 + %MW9;

(*calculating pressure*)

%MF12:=SQRT (%MF14);

Description of a sequence

Each sequence begins with an exclamation mark (generated automatically). It includes the following elements.

Address Element

1 Label

Comments

Instructions

Function

Locates a sequence.

Fill in a sequence.

One or more instructions separated by ";".

Note: each of these elements is optional, that is it is possible to have an empty sequence, a sequence made up only of comments or only of a label.

35015365.01 07/2008

147

Structured text language

Label for a sequence in structured text language

Role

Syntax

Illustration

The label is used to locate a sequence in a program entity (main program, subprogram,…). It is optional.

This label has the following syntax: %Li : with i between 0 and 999. It is at the beginning of a sequence.

The following program shows how the label is used.

%L20:

(*Awaiting drying*)

SET %M0;

%MW4:=%MW2 + %MW9;

(*calculating pressure*)

%MF12:=SQRT (%MF14);

Label

Rules The same label can only be allocated to a single sequence within the same program entity.

It is necessary to label a sequence so that connection can be made after a program jump.

The order of label addresses does not matter, (it is the order of entering the sequences that is taken into account by the system when scanning).

148

35015365.01 07/2008

Structured text language

Comments on a sequence in structured text language

Role

Syntax

Illustration

The comments make interpreting a sequence to which they are assigned easier.

They are optional.

The comments can be integrated anywhere in the sequence and the number of comments per sequence is not limited.

A comment is surrounded on both sides by the characters (* and *).

The following illustration locates the position of the comments in a sequence.

%L20: (*Awaiting drying*)

SET %M0;

%MW4:=%MW2 + %MW9;

(*calculating pressure*)

%MF12:=SQRT (%MF14);

Comments

Rules z z z z

Any character is allowed in a comment.

The number of characters is limited to 256 per commentary.

Comments may not overlap.

A comment can contain several lines.

The comments are stored in the PL7 and can be accessed by the user at any time.

In this case they take up program memory.

35015365.01 07/2008

149

Structured text language

Bit object instructions

Bits instructions The following instructions apply to bit objects.

Designation

AND

XOR

NOT

SET

RESET

Function

Assignment of a bit boolean OR boolean AND boolean exclusive OR

Inversion

Rising edge

Falling edge

Set to 1:

Set to 0:

Bits table instructions

The following instructions apply to bits table objects.

Designation

Table:= Table

Table:= Word

Word:= Table

Table:= Double word

Double word: = Table

COPY_BIT

AND_ARX

OR_ARX

XOR_ARX

NOT_ARX

BIT_W

BIT_D

W_BIT

D_BIT

LENGHT_ARX

Function

Assignment between two tables

Assignment of a word to a table

Assignment of a table to a word

Assignment of a double word to a table

Assignment of a table to a double word

Copy of a bits table in a bits table

AND between two tables

OR between two tables exclusive OR between two tables

Negation in a table

Copy of a bits table in a word table

Copy of a bits table in a double word table

Copy of a word table in a bits table

Copy of a double word table in a bits table

Calculation of the length of a table by the number of elements

150

35015365.01 07/2008

Structured text language

Arithmetic and logic instructions

Whole arithmetic on words and double words

The following instructions apply to word and double word objects…

Name

+, -, *, /

REM

SQRT

ABS

INC

DEC

Function

Addition, Subtraction, Multiplication, whole Division

Remainder of whole division

Whole square root

Absolute value

Incrementation

Disincrementation

Arithmetic on floating points

The following instructions are applied to floating objects...

EXP

EXPT

COS

SIN

TAN

ACOS

ASIN

Name

+, -, *, /

SQRT

ABS

TRUNC

LOG

ATAN

DEG_TO_RAD

RAD_TO_DEG

Function

Addition, Subtraction, Multiplication,Division

Square root

Absolute value

Whole part

Base 10 logarithm

Napierian logarithm

Natural exponential

Exponentiation of an actual by an actual

Cosine of a value in radians

Sine of a value in radians

Tangent of a value in radians

Cosine arc (result between 0 and 2 p)

Sine arc (result between -p/2 and +p/2)

Tangent arc (result between -p/2 and +p/2)

Converting degrees to radians

Converting radians to degrees

35015365.01 07/2008

151

Structured text language

Logic instructions on words and double words

The following instructions are applied to word and double word objects.

Name

AND

XOR

NOT

SHL

SHR

ROL

ROR

Function logic AND logic OR exclusive logic OR

Logic complement

Logic shift to left

Logic shift to right

Circular logic shift to left

Circular logic shift to right

Numerical comparisons on words, double words and floating points

The following instructions are applied to word, double word and floating objects.

Name

Function

Clearly less than

Clearly more than

Less or equal to

More or equal to

Equal to

Different from

152

35015365.01 07/2008

Structured text language

Instructions for tables and character strings

Instructions for word tables and double words

The following instructions are applied to word tables and double words.

Name

Table: = Table

Table: = Word

+, -, *, /, REM

SUM

EQUAL

NOT

AND, OR, XOR

Function

Assigning between two tables

Initializing a table

Arithmetic operations between tables

Arithmetic operations between expressions and tables

Totaling the elements in a table

Comparing two tables

Logic complement for a table

Logic operations between two tables

Logic operations between expressions and tables

FIND_EQW, FIND_EQD

FIND_GTW, FIND_GTD

FIND_LTW, FIND_LTD

MAX_ARW, MAX_ARD

MIN_ARW, MIN_ARD

OCCUR_ARW, OCCUR_ARD

Finding the first element equal to a value

Finding the first element greater than a value

Finding the first element less than a value

Finding the maximum value in a table

Finding the minimum value in a table

Number of times a value occurs in a table

SORT_ARW, SORT_ARD

ROL_ARW, ROL_ARD

ROR_ARW, ROR_ARD

Sorting a table in ascending or descending order

Shifting a table to the left in a circular movement

Shifting a table to the right in a circular movement

FIND_EQWP,FIND_EQDP Finding the first element from a rank equal to a value

LENGTH_ARW, LENGTH_ARD Calculating the length of a table

35015365.01 07/2008

153

Structured text language

Instructions for floating point tables

The following instructions are applied to floating point tables.

Name

Table: = Table

Table: = Floating point

SUM_ARR

EQUAL_ARR

FIND_EQR

FIND_GTR

FIND_LTR

MAX_ARR

MIN_ARR

OCCUR_ARR

SORT_ARR

ROL_ARR

ROR_ARR

LENGTH_ARR

Function

Assigning between two tables

Initializing a table

Totaling the elements in a table

Comparing two tables

Finding the first element equal to a value

Finding the first element greater than a value

Finding the first element less than a value

Finding the maximum value in a table

Finding the minimum value in a table

Number of times a value occurs in a table

Sorting a table in ascending or descending order

Shifting a table to the left in a circular movement

Shifting a table to the right in a circular movement

Calculating the length of a table

154

35015365.01 07/2008

Structured text language

Instructions for character strings

The following instructions are applied to character strings.

Name

STRING_TO_INT

STRING_TO_DINT

INT_TO_STRING

DINT_TO_STRING

STRING_TO_REAL

REAL_TO_STRING

<, >, <=, >=, =, <>

FIND

EQUAL_STR

LEN

MID

INSERT

DELETE

CONCAT

REPLACE

LEFT

RIGHT

Function

Converting ASCII to binary (single word format)

Converting ASCII to binary (double word format)

Converting binary (single word format) to ASCII

Converting binary (double word format) to ASCII

Converting ASCII to floating point

Converting floating point to ASCII

Alphanumeric comparison

Position of a sub-chain

Position of the first different character

Length of a character string

Extracting a sub-chain

Inserting a sub-chain

Deleting a sub-chain

Joining two strings

Replacing a string

Start of string

End of string

35015365.01 07/2008

155

Structured text language

Instructions for numerical conversions

Instructions for numerical conversions

These instructions convert bits, words, double words and floating points.

Name

BCD_TO_INT

INT_TO_BCD

GRAY_TO_INT

INT_TO_REAL

DINT_TO_REAL

REAL_TO_INT

REAL_TO_DINT

DBCD_TO_DINT

DINT_TO_DBCD

DBCD_TO_INT

INT_TO_DBCD

CONCATW

Function

Converting BCD to binary

Converting binary to BCD

Converting Gray to binary

Converting a single whole format into floating

Converting a double whole format into floating

Converting a floating point into single whole format

Converting a floating point into a double whole format

Converting a 32 bit BCD number into a 32 bit whole

Converting a 32 bit whole number into a 32 bit BCD number

Converting a 16 bit BCD number into a 32 bit whole

Converting a 16 bit whole number into a 32 bit BCD number

Extracting the least significant word from a double word

Extracting the most significant word from a double word

Joining two single words

156

35015365.01 07/2008

Structured text language

Instructions for Programs and Specific Instructions

Program

Instructions

The following instructions do not affect language objects but the running of the program.

Designation

HALT

JUMP

SRi

RETURN

MASKEVT

UNMASKEVT

Function

Stopping the running of the program

Jumping to a label

Calling up a sub-program

Return of the sub-program

Masking events in the PLC

Unmasking events in the PLC

Time

Management

Instructions

The following instructions carry out operations on dates, times and durations.

Designation

SCHEDULE

RRTC

WRTC

PTC

ADD_TOD

ADD_DT

DELTA_TOD

DELTA_D

DELTA_DT

SUB_TOD

SUB_DT

DAY_OF_WEEK

TRANS_TIME

DATE_TO_STRING

TOD_TO_STRING

DT_TO_STRING

TIME_TO_STRING

Function

Time function

Reading system date

Updating system date

Reading date and stop code

Adding a duration to a time of day

Adding a duration to a date and time

Measuring the gap between times of day

Measuring the gap between dates (without time).

Measuring the gap between dates (with time).

Totaling the time to date

Totaling the time to date and time

Reading the current day of the week

Converting duration into date

Converting a date to a character string

Converting a time to a character string

Converting a whole date to a character string

Converting a duration to a character string

35015365.01 07/2008

157

Structured text language

"Orpheus"

Instructions

The following instructions are specific to the Orpheus language.

Designation

WSHL_RBIT, DSHL_RBIT

WSHR_RBIT, DSHR_RBIT

WSHRZ_C, DSHRZ_C

SCOUNT

ROLW,ROLD

RORW,RORD

Function

Shifting a word to the left with recovery of shifted bits

Shifting a word to the right with sign extension and recovery of shifted bits

Shifting a word to the right with filling in with 0 and recovery of shifted bits

Up/down counting with overshoot signaling

Circular shift to the left

Circular shift to the right

Timing

Instructions

These instructions are timing functions to be used for programming DFB codes.

Designation

FTON

FTOF

FTP

FPULSOR

Function

Time until actuation

Time until reset

Pulse time

Generating rectangular signals

158

35015365.01 07/2008

Structured text language

Conditional check structure IF...THEN

Role

Simple form

This check structure takes one or more actions if one condition is true. In its general form there can be a number of conditions.

In its simple form the check structure has the following syntax and operation.

Syntax Operation

IF condition THEN actions ;

END_IF;

Beginning of IF not checked

Condition

Action checked

End of IF

Example:

! (*Conditional action IF (simple form)*)

IF %M0 AND %M12 THEN

RESET %M0;

INC %MW4;

%MW10:=%MW8+%MW9;

END_IF;

35015365.01 07/2008

159

Structured text language

General form In its general form the check structure has the following syntax and operation.

Syntax Operation

IF condition1 THEN

ELSE actions1;

ELSEIF condition2 THEN actions2;

Beginning of IF checked

Condition 1 not checked

Actions 1 checked

Actions 2

Condition 2

Actions 3 not checked actions3;

END_IF;

End of IF

Example:

! (*Conditional action IF (simple form)*)

IF %M0 AND %M1 THEN

%MW5:=%MW3+%MW4;

SET %M10;

ELSEIF %M0 OR %M1 THEN

%MW5:=%MW3-%MW4;

SET %M11;

ELSE

RESET %M10;

RESET %M11;

END_IF;

Programming rule z z z z z

There can be a number of conditions.

Each action represents an instruction list.

Several IF check structures can be overlapped.

There is no limit to the number of ELSIF .

There is a maximum of one ELSE .

160

35015365.01 07/2008

Structured text language

Conditional check structure WHILE...END_WHILE

Role

Description

This check structure carries out a repetitive action as long as a condition is verified.

The check structure has the following syntax and operation.

Syntax Operation

Beginning of WHILE

WHILE condition DO action ;

END_WHILE; not checked

Condition

Action checked

End of WHILE

Example:

! (*WHILE conditional repeated action*)

WHILE %MW4<12 DO

INC %MW4;

SET %M25[%MW4];

END_WHILE;

Programming rule z z z z

It can be a multiple condition.

The action represents an instruction list.

The test on the condition is done before the action is carried out. If when the condition is first evaluated its value is wrong, then the action is never carried out.

Several WHILE check structures can be overlapped.

Note: the instruction EXIT (see

Role, p. 164

) is used to stop the loop running and to continue to the instruction following the END_WHILE .

35015365.01 07/2008

161

Structured text language

Conditional check structure REPEAT...END_REPEAT

Role

Description

This check structure carries out a repetitive action until a condition is verified.

The check structure has the following syntax and operation.

Syntax

Operation

Beginning of REPEAT

REPEAT

Action action ;

UNTIL condition END_REPEAT; not checked

Condition checked

End of REPEAT

Example:

! (*REPEAT conditional repeated action*)

REPEAT

INC %MW4;

SET %M25[%MW4];

UNTIL %MW4>12 END_REPEAT;

Programming rule z z z z

It can be a multiple condition.

The action represents an instruction list.

The test on the condition is done after the action is carried out. If when the condition is first evaluated its value is wrong, then the action is carried out once.

Several REPEAT check structures can be overlapped.

Note: the instruction EXIT (see

Role, p. 164 )

is used to stop the loop running and to continue to the instruction following the END_REPEAT .

162

35015365.01 07/2008

Structured text language

Conditional check structure FOR...END_FOR

Role

Description

This check structure carries out a process a certain number of times by adding 1 to each loop index.

The check structure has the following syntax and operation.

Syntax

FOR index:=initial value TO final value DO

Operation

Beginning of FOR

Initial value --> Index action ;

END_FOR; checked

Index >

Final value not checked

Action

End of FOR

Index+1 --> Index

Example:

! (*Repeated action FOR*)

FOR %MW4=0 TO %MW23+12 DO

SET %M25[%MW4];

END_FOR;

Programming rule z z z z z z

When the index is clearly greater than the final value, the operation continues on the instruction following the END_FOR .

Increasing the index is done automatically and is therefore not under your control.

The action represents an instruction list.

The initial value and the final value must be numeric word type expressions.

The index must be a word type object with write access.

Several FOR check structures can be overlapped.

Note: the instruction EXIT (see

Role, p. 164

) is used to stop the loop running and to continue to the instruction following the END_FOR .

35015365.01 07/2008

163

Structured text language

Output Instruction for the EXIT Loop

Role

Programming

Rule

Example

This instruction is used to stop the loop running and to go on to the instruction following the end of loop instruction.

z z

This instruction can only be used in the actions of one of 3 loops WHILE , REPEAT or FOR .

This instruction is linked to the nearest incorporated loop, i.e. it does not stop all the loops which incorporate it from running.

In this example the instruction EXIT is used to stop the REPEAT loop but never the

WHILE loop.

! (*Instruction for exiting the loop EXIT*)

WHILE %MW1<124 DO

%MW2:=0;

%MW3:=%MW100[%MW1];

REPEAT

%MW500[%MW2]:=%MW3+%MW500[%MW2];

IF(%MW500[%MW2]>32700) THEN

EXIT;

UNTIL %MW2>25 END_REPEAT;

INC %MW1;

END_WHILE;

END_IF;

INC %MW2;

164

35015365.01 07/2008

Structured text language

Rules for running a structured text program

General points Running a text program is done sequentially, instruction by instruction observing the check structures.

In the case of arithmetic or Boolean expressions made up of several operators, priority rules are defined between the various operators.

Operator priority rule

The table below gives the priorities for evaluating an expression with a greater or lesser priority.

Operator

Brackets

Logic complement

Inversion

- on operand

+ on operand

Multiplication

Division

Rollover

Addition

Subtraction

Comparisons

Equality comparison

Inequality comparison logic AND

Boolean AND logic exclusive OR

Boolean exclusive OR logic OR

Boolean OR

AND

XOR

Symbol

(expression)

NOT

REM

<,>,<=,>=

Priority

Greater

Lesser

Note: when there is a conflict between two operators at the same priority level, the first operator has priority (evaluation is done from left to right).

35015365.01 07/2008

165

Structured text language

Example 1

Example 2

Using brackets

Example 1

Example 2

Implicit conversions

In the example below the NOT is applied on the %MW3 then the result is multiplied by

25. The sum of %MW10 and %MW12 is then calculated then the logic AND from the result of the multiplication and the addition.

NOT %MW3 * 25 AND %MW10 + %MW12

In this example multiplying %MW34 by 2 is done first then the result is used to carry out the rollover.

% MW34 * 2 REM 6

Brackets are used to modify the order in which operators are evaluated to allow, for example, an addition to be carried out before a multiplication.

You can overlap parentheses and there is no limit to the level of overlap.

Parentheses can also be used in order to prevent the program being wrongly interpreted.

In this example, addition is done first, then multiplication:

(%MW10+%MW11)*%MW12

This example shows that parentheses can be used to avoid any misinterpretation of the program.

NOT %MW2 <> %MW4 + %MW6

Using these operator priority rules, the interpretation is as follows :

((NOT %MW2) <> (%MW4 + %MW6))

But you may think that the operation is as follows:

NOT (%MW2 <> (%MW4 + %MW6 ))

Therefore parentheses serve to clarify the program.

Implicit conversions are about words and double words.

The operators that you use in arithmetic expressions, in comparisons and operator allocation carry out these implicit conversions (which are therefore not under the user's control).

166

35015365.01 07/2008

Structured text language

For an instruction in the form: <operand 1> <operator> <operand 2>, the possible conversion cases are :

Operand 1 type

Word

Double word

Operand 2 type

Word

Double word

Word

Double word

Conversion

Operand 1

Double word

Conversion

Operand 2

Double word

Operation in type

Word

Double word

To assign the form <left operand> := <right operand>, the left operand prescribes the type expected to carry out the operation, which means that the right operand must be converted if necessary according to the table :

Operand type left

Word

Double word

Operand type right

Word

Double word

Word

Double word

Conversion right operand

Word

Double word

Note: any operation between two adjacent values is carried out in double length.

167

Structured text language

168

35015365.01 07/2008

Grafcet

Presentation

Subject of this chapter

What's in this

Chapter?

This chapter describes programming rules in Grafcet.

This chapter contains the following sections:

Section

9.1

9.2

9.3

9.4

9.5

Topic

General presentation of Grafcet

Rules for constructing Grafcet

Programming actions and conditions

Macro steps

Grafcet section

Page

35015365.01 07/2008

169

Grafcet

9.1 General presentation of Grafcet

Presentation

Aim of this section

What's in this

Section?

This section describes the basic Grafcet elements.

This section contains the following topics:

Topic

Presenting Grafcet

Description of Grafcet Graphic Symbols

Description of specific Grafcet objects

Grafcet possibilities

Page

170

35015365.01 07/2008

Grafcet

Presenting Grafcet

General points

Presentation

The Grafcet language complies with the "Sequence function chart" (SFC) language of the IEC 1131-3 standard.

Grafcet is used to represent the operation of a sequential automatic system in a structured and graphic form.

This graphic description of the sequential behavior of the automatic system and of the various situations that emanate from it is done with the help of simple graphic symbols.

1 Initial step

Transition

AND divergence

3 Actions 7

OR divergence

4 Actions 5 8 Actions

OR convergence

6 9

Actions

AND convergence

Step

35015365.01 07/2008

171

Grafcet

Description of Grafcet Graphic Symbols

Description

Designation

Initial steps

Simple steps

Macro steps

Step of Macro steps

The following table describes the basic Grafcet elements.

Symbol Functions

Symbolize the initial active steps at the beginning of the cycle after initialization or re-start from cold.

i or i i i or or i i i z z z

Show that the control system is in a stable condition. The maximum number of steps (including the initial steps) can be configured from:

1 - 96 for a TSX 37-10,

1 - 128 for a TSX 37-20,

1 - 250 for a TSX 57.

The maximum number of active steps at the same time can be configured.

Symbolizes a macro step: a single group of steps and transitions.

The maximum number of macro steps can only be configured from 0 -

63 for the TSX 57.

Symbolizes the steps of a macro step.

The maximum number of steps for each macro step can be configured from 0 - 250 for the TSX 57.

Each macro step includes an IN and OUT step.

IN or OUT

Transitions

AND divergences

Allow the transfer from one step to another. A transition condition associated with this condition is used to define the logic conditions necessary to cross this transition.

The maximum number of transitions is 1024. It cannot be configured.

The maximum number of valid transitions at the same time can be configured.

Transition from one step to several steps: is used to activate a maximum of 11 steps at the same time.

AND convergences

Transition of several steps to one: is used to deactivate a maximum of

11 steps at the same time.

172

35015365.01 07/2008

Designation

OR divergences

Symbol

OR convergences

Source connectors

Destination connector

Links directed z z towards: z top bottom right or left n n

Grafcet

Functions

Transition from one step to several steps: is used to carry out a switch to a maximum of 11 steps.

Transition of several steps to one: is used to end switching from a maximum of 11 steps.

"n" is the number of the step "it comes from" (source step).

"n" is the number of the step "it’s going to" (target step).

These links are used for switching, jumping a step, restarting steps

(sequence).

Note: the maximum number of steps (main graph steps & macro step steps) in the

Grafcet section must not exceed 1024 on the TSX 57.

35015365.01 07/2008

173

Grafcet

Description of specific Grafcet objects

General points

Grafcet objects

Grafcet uses bit objects associated in steps, specific system bits, word objects which show the activity time of the steps and specific system words.

The following table describes all the objects associated with Grafcet.

Name

Bits associated with the steps (1

= active step)

System bits associated with

Grafcet

%Xi

%XMj

%Xj.i

%Xj.IN

%Xj.OUT

%S21

%S22

%S23

%S24

%S25

Description

Status of the i step of the main Grafcet

(i from 0 - n) (n depends on the processor)

Status of the j macro step (j from 0 - 63 for TSX/PMX/PCX

57)

Status of the i step of the j macro step

Status of the input step of the j macro step

Status of the output step of the j macro step

Initializes Grafcet

Grafcet resets everything to zero

Freezes Grafcet

Resets macro steps to 0 according to the system words

%SW22 - %SW25

Set to 1 when: z z tables overflow (steps/transition), an incorrect graph is run (destination connector on a step which does not belong to the graph).

Words associated with steps

System words associated with

Grafcet

%Xi.T

%Xj.i.T

%Xj.IN.T

Activity time for main Grafcet step i.

Activity time for the i step of the j macro step

Activity time for the input step of the j macro step

%Xj.OUT.T

Activity time for the output step of the j macro step

%SW20 Word which is used to inform the current cycle of the number of active steps, to be activated and deactivated.

%SW21 Word which is used to inform the current cycle of the number of valid transitions to be validated or invalidated.

%SW22 à

%SW25

Group of 4 words which are used to indicate the macro steps to be reset to 0 when bit %S24 is set to 1.

174

35015365.01 07/2008

Grafcet

Bits associated with steps

The bits associéated with steps %Xi, with macro steps %XMi, and macro step steps

%Xj.I , %Xj.IN and %Xj.OUT have the following properties: z z z

They are at 1 when the steps are active.

They can be tested in all the tasks, but can only be written in the preliminary process of the master task (pre-positioning of graphs). These tests and actions are programmed either in contact language, instruction list language or in text language.

They can be indexed.

Activity time The activity time words of the steps %Xi.T and macro step steps %Xj.I, %Xj.IN and

%Xj.OUT have the following properties: z z z z z z

They are incremented every 100 ms and have a value from 0 - 9999.

Incrementation of the word: while the associated step is active.

When the step is deactivated the contents are frozen.

When the step is activated the contents are reset to zero and then incremented.

The number of activity time words cannot be configured. One word is reserved for each step.

These words can be indexed.

35015365.01 07/2008

175

Grafcet

Grafcet possibilities

General points

Illustration

The sequential process is structured in: z z

1 sub set Main graph,

64 sub sets: Macro steps,

These sub sets are themselves divided into 8 pages.

The following illustration describes the general structure of a Grafcet page.

Macro step 63

Main graph

Page 7

Macro step 0

Page 7

Page 1

Page 0

Page 1

Page 0

176

35015365.01 07/2008

Characteristics

Grafcet

They depend on the processor to be programmed. They are summarized in the table below.

Number

Main graph steps

Macro steps

Macro step steps

Step total

Steps active at the same time

Transitions valid at the same time

TSX 37 -10

Default settings

Maximum

TSX 37 -20

Default settings

128

Maximum

128

TSX 57

Default settings

128

640

Maximum

250

1024

250

20 192 24 256 48 400

The number of synchronous transitions (or number of AND convergences) must not exceed 64. The total number of transitions is always 1024.

35015365.01 07/2008

177

Grafcet

9.2 Rules for constructing Grafcet

Presentation

Aim of this section

What's in this

Section?

This section describes the basic rules for constructing Grafcet graphs.

This section contains the following topics:

Topic

Ilustration of Grafcet

Using OR divergences and convergences

Using AND divergences and convergences

Using connectors

Using directed links

Grafcet comments

Page

178

35015365.01 07/2008

Grafcet

Ilustration of Grafcet

General points

Illustration

The main graph and each of the macro steps are programmed on 8 pages (pages 0

- 7).

A Grafcet page is made up of 14 lines and 11 columns which define 154 cells.

It is possible to enter a graphic element in each cell.

The drawing below illustrates the division of a Grafcet page.

1 2 3 4 5 6 7 8 9 10 11

Writing rules z z z z z z

The first line is used to enter the source connectors.

The last line is used to enter the destination connectors.

The even lines (from 2 - 12) are step lines (for destination connector steps),

The odd lines (from 3 - 13) are transition lines (for transitions and source connectors).

Each step is located by a different number (0 - 127) in any order.

Different graphs can be displayed on one page.

35015365.01 07/2008

179

Grafcet

Using OR divergences and convergences

Role

Illustration

An OR divergence is a switch from one step to several steps.

An OR convergence stops the switch.

The drawing below shows an OR divergence of one step to 9 steps and an OR convergence.

17 18 19 20 21 22 23 24 25

26 27 28 29 30 31 32 33 34

Rules for use z z z z

The number of transitions upstream of a switching end (OR convergence) or downstream of a switching (OR divergence) must not exceed 11.

Switching can be to the left or to the right.

Switching must general finish with switching end.

To avoid crossing several transitions at the same time, the associated transition conditions must be exclusive.

180

35015365.01 07/2008

Using AND divergences and convergences

Role

Illustration

An AND divergence is used to activate several steps simultaneously.

An AND convergence is used to deactivate several steps simultaneously.

The drawing below shows an AND divergence and convergence of 6 steps.

42 43 44 45 46 47

48 49 50 51 52 53

Grafcet

Rules for use z z z z

The number of steps downstream from a simultaneous activation (AND divergence) or upstream from a simultaneous deactivation (AND convergence) must not exceed 11.

Simultaneous activation of steps must usually end with a simultaneous deactivation of steps.

Simultaneous activation is always shown from left to right.

Simultaneous deactivation is always shown from right to left.

35015365.01 07/2008

181

Grafcet

Using connectors

Role

Example

Connectors ensure the continuity of a Grafcet when the direct outline of a directed link cannot be made either within a page or between two consecutive pages or not.

This continuity is maintained thanks to a destination connector which has a corresponding system source connector.

The following illustration shows examples of connectors.

3 4 5 6 7 12 14 15 16 17

The table below explains how to use the connectors in the example.

Use

Re-connecting a graph can be done using connectors.

Re-starting a sequence can be done using connectors.

Using connectors when a branch of the graph is longer than the page.

Example

Reconnecting step 18 to step 0.

Step 10 to step 1 or step 8 to step 2.

Step 9 to step 10.

182

35015365.01 07/2008

Grafcet

Connectors used in OR divergences and convergences

The following table gives the rules for using connectors in the case of OR divergence or convergence.

Rule

For switching, transitions and destination connectors must be entered on the same page.

Illustration

To end switching, the source connectors must be entered on the same page as the destination step.

20 21

Page 1

Page 2

For an end to switching followed by a return to destination, there must be as many source connectors as steps before the end of switching.

4 5

Page 1

Page 2

35015365.01 07/2008

183

Grafcet

Connectors used in AND divergences and convergences

The following table gives the rules for using connectors in the case of AND divergence or convergence.

Illustration Rule

To activate steps simultaneously, the destination connectors must be on the same page as the divergence step and transition.

Page 2

Page 3

To deactivate simultaneously, the convergence steps and transition must be on the same page as the destination connector.

When several steps converge onto one transition, the source connector has the number of the furthest upstream step on the left.

45 48

Page 1

Page 2

184

35015365.01 07/2008

Grafcet

Using directed links

Role

Illustration

Directed links join a step to a transition or a transition to a step. They can be vertical or horizontal.

The following diagram shows an example of how to use a directed link.

1 2

3 4

Rules

(1) (2)

Directed links can: z z cross (1), they are then different types, meet (2), they are then the same type.

It is not possible for a link to cross and for steps to be activated or deactivated at the same time.

35015365.01 07/2008

185

Grafcet

Grafcet comments

General points

Syntax

Illustration

Comments can give information on Grafcet steps and transitions. They are optional.

The text of the comments is within (* to the left and *) to the right. Its maximum size is 64 characters.

The following illustration shows examples of comments.

1 (*Comments*)

2 (*Example of comment

(*Comments on

2 lines*)

Rules z z z

In a Grafcet page it is possible to enter a comment in any cell.

A comment takes up two cells side by side on a maximum of two lines.

If the display field is too small, the comment is truncated on the display but when the document is printed the comments are shown in their entirety.

The comment entered on a Grafcet page is stored in the graphic information embedded in the PL7. In this case they take up program memory.

186

35015365.01 07/2008

Grafcet

9.3 Programming actions and conditions

Presentation

Aim of this section

What's in this

Section?

This section describes the programming rules for Grafcet actions and conditions.

This section contains the following topics:

Topic

Programming actions associated with steps

Programming actions for activating or deactivating

Programming continuous actions

Programming transition conditions associated with transitions

Programming transition conditions in ladder

Programming transition conditions in instruction list language

Programming transition conditions in structured text language

Page

35015365.01 07/2008

187

Grafcet

Programming actions associated with steps

General points Actions associated with steps describe the orders to be transmitted to the operative part (process to be automated) or to other automated systems.

The actions can be programmed either in contact language, instruction list language or in structured text language.

These actions are only scanned if the step with which they are associated is active.

3 types of action The PL7 software allows three types of action: z z z actions for activation : actions carried out once when the step with which they are associated passes from the inactive to the active state.

actions for deactivation : actions carried out once when the step with which they are associated passes from the active to the inactive state.

continuous actions : these actions are carried out for as long as the step with which they are associated is active.

Note: one action can include several programming elements (sequences or contact networks).

Locating actions These actions are located in the following manner:

MAST - <Grafcet section name> - CHART (or MACROk)- PAGE n %Xi x with x = P1 for Activation, x = N1 Continuous, x = P0 Deactivation n = Page number i = Step number

Example: MAST - Paint - CHART - PAGE 0 %X1 P1 Action for activating step 1 of page 0 of the Paint section

188

35015365.01 07/2008

Rules for use

Grafcet z z z

All actions are considered stored actions, from where: an action paced to the duration of the Xn step must be reset to zero when step Xn is deactivated or when step Xn+ 1 is activated.

An action for maintained effect on several steps is set to one when step Xn is activated and reset to zero when step Xn+m is deactivated.

All actions can be paced to logic conditions, therefore can be conditional.

Actions paced to indirect safeguards must be programmed in subsequent processing (see

Description of subsequent processing, p. 215 ) (process carried

out on each scan )

Running order for actions

For the following example, for one cycle revolution, the running order for the actions is as follows. When step 51 is activated, the actions are carried out in the following order:

actions for deactivating step 50,

actions for activating step 51,

continuous actions for step 51.

Example:

50 Activating %X50 Continuing %X50 Deactivating %X50

51 Activating %X51 Continuing %X51 Deactivating %X51

As soon as step 51 has been deactivated the associated continuous actions are no longer scanned.

35015365.01 07/2008

189

Grafcet

Programming actions for activating or deactivating

Rules

Example 1

These actions are carried out once when the step with which they are associated passes from the inactive to the active state.

These actions are in pulses and are carried out in a single scanning revolution .

They are used to call up a sub-program, incrementing a counter, etc.

In this example this action calls up a sub-program

%L1

%M25 SR4

Example 2 In this example, this action increments the word %MW10 and resets the words

%MW0 and %MW25 to 0.

%L1:

INC %MW10;%MW0:=0;%MW25:=0;

190

35015365.01 07/2008

Grafcet

Programming continuous actions

Rules

Example of a conditional action

These actions are carried out for as long as the step with which they are associated is active. They can be: z z

Conditional actions : the action is carried out if a condition is fulfilled,

Timed actions : this is a special case, as the time is like a logic condition. This pacing can be done simply by testing the activity time associated with the step.

In this example, the bit %M10 is paced to the input %12.5 or to the internal bit %M9 and to the input %I1.2.

As long as step 2 is active and these conditions apply, %M10 is set at 1.

The last state read for deactivation is stored since the associated actions are no longer scanned. It is therefore necessary to reset bit %M10 to 0 in the step deactivation action for example.

Illustration of the example.

%L10

%I2.5

%M10

Continuous action

%M9 %I1.2

%L1

%M25 %M10

Action for deactivation

35015365.01 07/2008

191

Grafcet

Example of a timed action

In this example, bit %M12 is controlled as long as the activity time for step 3 is less than 10 seconds (time base : 100 ms).

%L1

%M25

%X3.T<100

%M12

These actions can also be unconditional.

192

35015365.01 07/2008

Grafcet

Programming transition conditions associated with transitions

General points

Rules

Locating the transition condition

A transition condition associated with a condition is used to define the logic conditions necessary to cross this transition.

The maximum number of transitions is 1024. It cannot be configured.

The maximum number of valid transitions at the same time can be configured.

z z z z

Associated with each transition is a transition condition which can be programmed either in ladder language, or in instruction list language or in text language.

A transition condition is only scanned if the transition with which it is associated is valid.

A transition condition corresponds to a contact network or an instruction list or a text expression, including a series of tests on bits and/or words.

A transition condition which has not been programmed is always an incorrect transition condition.

The transition conditions are located in the following manner:

MAST - <Grafcet section name> - CHART(or MACROk) - PAGE n %X(i)

--> % X(j) with : n = Page number i = Upstream step number j = Downstream step number

Example: MAST - Paint - CHART - PAGE 0 %X(0) --> %X(1)

Transition condition associated with the transition between step 0 and step 1 on page 0 of the Paint section graph.

Note: when steps have been activated or deactivated at the same time, the address indicated is that of the step in the column furthest to the left.

35015365.01 07/2008

193

Grafcet

Transition condition using activity time

In some applications, actions are controlled without a check on return information

(end of run, detector…). The duration of a step is governed by a time. The PL7 language enables the activity time associated with each step to be used.

Example: ! X3.T>=150

This transition condition programmed in structured text language allows the process to remain in step 3 for 15 seconds.

194

35015365.01 07/2008

Grafcet

Programming transition conditions in ladder

Programming rules

Example

The transition condition associated with the condition is programmed in the form of a contact network comprising a test field and an action field.

The structure of the contact network is similar to that of a network programmed in a program module.

Only the following elements can be used: z z test graphic elements : contacts (%Mi, %I, %Q, %TMi.D ...), comparison blocks, action graphic elements : "transition condition" coil only (the other coils are not significant in this case).

This example illustrates programming for a transition condition in ladder .

%I2.1

%MW10<20 #

35015365.01 07/2008

195

Grafcet

Programming transition conditions in instruction list language

Programming rules

Example

The transition condition associated with the transition is programmed in the form of an instruction list which only includes test instructions.

The instruction list for writing a transition condition differs from a normal instruction list in: z z the general structure: no label (%L).

the instruction list: z z no action instructions (bit, word or function block objects), no jump, calling up of sub-program.

This example illustrates programming for a transition condition in instruction list language.

LD %I2.1

AND [%MW10<20]

196

35015365.01 07/2008

Grafcet

Programming transition conditions in structured text language

Programming rules

Example

The transition condition associated with the transition is programmed in the form of a Boolean expression or an arithmetic expression or an association of both.

The expression used for writing a transition condition differs from a programming line in text language in : z z the general structure: z no label (%L).

z no action sequence, condition sequence or iterative sequence.

the instruction list: z z z no action on bit object, no jump, calling up of sub-program, no transfer, no action instruction on blocks.

This example illustrates programming for a transition condition in structured text language.

%I2.1 AND [%MW10<20]

35015365.01 07/2008

197

Grafcet

9.4 Macro steps

Presentation

Aim of this

Section

What's in this

Section?

This section describes how to program macro steps.

This section contains the following topics:

Topic

Presentation of Macro Steps

Structure of a Macro Step

Characteristics of macro steps

Page

199

200

201

198

35015365.01 07/2008

Grafcet

Presentation of Macro Steps

General Points

Macro

Representation

A macro step is a single condensed representation of a set of steps and transitions.

A macro step is inserted into a graph like a step and observes the step development rules.

A first level Grafcet which describes the linking of sequences is used to explain the structuring of the command part better.

Each sequence is associated with particular step symbols: the macro step.

This idea of "macro representation" is used to put the analysis into a hierarchy. Each level can be completed, modified, without involving the other levels again.

Macro steps are available for TSX57 PLCs.

The following illustration shows a Grafcet made up of 3 macro steps.

OUT

35015365.01 07/2008

199

Grafcet

Structure of a Macro Step

Description

Development

The graphic representation of a macro step is distinguished from a step by two horizontal lines.

The following illustration shows a macro step and its expansion.

OUT

The expansion of a macro step is characterized by two specific steps: z z an input step observing the same rules as the other steps, an output step which cannot have any associated actions.

When the macro step is active, development of the macro step observes the general

Grafcet development rules).

Example:

OUT

Macro step M1 is activated when step IN is active and its downstream transition condition is correct.

It is deactivated when its output step is active and the transition condition M1>2 is correct. Step 2 is then activated.

200

35015365.01 07/2008

Grafcet

Characteristics of macro steps

General characteristics

Illustration

The PL7 Grafcet language allows programming of 64 macro steps from M0 to M63.

Expanding a macro step, made up of one or more sequences, can be programmed on 8 pages at the most and includes a maximum of 250 steps plus the IN step and the OUT step.

A macro step can contain one or more macro steps. This hierarchy is possible up to

64 levels.

The analysis of an application can be structured in order to provide a more detailed global approach of the different operations to be performed.

1 3

OUT

To a detailed analysis

35015365.01 07/2008

201

Grafcet

Initial steps The expansion of a macro step can contain one or more initial steps.

These initial steps are activated when the machine is switched on or when a program is initialized. The macro step is then displayed in the active state.

In the example below initial step 1 of the expansion is activated when the program is initialized. The macro step is then in an active state.

OUT

202

35015365.01 07/2008

Grafcet

9.5 Grafcet section

Presentation

Contents of this section

This section shows how a Grafcet section is made up. It describes the use and programming rules for each process.

What's in this

Section?

This section contains the following topics:

Topic

Structure of a Grafcet section

Description of preliminary processing

Pre-setting the Grafcet

Initializing the Grafcet

Resetting the Grafcet to Zero

Freezing Grafcet

Resetting the Macro-Steps to Zero

Running sequential processing

Description of subsequent processing

Page

35015365.01 07/2008

203

Grafcet

Structure of a Grafcet section

How a section is made up

A section of program written in Grafcet is made up of three consecutive processes: z z z the preliminary process, the sequential process, the subsequent process.

The Grafcet section is programmed in the MAST task.

Illustration The following drawing shows the order the processes are scanned.

Preliminary processing

Sequential processing

Subsequent processing

Role of the processes

Processing

Preliminary

Sequential

Subsequent

The following table describes the role of each of the processes and the language with which they can be programmed.

Role

This is used to process: z z z initializations on a restart after a power or mechanical failure, initializations on a restart after a power or mechanical failure, the input logic.

Language

Contact, instruction list or text language

This is used to process the sequential framework of the application and gives access to transition conditions and actions directly associated with the steps.

Grafcet z z

This is used to process: the output logic, monitoring and indirect safeguards specific to outputs.

Contact, instruction list or text language

204

35015365.01 07/2008

Note: the macro steps are carried out in their scanning order in sequential processing.

Grafcet

35015365.01 07/2008

205

Grafcet

Description of preliminary processing

General points

System bits

Entered in contact language, instruction list language or structured text language, preliminary processing is scanned in its entirety from top to bottom.

It is run before the sequential and subsequent processes and is used to process all the events that have an effect on the following: z z managing power re-starts and re-initializations, resetting to zero or pre-positioning graphs.

Therefore it is only in the preliminary process that it can affect the bits associated with the steps (step bits %Xi or %Xi.j set to 0 or to 1 by the instructions SET and

RESET ).

Pre-positioning, initialization, freezing operations are done using system bits %S21 to %S24.

The system bits associated with Grafcet are classified numerically in order of priority

(%S21 to %S24), and so when several of them are simultaneously set to 1 in the preliminary processing, they are dealt with one by one in ascending order (only one is used per scanning revolution).

This bits are used at the beginning of sequential processing.

Processing cold re-starts

On a new application or when a system context has been lost, the system restarts from cold.

The bit %S21 is set to 1 by the system before calling up the preliminary processing and Grafcet is positioned on the initial steps.

If you want a particular process for the application when it is re-starting from cold, it is possible to test % S0 which remains at 1 during the first cycle of the master task

(MAST).

Processing cold re-starts

Following a power failure without changing the application, the system re-starts from cold. It starts again from where it was before the power failure.

If you want a particular process for the application in the case of a cold re-start, you can test %S1 in the preliminary process and call up the corresponding program.

206

35015365.01 07/2008

Grafcet

Pre-setting the Grafcet

Role

Pre-setting the

Grafcet

Pre-setting the Grafcet can be used when switching from a normal running operation to a specific running operation or when an incident appears (e.g.: fault causing the

PLC to run in downgraded mode).

This operation takes place during the normal run of an application cycle. Therefore it must be done carefully.

The setting can have an effect on all or part of the sequential process: z z by using the instructions SET , RESET , by a general reset to zero (%S22) then, in the following cycle, setting the steps to

Note: where a step is reset to zero, the deactivation actions for this are not carried out.

Example In this example setting bit %M20 to 1 causes steps %X12 to be pre-set to 1, steps

%X10 and %X11 to 0.

%M20

%X12

%X10

%X11

35015365.01 07/2008

207

Grafcet

Initializing the Grafcet

Role

Initializing the

Grafcet

Initializing the Grafcet is done by the system bit %S21.

Normally set at state 0, setting %S21 to 1 causes: z z active steps to deactivate, initial steps to activate.

The following table gives the different possibilities for setting to the system bit %S21 to 1 and 0.

Set to 1 Reset to 0 z z z

By setting %S0 to 1

By the user program

By the terminal (in debugging or animation table) z z z

By the system at the beginning of the process

By the user program

By the terminal (in debugging or animation table)

Rules for use When it is managed by the user program, %S21 must be set to 0 or 1 in the preliminary process.

208

35015365.01 07/2008

Grafcet

Resetting the Grafcet to Zero

Role Resetting the Grafcet to 0 is done by the system bit %S22.

Normally at state 0, setting %S22 to state 1 deactivates the active steps of the overall sequential processing.

Note: the RESET_XIT function reinitializes by program the activation times of all the sequential processing steps (See Reference Manual, Volume 2).

Resetting the

Grafcet to Zero

The following table gives the different possibilities for setting the system bit %S20 to

1 and 0.

Set to 1 z z

By the user program

By the terminal (debug or animation table)

Reset to 0 z By the system at the end of the sequential processing

Rules of Use z z this bit must be written to 1 in the preliminary processing, resetting %S22 to 0 is managed by the system. It is therefore unnecessary to reset it to 0 by program or by the terminal.

To restart the sequential processing in a given condition, you must allow for an initialization or pre-setting procedure for the Grafcet depending on the application.

35015365.01 07/2008

209

Grafcet

Freezing Grafcet

Role Freezing the Grafcet is done by the system bit %S23.

Normally set at 0, setting %S23 to 1 causes the Grafcet state to be maintained.

Whatever the value of the transition conditions downstream of the active steps, the

Grafcets do not develop. The freeze is maintained as long as bit %S23 is set to 1.

Freezing Grafcet The following table gives the different possibilities for setting to the system bit %S23 to 1 and 0.

Set to 1 z z

By the user program

By the terminal (in debugging or animation table)

Reset to 0 z z

By the user program

By the terminal (in debugging or animation table)

Rules for use z z managed by the user program, this bit must be set to 1 or 0 in the preliminary process, bit %S23 associated with bits %S21 and %S22 are used to freeze the sequential treatment at the initial state or at 0. In the same way the Grafcet can be set and then frozen by %S23.

210

35015365.01 07/2008

Grafcet

Resetting the Macro-Steps to Zero

Role Resetting the macro-steps to zero is done by the system bit %S24.

Normally at state 0, the resetting of %S24 to state 1 causes the resetting to zero of the macro-steps selected in a table of 4 system words (%SW22 to %SW25).

Note: the RESET_XIT function reinitializes by program the activation times of the steps of the macro-steps (See Reference Manual, Volume 2).

Resetting the

Macro-Steps to

Zero

The following table gives the different possibilities for setting the system bit %S24 to

1 and 0.

Set to 1 z By the user program

Reset to 0 z By the system at the processing start

Rules of Use z z this bit must be written to 1 only in the preliminary processing, setting %S24 to 0 is managed by the system. It is therefore forbidden to reset it to 0 by program or by the terminal.

35015365.01 07/2008

211

Grafcet

Word Table

%SW22 to

%SW25

A macro-step corresponds to every bit in this table. Using the table is as follows: z z loading of the word table %SW22 to %SW25 (bit to be set to 1 when the corresponding macro-step must not be set to zero), validation by %S24.

The following illustration shows the coding of words %SW22 to %SW25.

%SW22 F

XM15

XM1

XM0

%SW23 F

XM31

XM17 XM16

XM63

%SW25 0

XM49 XM48

Example:

! IF %I4.2 AND %T3.D THEN

%SW22:=16#AF8F;

%SW23:=16#F3FF;

%SW24:=16#FFEF;

%SW25:=16#FFFF;

SET %S24

These four words are initialized at 16#FFFF if %S21 = 1.

212

35015365.01 07/2008

Grafcet

Running sequential processing

General points

Phase 1

This process is used to program the sequential framework of the application.

Sequential processing includes: z z the main graph organized into 8 pages, up to 64 macro steps each from 8 pages.

In the main graph, several unconnected Grafcets can be programmed and run simultaneously.

The Grafcet is made up in 3 large phases.

The following table describes the operations carried out in the first phase.

Phase

Description

Evaluating the transition conditions of validated transitions.

Request to deactivate the associated upstream steps.

Request to activate the downstream steps concerned

Phase 2 Phase 2 corresponds to developing the Grafcet situation according to the transitions crossed:

Phase

Description

Deactivating the upstream steps of the transitions crossed.

Activating the downstream steps of the transitions crossed.

Invalidating the transitions crossed.

Validating the transitions downstream of the new activated steps.

Result: The system updates two tables dedicated respectively to the activity of the steps and the validity of the transitions: z the step activity table stores the active steps, the steps to be activated and the steps to be deactivated for the current cycle, z the transition validity table stores the transitions downstream of the steps affected by the previous table for the current cycle

35015365.01 07/2008

213

Grafcet

Phase 3

Exceeding capacity

The actions associated with active steps are carried out in the following order:

Phase

Description

Actions to deactivate the steps to be deactivated.

Actions to activate the steps to be activated.

Actions to continue active steps.

The number of elements in a steps activity table and transition validity table can be configured.

Exceeding the capacity of one or the other leads to: z z z the PL7 switching to STOP (stopping the application running), the system bit %S26 switching to 1 (exceeding the capacity of one of the two tables), the ERR light on the PL7 flashing.

The system provides the user with two system words: z z

%SW20: a word which is used to inform the current cycle of the number of active steps, to be activated and deactivated.

%SW21: a word which is used to inform the current cycle of the number of valid transitions to be validated or invalidated.

Diagnostics

In the case of a blocking fault, the system words % SW125 - %SW127 are used to determine the nature of the fault.

%SW125

DEF7

DEFE

%SW126 %SW127

0 = 0

= 0 0

Step no.

Macro step no. or

64 for the main graph

Exceeding the step table (steps/transitions)

Exceeding the transition table

Running the wrong graph (transition problem with unresolved destination connector).

214

35015365.01 07/2008

Grafcet

Description of subsequent processing

General points Entered in contact language, instruction list language or structured text language, subsequent processing is scanned from top to bottom.

This process is the last one run before activating the outputs and is used to program the output logic.

Actions associated with

Grafcet

Subsequent processing is used to complete the set points issued by the sequential process by integrating the running and stopping methods and the indirect safeguards specific to the action with the output equation.

It is also used to process an output activated several times in the sequential process.

Generally it is recommended that actions which have a direct effect on the process should be programmed in the subsequent process.

Example:

%I2.4

%X5

%X8

%X59

%M26 %I1.0

%Q4.1

Actions independent of

Grafcet z z z

12.4 = indirect safeguard specific to controlling output %Q4.1.

%M26 = internal bit resulting from the input logic dealing with the running and stopping modes.

%I1.0 = push button.

Output %Q4.1 is activated by steps 5, 8 and 59 of the sequential process.

Subsequent processing is also used to program outputs that are independent of sequential processing.

35015365.01 07/2008

215

Grafcet

Checking the running of

Grafcet

It may turn out to be necessary to check the proper running of Grafcet by testing the activity time of certain steps. Testing this time is done by comparing either with a minimum value or with a maximum value determined by the user.

Using the default is left up to the user (indications, special operating procedure, editing messages).

Example:

! IF (%X2.T > 100 AND %X2) THEN SET %Q4.0 ;END_IF ;

216

35015365.01 07/2008

DFB function blocks

Presentation

Subject of this chapter

What's in this

Chapter?

This chapter describes how to program DFB user function blocks.

This chapter contains the following topics:

Topic

Presenting DFB function blocks

How to set up a DFB function block

Defining DFB type function block objects

Definition of DFB parameters

Definition of DFB Variables

Coding rules for DFB types

Creating DFB Instances

Rules for using DFBs in a program

Using a DFB in a ladder language program

Using a DFB in a program in instruction list or text language

Running a DFB instance

Example of how to program DFB function blocks

Page

35015365.01 07/2008

217

DFB function blocks

Presenting DFB function blocks

Role Pro PL7 software offers the user the possibility of creating his own function blocks corresponding to the specific needs of his applications.

These user function blocks are designed for structuring an application. They will be used when a programming sequence is repeated several times within an application, or to freeze standard programming (e.g.: command algorithm for a motor including taking local safeguards into account).

They can be transmitted to all the programmers and used in the same application or in any other application (export/import function).

Examples of use Using a DFV function block in an application allows you to: z z z z simplify the program design and entries, increase the readability of the program, enable debugging (all the variables changed by the DFB type are identified on its interface), reduce the amount of code generated (the code corresponding to the DFB is only changed once, however many calls there are on the DFB in the program).

Comparison with the sub-program.

In relation to the sub-program they enable: z z z the parameters of the process to be set more easily, the internal variables belonging to the DFB and therefore independent of the application to be used, testing independent of the application.

They offer a graphic display of the block in ladder language, making programming and debugging easier.

Also, DFB function blocks use residual data.

Areas of use The table below describes the DFB areas of application.

Function

PL7s the DFBs can be used with.

DFB creation software

Area

Premium

PL7 Pro

Software the DFBs can be used with.

Pro PL7 or Junior PL7

Programming language used to create DFB code. structured text language and ladder

Programming languages the DFBs can be used with.

ladder, structured text and instruction list

218

35015365.01 07/2008

DFB function blocks

How to set up a DFB function block

Procedure Setting up a DFB function block is done in 3 main steps:

Step

Action

Designing the DFB model (called: DFB Type).

Creating an image of this block called instance for using each time in the application.

Using the instance in the PL7 program.

Designing the

DFB type

Consists of defining and coding all the elements that make up the DFB model, using the DFB editor.

The following illustration shows how a DFB model is made up.

DFB type name

Inputs Outputs

Inputs/

Outputs

Public variables

Private variables

Code

A DFB type function block is made up: z z z z z z of a name, parameters: z inputs, z z outputs, inputs/outputs, variables: z public variables, z private variables, code in structured text language or ladder, comments, a descriptive form.

35015365.01 07/2008

219

DFB function blocks

Creating a DFB instance

Using the DFBs

Once the DFB type is designed the user defines a DFB instance using a variables editor or when calling up the function in the program editor.

This block instance is used next as a standard function block in ladder language or as an elementary function in structured text language or instruction list language.

It can be programmed in the various tasks (except in event tasks) and sections of the application.

220

35015365.01 07/2008

DFB function blocks

Defining DFB type function block objects

General characteristics of DFB objects

These objects are internal DFB data. They can be purely symbolic (no addressing under address form).

DFBs use 2 types of object: z z parameters variables

Syntax For each parameter or variable used, the designer of the DFB type function block defines: z z z z a name with a maximum of 8 characters (non-accented letters, figures, the character "_", are allowed. The first character must be a letter; key words and symbols are not allowed), an object type (see table below), an optional comment with up to 80 characters, an initial value (except for Input/Output parameters).

35015365.01 07/2008

221

DFB function blocks

Types of objects The table below describes the list of different object types possible when declaring the parameters and variables for the DFB type.

Type Name Examples Action on…

Bits

Words

Tables

BOOL

EBOOL

Boolean

Extended

Boolean

The BOOL type does not manage the edges. If edge management is not necessary in the process it is preferable to use the BOOL type.

Example of a BOOL type object in PL7 language:

%MWi:Xj which does not manage the edges but which takes up less memory than the EBOOL type.

The EBOOL type manages the edges. Therefore it is possible to run RE and FE edge instructions on this type of parameter or variable.

if you wish to associate an EBOOL type with an input/output parameter when it is being used, it must be an EBOOL type in the DFB.

Example of a EBOOL type object in PL7 language:

%Mi,%Ixy.i,%Qxy.i.

WORD

DWORD

REAL

AR_X

AR_W

AR_D

All 16 bits

All 32 bits

Real

Bit table

Example of a WORD type object in PL7 language:

%MWi, %KWi,

Example of a DWORD type object in PL7 language: %MDi, %KDi,

Example of a REAL type object in PL7 language:

%MFi, %KFi

Example of an AR_X type object in PL7 language:

%Mi:L, %Ix.i:L

Table of all 16 bits

Example of an AR_W type object in PL7 language:

%MWi:L, %KWi:L

Table of all 32 bits

Example of an AR_D type object in PL7 language:

%MDi:L, %KDi:L

AR_R Table of reals Example of an AR_R type object in PL7 language:

%MFi:L, %KFi:L

STRING Character string

Example of a STRING type object in PL7 language:

%MBi, %KBi

222

35015365.01 07/2008

DFB function blocks

Note: z tables: the length of a table must be mentioned for outputs and public and private variables, on the other hand it is not necessary to define them for input parameters and input/output parameters.

z the initial values can be defined for inputs (if they are not table type), for outputs and for public and private variables.

35015365.01 07/2008

223

DFB function blocks

Definition of DFB parameters

Illustration The following illustration shows examples of parameters

Inputs Check

DWORD

Gap

WORD

Speed

BOOL

Enable

WORD

Actions

WORD

Accel

BOOL

Error

Outputs

Inputs/

Outputs

Description of parameters

The table below describes the role of each type of parameter.

Parameter Maximum number

Inputs 15 (1)

Role

This is data to be supplied to the DFB by the application program.

These read only parameters cannot be modified in the DFB code.

Outputs 15 (2)

Inputs/ outputs

This is data calculated by the DFB to be sent to the application program.

These are input parameters which can be modified in the DFB code.

Key:

(1) Number of inputs + Number of inputs/outputs less than or equal to 15

(2) Number of outputs + Number of inputs/outputs less than or equal to 15 z z

Note: all the DFB block must have at least one Boolean input.

it is only possible to modify a DFB interface (public variables or parameters) if it is not instanced and used in the application.

224

35015365.01 07/2008

DFB function blocks

Definition of DFB Variables

Description of

Variables

The table below describes the role of each type of variable.

Variable Maximum number

Public 100

Role

Internal variables used in the process which can be accessed by the user for adjustment or by the application program outside the

DFB code (for a DFB instance public variable, see below:

Accessing public variables).

Private 100 Internal variables in function block code. These variables are calculated and used right inside the DFB but do not have any link with the outside of the DFB.

These variables are useful for programming the block but are of no interest for the user of the block (e.g.: intermediate variable for sending back one combination expression to another, result of an intermediate calculation, etc.).

Note: it is only possible to modify a DFB interface (public variables or parameters) if it is not instanced and used in the application.

Accessing

Public Variables.

Only output parameters and public variables can be accessed as objects in the application program and outside the function block body.

Their syntax is as follows:

Name_DFB.Name_parameter

Or Name_DFB is the name given to the DFB instance used (32 characters maximum) and Name_parameter is the name given to the output parameter or the public variable (8 characters maximum).

Example: Gap.check

for the gap output of the DFB instance named Check .

35015365.01 07/2008

225

DFB function blocks

Saving and

Restoring Public

Variables

Public variables, modified by the program or by adjustment, can be saved in the location and sets initialization values (defined in the DFB instances) by setting system bit %S94 to 1.

Replacement only takes place if authorization for it has been given at the level of each variable by validating the S field in the DFB public variables definition screen.

These saved values are re-applied by setting system bit %S95 to 1 or by reinitializing the PLC.

It is possible to disable the " Save/Restore " function globally for all DFB function blocks (dialogue box Properties of DFB types ).

226

35015365.01 07/2008

DFB function blocks

Coding rules for DFB types

General points

Programming rules

The code defines the processing the DFB block must carry out depending on the parameters declared.

The DFB function block code is programmed in text or ladder language.

As far as text language is concerned, the DFB is made up of a single text sequence of unlimited length.

All language instructions and advanced functions are permitted except for: z z z z z z calling up standard function blocks, calling up other DFB function blocks, connecting to a JUMP label, calling up a sub-program, the HALT instruction, instructions using input/output module variables (e.g.: READ_STS , SMOVE ...).

The code uses DFB parameters and variables defined by the user.

The DFB block function code cannot use either input/output objects (%I,%Q...), or global application objects (%MW,%KW...) except for the system bits and words %S and %SW.

Note: it is not possible to use a label

Specific functions

The table below describes functions that have been specifically adapted to be used in the code.

Functions Role

FTON, FTOF, FTP, FPULSOR These timing functions are meant to be used instead of standard timing function blocks.

LW, HW, COCATW These instructions are used to manipulate words and double words.

LENGTH_ARW, LENGTH_ARD,

LENGTH_ARR

These instructions are used to calculate the length of tables.

35015365.01 07/2008

227

DFB function blocks

Example of the code

The following program gives an example of text code

CHR_200:=CHR_100;

CHR_114:=CHR_104;

CHR_116:=CHR_106;

RESET START;

(*CHR_100 is incremented 80 times*)

FOR CHR_102:=1 TO 80 DO

INC CHR_100;

WHILE((CHR_104-CHR_114)<100)DO

IF(CHR_104>400) THEN

EXIT;

END_IF;

INC CHR_104;

REPEAT

IF(CHR_106>300) THEN

EXIT;

END_IF;

INC CHR_106;

UNTIL ((CHR_100-CHR_116)>100)

END_REPEAT;

END_WHILE;

(*Loop continues as far as CHR_106)

IF (CHR_106=CHR_116)

THEN EXIT;

ELSE

CHR_114:=CHR_104;

CHR_116:=CHR_106;

END_IF;

END_FOR;

INC CHR_200;

228

35015365.01 07/2008

DFB function blocks

Creating DFB Instances

General

Rules

A DFB instance is a copy of the DFB type: z z it uses the DFB type code (there is no duplication of the code), it creates a field for specific data for this instance which is a copy of the parameters and variables of the DFB type. This field is in the given space in the application.

Each DFB instance is located by a name of no more than 32 characters defined by the user.

The characters allowed are identical to those allowed for symbols, i.e. the following are allowed: z z z non-accented letters, figures, the character "_".

The first character must be a letter; key words and symbols are not allowed.

It is possible to create as many instances as you wish, using the same DFB type.

However, the number of DFB instances must not use more than 32 K words of the

PLC's internal memory.

The initial values of the public variables defined for DFB type function blocks can be modified for each instance.

35015365.01 07/2008

229

DFB function blocks

Rules for using DFBs in a program

General points DFB instances can be used in all languages (ladder, text and instruction list) and in all parts of the application: sections, sub-programs, Grafcet modules (except in event tasks).

General rules for use

The following rules must be observed whatever language used: z z z all the table type input parameters as well as input/output parameters must be entered.

input parameters which have not been hardwired keep the value of the previous call or the initialization value if the block has never been called before this input has been made or hardwired.

all the objects assigned to input, output and input/output parameters must be of the same type as those defined when the DFB type was set up (e.g.: if the WORD type is defined for the "speed" input parameter, the double words %MDi, %KDi are not allowed to be allocated to it).

The only exceptions are the BOOL and EBOOL types for input or output parameters (not for input/output parameters) which can be mixed.

Example : the "Validation" input parameter can be defined as BOOL and can be associated with an internal bit %Mi which is an EBOOL type. On the other hand, in the internal code of the DFB type, the input parameter will have BOOL type properties. It cannot manage edges.

230

35015365.01 07/2008

Allocating the parameters

DFB function blocks

The following table summarizes the different parameter allocation possibilities in the various programming languages:

Parameter

Inputs

Inputs/

Outputs

Type

Boolean

Numeric

Table

Boolean

Numeric

Table

Boolean

Numeric

Table

Parameter allocation

Hardwired (1)

Object or expression

Object

Hardwired (1)

Object

Allocation optional (2) optional compulsory compulsory compulsory compulsory optional optional optional

(1) hardwired in ladder, or object in Boolean or text language

(2) in ladder, any DFB block must have at least one hardwired Boolean (binary) input.

35015365.01 07/2008

231

DFB function blocks

Using a DFB in a ladder language program

Principle

Example

There are two ways of calling up a DFB function block: z z a text call in an operation block, the syntax and the constraints on the parameters are the same as those in text language.

a graphic call, see the example below.

Graphic DFB function blocks have inputs/outputs which are assigned directly by objects or expressions. These objects or expressions take up one cell in the graphic network.

2 DFB function blocks connected in series must be separated by at least 2 columns.

The following illustration shows a simple example of how to program a DFB.

%Q2.5

ABS(%MD0)

10000

%MW100

Control_port_1

Check

DWORD

Gap

WORD

Accel

WORD

Speed

BOOL

Error

BOOL

Enable

WORD

Actions

%MW8

%MW100

%Q2.1

232

35015365.01 07/2008

DFB function blocks

The table below locates the different elements of the DFB.

Address Role

1 Name of the DFB

Name of the DFB type

Effective parameter for the first input

Input parameters (name and type)

Output parameters (name and type)

Input/output parameters (name and type) z z

Note: a DFB function block must have at least one hardwired Boolean input.

the numerical inputs, outputs or inputs/outputs of the block are not hardwired.

The objects mentioned in the cell opposite the contact are associated with these contacts.

233

DFB function blocks

Using a DFB in a program in instruction list or text language

General points

General syntax

Calling up the DFB function block constitutes an action which can be put in a sequence just like any other action in the language.

The DFB programming syntax is as follows:

DFB_Name

(E1,...,En,ES1,...,ESn,S1,...,Sn);

The following table describes the role of the instruction parameters.

Parameters

E1, ..., En

ES1, ..., ESn

S1, ..., Sn

Role

Expressions (except for BOOL/EBOOL type objects), objects or immediate values using effective parameters for input parameters.

Effective parameters corresponding to inputs/outputs. They are always read/write language objects.

Effective parameters corresponding to outputs. They are always read/write language objects.

Text syntax

Instruction list syntax

Instructions in text language have the following syntax:

Name_DFB (E1,...,En,ES1,...,ESn,S1,...,Sn);

Example: Cpt_bolts(%I2.0,%MD10,%I2.1,%Q1.0);

Instructions in instruction list language have the following syntax:

[Name_DFB (E1,...,En,ES1,...,ESn,S1,...,Sn)]

Example:

LD TRUE

[Cpt_bolts(%I2.0,%MD10,%I2.1,%Q1.0)]

234

35015365.01 07/2008

DFB function blocks

Running a DFB instance

Operation Running a DFB instance is done in the following order:

Step

Action

Loading the input and input/output parameters using the actual parameters.

Any input left free takes on the initialization value defined in the DFB type when being initialized or starting from cold, then the current value of the parameter.

Going through input parameter values (except for table type).

Going through input/output parameter addresses.

Running the text code.

Writing the output parameters.

Debugging tools PL7 software offers several debugging tools for the PL7 program and the DFBs: z z z animation table: all parameters and public variables are displayed and animated in real time. It is possible to modify and force required objects, break point, step by step and diagnostic program, operating screens: for unit debugging.

35015365.01 07/2008

235

DFB function blocks

Example of how to program DFB function blocks

General points

DFB type characteristics

This example is given in a technical capacity. The DFB to be programmed is a counter.

The counter is made up from the following DFB type:

Counter_parts

EBOOL

Reset to zero

DWORD

Presel

EBOOL

Count

DWORD

V_current

BOOL

Done

The table below describes the characteristics of the DFB type to be programmed.

Characteristics

Name

Inputs

Outputs

Public variable

Values

Counter_parts z z z

Reset to zero

Presel

Count

: resetting the counter to zero

: value of counter preselection

: input count

Done : output value of the preselection

V_cour : Current variable incremented by the input Count

236

35015365.01 07/2008

Counter operation

DFB code

DFB function blocks

The following table describes the functions that the counter must have.

Phase

Description

This block counts the rising edges on the input Count .

The result is put in the variable V_curr , this value is reset to zero by a rising front on the input Reset to zero .

Counting is done up to the preselected value. When this value is reached the output Done is set to 1, it is reset to 0 on the rising edge on the input Reset to zero .

Programming a DFB type code is given below.

!(*Programming DFB counter_parts*)

IF RE Reset to zero THEN

V_curr:=0;

END_IF;

IF RE Count THEN

V_curr:=V_curr+1;

END_IF;

IF(V_curr>=Presel) THEN

SET Done;

ELSE

RESET Done;

END_IF;

Example of use In this example, the DFB type created is used 3 times (3 DFB instances) for counting

3 types of parts.

When the number of parts programmed (in words %MD10, %MD12, and %MD14) is reached, the counter output stops the supply system of the corresponding parts.

35015365.01 07/2008

237

DFB function blocks

The following program uses 3 instances of DFB type Counter_parts: Counter_bolts,

Counter_nuts, Counter_screws.

Counter_bolts

%I1.0

%Q2.1

Counter_parts

EBOOL

Reset to zero

BOOL

Done

%MD10

%I1.1

DWORD

Presel

EBOOL

Count

%I1.2

%I1.3

%MD12

Counter_nuts

Counter_parts

EBOOL

Reset to zero

BOOL

Done

DWORD

Presel

EBOOL

Count

%Q2.2

%I1.4

%I1.5

%MD14

Counter_screws

Counter_parts

EBOOL

Reset to zero

BOOL

Done

DWORD

Presel

EBOOL

Count

%Q2.3

238

35015365.01 07/2008

Index

A

Action, 188

Action for activating, 190

Addressing

AND convergences, 172, 173

AND divergences, 172, 173

Arithmetic

instruction, 151

B

Bit

Bits

object, 29

memory, 62

C

Cold start, 80

Comments, 186

Grafcet, 186

Comments on

instruction list, 133

Contact language, 116

35015365.01 07/2008

Contact network, 117

comments, 119

Label, 118

Continuous action, 191

Conversion

instruction, 156

Cyclic

run, 97

D

Destination connector, 182

DFB function block, 218

DFB instances, 229

Directed link, 185

E

Event

processing, 93, 108

EXIT, 164

F

Fast

task, 92

FOR...END_FOR, 163

Freezing Grafcet, 210

A C

239

Index

Function block

object, 44

Function Module, 110

Function modules, 23

G

Grafcet, 171

Grafcet objects, 53, 174

Grafcet page, 176, 179

Grafcet section, 204

Grafcet symbols, 172

Graphic elements, 120

I

IF...THEN, 159

Indexed

object, 50

Initializing the Grafcet, 208

Instruction

Instruction list, 130

label, 132

sequence, 131

Instructions

Instruction list, 134

Instructions for

character strings, 153 tables, 153

L

Label

text, 148

Language

Structured text, 146

Logic

instruction, 151

240

M

Master

Memory

Micro

O

Object

Boolean, 26

Word, 27

OR convergence, 180

OR divergence, 180, 181

Output Step, 200

P

Periodic

Run, 99

PL7, 16

languages, 17

PL7 object language, 25

PL7 Software, 16

Power cut, 76

Power restoration, 76

Preliminary processing, 206

Premium

memory, 60, 70, 72

Pre-setting the Grafcet, 207

Presymbolization, 56

Programming

Contact network, 123

R

REPEAT...END_REPEAT, 162

35015365.01 07/2008

Index

Resetting the Grafcet to Zero, 209

Resetting the Macro-Steps to Zero, 211

Running

Contact networks, 126

Running a text program, 165

S

Section, 21, 88

Sequence

text, 147

Sequential processing, 213

Source connector, 182

Subsequent

T

Table, 47

Task, 21

Text

comments, 149

Transition conditions, 193

TSX 37

memory, 65

TSX 57

memory, 70, 72

TSX57

memory, 60

W

Word

35015365.01 07/2008

241

Index

242

35015365.01 07/2008

Hello! I've reviewed the Schneider Electric PL7 Micro, Junior, and Pro Reference Manual. This document explains how to program these PLCs using ladder logic, instruction lists, structured text, and Grafcet. I can answer your questions about object addressing, memory structures, operating modes, and more. Ask me anything!

Show related prompts

Assistant typing

Assistant is out of keyboard. Please, try again later.

It looks like you''ve reached a document that is written in multiple languages, including one that isn''t your native language. You can use the following links to temporarily hide pages without the language you prefer.

Key features

Multiple programming languages (Ladder, Instruction List, Structured Text, Grafcet)
Support for Micro, Junior, and Pro PLC versions
Detailed object addressing and memory management
Explanation of multitasking and operating modes
Compliance with IEC 1131-3 standard

Frequently asked questions

PL7 supports Ladder, Instruction List, Structured Text, and Grafcet.

PL7 has versions for Micro, Junior, and Pro PLCs.

PL7 offers both mono-task and multi-task structures, the latter including a master task, a fast task, and priority event processes.

PL7's compliance with IEC 1131-3 ensures portability and interoperability with other PLC programming systems conforming to the standard.

Reference manual

PL7 Micro/Junior/Pro

Description of the PL7 software

Document Set

Table of Contents

Chapter 1

Chapter 2

Chapter 3

Chapter 4

Chapter 5

Chapter 6

Chapter 7

Chapter 8

Chapter 9

Chapter 10

About the Book

At a Glance

Description of PL7 software

Presentation

Introducing PL7 software

Presentation

Presentation of PL7 Software

Presenting PL7 languages

PL7 software structure

Function modules

Description of PL7 object language

Presentation

Definition of the Main Boolean Objects

Definition of Main Word Objects

Addressing bit objects

Addresing input/output module objects for the TSX 37

Addressing input/output module objects in rack

Addressing of Remote Module Language Objects on a FIPIO Bus

Addressing of language objects associated with AS-i bus

Addressing word objects

Overlay rules

Function block objects

Table type PL7 objects

Indexed objects

Grafcet objects

Symbolizing

Presymbolized objects

User memory

Presentation

Memory structure of Micro PLCs

Memory structure for Premium PL7s

Description of bits memory

Word memory outline

Characteristics of TSX 37 PL7 memory

Memory characteristics of TSX/PCX 57 10/15/20/25/26/28 PLCs

Characteristics of TSX/PCX 57 30/35/36 PL7 memories

Characteristics of TSX 57 453/4823 PL7 memory

Operating modes

Presentation

Dealing with power cuts and power restoration

Dealing with a warm restart

Dealing with a cold start

Software structure

Presentation

5.1

Description of tasks

Presentation

Presenting the master task

Description of sections and subroutines

Presenting the fast task

Presenting event processing

5.2

Mono task structure

Presentation

Mono task software structure

Cyclic run

Periodic run

Checking cycle time

5.3

Multi task structure

Presentation

Multitask software structure

Sequencing tasks in a multitask structure

Assigning input/output channels to master and fast tasks

Exchanging inputs/outputs in event processes