We address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program veri cation and control synthesis in reactive program compilation.

State space transformations in the max-algebraic system theory for Discrete Event Systems (DES) are discussed. Some transformations between diierent realiza-tions of a given impulse response of a DES are suggested and their limitations are illustrated. It is explained why a general result seems hard to prove. R esum e: Nous discutons certaines transformations d' etat dans la th eorie des syst e...

We address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program veriication and control synthesis in reactive program compilation.

our main aim in this article is to analyze the two concepts “proposition” and “state of affairs”. first we present the minimal expectations of a theory of “proposition” and a theory of “state of affairs”, and then we turn to the views of the contemporary theorist john pollock regarding these two topics and present the most important of his views on the subject. subsequently, we reconstruct a th...

we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.