Truly concurrent behavioral equivalences, such as history-preserving bisimilarity [1]}, [2]}, [3]} or, equivalently,
fully-concurrent bisimilarity [4]},
have been advocated by many as suitable relations to compare the behavior of distributed systems, in particular of Petri nets [5]}, [6]},
because they respect not only the branching structure
of systems (being based on the concept of bisimulation [7]}, [8]}), but also the causal dependencies among the performed actions/events.
However, their formulation is usually very complex, so cumbersome that they are of very little practical help: in fact, not even one
single case study of systems with
never-ending behavior has been developed on them. Moreover, their usability seems rather limited, as all the behavioral equivalences
in the spectrum ranging from interleaving bisimilarity (i.e., standard bisimilarity on the reachability graph of the marked net) to fully-concurrent bisimilarity
are undecidable [9]}, [10]}
on finite (unbounded) Petri nets.
This situation is very frustrating.
