Symbolic Model Checking for Channel-based Component Connectors

The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specification formalisms is a branching time logic that allows to reason about the coordination principles of and the data flow in the network. The underlying model checking algorithm relies on variants of standard automata-based approaches and model checking for CTL-like logics. The implementation uses a symbolic representation of the network and the enabled I/O-operations by means of binary decision diagrams. It has been applied to a couple examples that illustrate the efficiency of our model checker.

• Type: Journal
• Year: 2007
• Where: ENTCS
• Authors: Sascha Klüppelholz, Christel Baier
• Keywords: Branching Time Logic, ENTCS 2007, Model, Standard Automata-based Approaches