Towards an algebra for timed behaviours (Q1199544): Difference between revisions

The concept of ``timed behaviours'' is presented, which involves the notions of Winskel's event structures [\textit{G. Winskel}, Lect. Notes Comput. Sic. 255, 325-392 (1987; Zbl 0626.68022)] and bisimulation. Operations, similar to those of CCS, are defined on these behaviours, turning them into an algebra. A large number of definitions and examples is given, with the aim of making the paper complete. However, the complexity of the setting makes any nummary awkward. The most difficult problem is not addressed: characterizing the algebra of timed behaviours --- perhaps as the free algebra in a particular equational class.