Research Article

Efficient address space generation for an OPC UA server

  1. Alina Girbea1,*,
  2. Septimiu Nechifor2,
  3. Francisc Sisak1,
  4. Liviu Perniu1

Article first published online: 12 APR 2011

DOI: 10.1002/spe.1076

Issue

Software: Practice and Experience

Software: Practice and Experience

Volume 42, Issue 5, pages 543–557, May 2012

Additional Information

How to Cite

Girbea, A., Nechifor, S., Sisak, F. and Perniu, L. (2012), Efficient address space generation for an OPC UA server. Softw: Pract. Exper., 42: 543–557. doi: 10.1002/spe.1076

Author Information

  1. 1

    Department of Automatics, Faculty of Electrical Engineering and Computer Science, Transilvania University of Braşov, Braşov, Romania

  2. 2

    Corporate Technology, PSE Siemens Romania, Braşov, Romania

*Department of Automatics, Faculty of Electrical Engineering and Computer Science, Transilvania University of Braşov, Braşov, Romania

Publication History

  1. Issue published online: 2 APR 2012
  2. Article first published online: 12 APR 2011
  3. Manuscript Accepted: 20 FEB 2011
  4. Manuscript Revised: 8 FEB 2011
  5. Manuscript Received: 22 NOV 2010

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

View Full Article (HTML) Get PDF (885K)

Keywords:

  • OPC UA server;
  • address space;
  • information model;
  • automatic generation;
  • maintenance;
  • data source

SUMMARY

The new OPC Unified Architecture has been introduced as a replacement for the existing COM-based specifications. The article describes a generalized algorithm for the automatic generation of the address space structure for an UA server. First, we present the general startup procedure of an OPC UA server, focusing on the address space generation step. Afterwards we introduce specialized algorithms for the generation of the type nodes, of object, variable, method and view nodes. Finally the additional references are added to the fully meshed address space. The basic ideas of the algorithms are: the splitting of the nodes into groups and the sequential addition of the groups to the address space, and the naming of a main reference for every target node. The algorithms have been applied for an aggregating UA server which models the devices of an assembly line. The main advantages are: shorter development time, easier maintenance and the possibility to add nodes to the address space in both online and offline mode. Copyright © 2011 John Wiley & Sons, Ltd.

View Full Article (HTML) Get PDF (885K)