Abstract
Fuzzy Switch Graphs (FSGs) are reactive fuzzy graphs that model systems in which accessibility relations and fuzzy values are changed whenever an edge is crossed [19]. Reversal Fuzzy Switch Graphs (RFSGs) were presented in [6] and model fuzzy reactive systems which provide the activation and deactivation of resources, a functionality that FSGs do not offer [19]. Activation and deactivation of arrows in a switch graph makes its applicability wider in fields like computer science and engineering. In this sense, the definition of operations for RFSGs is an important issue, since it enables to understand the algebraic structure of these graphs and allows to generate new model of systems from the previous one. This paper introduces some aggregation-based operations: union, intersection and extension for RFSGs. For each operation, the paper verify some properties. It ends with an application for engineering.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
