cfsm-bisimulation

Communicating Finite State Machines Bisimulation with edge assertions

An algorithm to decide if two Communicating Finite State Machines (CFSM) with edge assertions, known as Asserted Communicating Finite State Machines (a-CFSM) are bisimilars. You can read about this CFSM extension in "Design-by-Contract for Flexible Multiparty Session Protocols" Section 4.3 (by Lorenzo Gheri, Ivan Lanese, Neil Sayers, Emilio Tuosto, and Nobuko Yoshida).

What does this package do?

This library provides both, a model for creating a-CFSMs and an algorithm for evaluating bisimulation. The main idea behind the algorithm is based on the fact that two automata do not have to coincide in the names of their participants, messages or variables used. Therefore, the algorithm constructs a matching of names as it builds the bisimulation relationship between the evaluated automata (if this is not possible, the automata are not bisimilar). For example, the following two automata would be bisimilar:

Installation

At first, you will need to install z3 and z3-solver as dependencies. You can use pip:

pip install z3-solver cfsm-bisimulation

Usage

The simplest use is to create the two CFSM models that you want to evaluate. We will use the z3 models as a way to construct the constraints.

from cfsm_bisimulation import CommunicatingFiniteStateMachine
from z3 import Int

cfsm_service = CommunicatingFiniteStateMachine(['Client', 'Logger'])
cfsm_service.add_states('p0', 'p1')
cfsm_service.set_as_initial('p0')
cfsm_service.add_transition_between(
    'p0',
    'p1',
    'ClientLogger!log(int x)',
    Int('x') > 0
)

cfsm_provider = CommunicatingFiniteStateMachine(['Customer', 'Service'])
cfsm_provider.add_states('q0', 'q1')
cfsm_provider.set_as_initial('q0')
cfsm_provider.add_transition_between(
    'q0',
    'q1',
    'CustomerService!save(int number)',
    Int('number') > 0
)

To evaluate these automata, you can simply:

relation, matches = cfsm_service.calculate_bisimulation_with(cfsm_provider)

The result of the relation is a set of pairs (state, knowledge) which is in fact not the minimal possible relationship. If you want to obtain the minimum possible relationship between the automata, execute using the option:

relation, matches = cfsm_service.calculate_bisimulation_with(cfsm_provider, minimize=True)

The result of matches is a dictionary with matches for participants, messages and variables. Each value, in turn, is a dictionary with the matches themselves.

relation = {
    (('p0'), ('q0')),
    (('p1', Int('x') > 0), (Int('number') > 0)),
}
matches = {
    'participants': {'Client': 'Customer', 'Logger': 'Service'},
    'messages': {'log(int x)': 'save(int number)'},
    'variables': {'number': 'x'}
}

Contributing

Bug reports and pull requests are welcome on GitHub at https://github.com/diegosenarruzza/bisimulation. If you are interested in updating or maintaining this package and need more information, please write to me at [e-mail] so I can explain in detail the idea behind the code.

License

The package is available as open source under the terms of the Mit License.