SPHIN: A model checker for reconfigurable hybrid systems based on SPIN
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A reconfigurable hybrid system is a collection of digital and analog components, where digital components are embedded in and interact with analog components and their configuration can be changed by means of physical or logical mobility of components. To establish a formal framework for the specification and verification of such systems, we extend the π-calculus, a process algebraic formalism for mobile concurrent computation, to hybrid setting. The outcome is the &phis;-calculus, whose main features in syntactic extensions are information hiding of analog variables, dynamic instantiations and mobility of analog components. The structural operational semantics of the &phis;-calculus is defined with a set of transition rules. We show a certain congruence of hybrid processes under defined bisimulation in arbitrary analog environment. Another direction for the verification is pursued by specifying requirements in linear-time temporal logic and checking whether the system model satisfies the requirement logic formula. The well-known software model checker SPIN is found to be very suitable for the verification of reconfigurable systems. A hybrid extension to SPIN is implemented using an efficient geometric processing library. We show that the resulting model checker SPHIN is capable of verifying important requirements of interesting reconfigurable hybrid systems such as models of assembly factory robots and flocking agents.