Structural operational specifications and trace automata
Abstract
Structural operational specifications (SOS) are supplied with concurrent models based on permutations of proved transitions in the form of trace automata which are deterministic automata equipped with an explicit relation of independence on actions. In order to characterize the finite trace automata which are realized by SOS-algebras, we introduce a new kind of nets which encode exactly the concurrent behaviour of systems specified in SOS and we establish a correspondence between nets and those "seperated" trace automata which are realized in SOS.