The discrete interactions in a system are conceptually represented by finite state machines (FSM) and petri nets (PN).
One of the mathematical modeling languages for the description of distributed systems is the Petri net, often known as a place/transition (PT) net. It belongs to the discrete event dynamic system class. A Petri net is a directed bipartite graph with locations and transitions as its two types of members. White circles are used to represent place elements, whereas rectangles are used to represent transition elements.
Tokens, which are represented as black circles, can be found anywhere. If at least one token is present at every site connected to a transition as an input, the transition is enabled. According to some sources[1], Carl Adam Petri created Petri nets in August 1939 when he was just 13 years old in order to describe chemical reactions.
To know more about system click here:
https://brainly.com/question/27148473
#SPJ4
