LICENSE.txt 1.9 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647
  1. https://opcfoundation.org/license/source/1.11/index.html
  2. License information for OPC Source Deliverables
  3. A. Introduction
  4. The OPC Foundation provides source code as sample code/reference
  5. implementation. The source code is provided as-is, with no warranty,
  6. support, or misrepresentation of the quality of code.
  7. The OPC Foundation provides communication stacks, sample libraries,
  8. sample applications and utilities. All sources are available either as a
  9. downloadable ZIP file or in a repository on github
  10. (https://github.com/OPCFoundation/ <https://github.com/OPCFoundation/>).
  11. B. License models
  12. The OPC Foundation provides different licenses depending on the
  13. component and on the membership status of the user of the sources. A
  14. single ZIP file or a single repository can contain multiple components
  15. where the sources have different license models. The valid license is in
  16. the header of each source file.
  17. Following are basic rules on how the OPC Foundation licenses the
  18. different components:
  19. 1. OPC UA core components (OPC UA Stacks, OPC UA Local Discovery Server
  20. - LDS) follow a dual-license model:
  21. * *OPC Foundation Corporate Members*: RCL
  22. <https://opcfoundation.org/license/rcl.html>
  23. enables OPC Foundation corporate members to deploy their
  24. applications using the core component sources without being
  25. required to disclose the application code.
  26. * *Users that are not OPC Foundation corporate-members*: GPL 2.0
  27. <https://opcfoundation.org/license/gpl.html>
  28. Based on the GPL 2.0 license terms these users must disclose
  29. their application code when using the core component sources.
  30. 2. Samples and Utilities:
  31. All samples and most of the utilities are provided under the MIT
  32. license <https://opcfoundation.org/license/mit.html> for OPC
  33. Foundation Members and Non-Members.