Converting Extended Finite-State Machines from Supremica to CIF

Paper i proceeding, 2026

Supremica and ESCET are two tools that both support modeling discrete event systems by extended finite-state machines, which are finite-state automata extended with bounded discrete variables and guards and actions over those variables. Both tools implement efficient algorithms for verification and synthesis of supervisors according to the Ramadge and Wonham supervisory control theory. But the tools are not identical, and they excel in different areas of functionality, which makes it useful to be able to convert models between them. One distinction between them is that SUPREMICA uses a graphical interface, while ESCET uses a textual representation given in the CIF language. Conversion from CIF to SUPREMICA is readily available from within ESCET, and this paper describes the conversion from SUPREMICA to CIF implemented as a script within SUPREMICA. This conversion is not as straightforward as would first be thought, due to multiple idiosyncrasies of the two formats of extended finite-state machine representation.