Hereditary History-Preserving Bisimilarity: Characterizations via Backward Ready Multisets
By: Marco Bernardo, Andrea Esposito, Claudio A. Mezzina
Potential Business Impact:
Counts event types to understand program behavior.
We devise two complementary characterizations of hereditary history-preserving bisimilarity (HHPB): a denotational one, based on stable configuration structures, and an operational one, formulated in a reversible process calculus. Our characterizations rely on forward-reverse bisimilarity augmented with backward ready multiset equality. This shifts the emphasis from uniquely identifying events, as done in previous characterizations, to counting occurrences of identically labeled events associated with incoming transitions, which yields a more lightweight behavioral equivalence than HHPB. We show that our characterizations correctly distinguish between autoconcurrency and autocausation, but are valid only in the absence of non-local conflicts. We then study the logical foundations of these characterizations by relating event identifier logic, which captures the classical view of HHPB, and backward ready multiset logic, developed for our new equivalence.
Similar Papers
Decidable Reversible Equivalences for Finite Petri Nets
Logic in Computer Science
Lets computers check if processes can undo actions.
Two behavioural pseudometrics for continuous-time Markov processes
Logic in Computer Science
Measures how similar two changing systems behave.
A Coalgebraic Model of Quantum Bisimulation
Logic in Computer Science
Makes quantum computers work together safely.