Structural Operational Specifications and the Trace Automata

Structural Operational Specifications (SOS) are supplied with concurrent models based on permutations of proved transitions. Those models take 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 may be realized in 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 the so-called ‘separated’ trace automata which may be realized in SOS.

[1]  G. Rozenberg,et al.  Elementary transition systems , 1990 .

[2]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[3]  Eugene W. Stark,et al.  Compostional Relational Semantics for Indeterminate Dataflow Networks , 1989, Category Theory and Computer Science.

[4]  Eugene W. Stark.  Connections between a Concrete and an Abstract Model of Concurrent Systems , 1989, Mathematical Foundations of Programming Semantics.

[5]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[6]  Ilaria Castellani,et al.  Three Equivalent Semantics for CCS , 1990, Semantics of Systems of Concurrent Processes.

[7]  Ilaria Castellani,et al.  A non-interleaving semantics for CCS based on proved transitions , 1988 .

[8]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, Journal of Logic and Computation.

[9]  Eugene W. Stark,et al.  Concurrent Transition Systems , 1989, Theor. Comput. Sci..

[10]  Glynn Winskel,et al.  Categories of Models for Concurrency , 1984, Seminar on Concurrency.