A communicating system is [Formula: see text]-synchronizable if all of the message sequence charts representing executions can be divided into slices text] sends followed by receptions. It was previously shown that, for a fixed given text], one could decide whether text]-synchronizable. This result interesting because reachability problem solved systems. However, decision procedure assumes that...

We show that an information network flow problem N in which n messages have to be sent to n destination nodes has a solution (that might utilize Network Coding) if and only if the directed graph GN (that appears by identifying each output node with its corresponding input node) has guessing number ≥ n. The guessing number of a (directed) graph G is a new concept defined in terms of a simple coo...

In this note we describe several of the IRT modeling features implemented in Mplus, namely the the item characteristic curves, the item information curves, the total information curve, item difficulty parameter and item discrimination parameter. Different estimators and parameterizations are considered. We also provide details on the Mplus implementation of the Partial Credit Model (PCM), the 3...