Decomposition of Port Automata

This talk will be about ongoing work on decomposition of port automata, which are a simplified version of constraint automata. The goal is to decompose an arbitrary port automaton into instances of a finite number of primitives. The constructions for the decomposition are algebraic in the sense that I am looking only at the properties of the join and hide operation. In particular, I am not considering the language generated by the automaton.  

hosted by