State Machines (ASMs) [13] and Predicate Transition (Pr/T-) Nets [10] constitute alternative approaches to mathematical modelling of concurrent and embedded computing systems. In fact, they are based on similar combinations of the same mathematical concepts: they both combine declarative concepts of first-order logic with the operational view of transition systems; moreover, they are closely related with respect to the underlying notions of concurrency and non-determinism. On the other hand, the resulting system representations differ considerably (e.g., they use distinct notations and are based on complementary system views) so that it is not immediately clear how they can be combined or transformed into each other. The work presented here investigates the formal relation between ASMs and Pr/T-nets with the aim to integrate them into a common framework for modelling concurrent and embedded systems, where Pr/T-nets are considered as a graphical interface for distributed ASMs. For the class of strict Pr/T-nets (which constitutes the basic form of Pr/T-nets) a transformation to distributed ASMs will be given.