Skip to Main Content
AVEVA™ PI System™ Feedback Portal

Welcome to our new feedback site!


We created this site to hear your enhancement ideas, suggestions and feedback about AVEVA products and services. All of the feedback you share here is monitored and reviewed by the AVEVA product managers.

To start, take a look at the ideas in the list below and VOTE for your favorite ideas submitted by other users. POST your own idea if it hasn’t been suggested yet. Include COMMENTS and share relevant business case details that will help our product team get more information on the suggestion. Please note that your ideas and comments are visible to all other users.


This page is for feedback specifically for AVEVA PI System. For links to our other feedback portals, please see the tab RESOURCES below.

Status No Status
Created by tinklerj
Created on Aug 20, 2022

XOR operator for expression analyses

AF (and PE) expressions currently have AND and OR operators. These work either logically or (if both operands are integer) in a bitwise fashion. There should also be an XOR operator that works the same way, to avoid the messy construct (A AND NOT B) OR (B AND NOT A). Also, since NOT only returns true/false (rather than complement if an integer) there is no way to implement XOR in a bitwise fashion. So functions or operators ('~' anyone?) to do one's and two's complement would be useful too.
  • Attach files
  • Kenneth Barber
    Reply
    |
    Aug 20, 2022
    For Boolean (logical) operands A and B, A XOR B is the same as A <> B. That is probably why many programs do not include XOR. In what cases would bitwise operations of any sort be useful in PI? Why are bitwise XOR, one's complement, and two's complement of particular interest?