We define a translation from Condition/Event nets to the Circal process algebra. Such a translation exploits the Circal feature of allowing the simultaneous occurrence of distinct actions. This permits us to give Condition/Event nets a semantics based on true concurrency, in addition to the interleaving-based semantics. In this way the true concurrency aspects of Condition/Event nets are preserved in the process algebra representation and can be analysed using the verification facilities provided by the Circal System. Systems modelled partly using Condition/Event nets partly using the Circal process algebra can also be analysed within the same verification environment.