In: Fundamenta Informaticae 38, IOS Press, pages 223-255. 1999.
Abstract: In the formal treatment of concurrent computing systems, causality and weak causality can be used to provide abstract specifications of the temporal 'earlier than' and 'not later than' orderings. In this paper relational structures comprising causality and weak causality - called stratified order structures - are considered which can be used to provide a non-sequential semantics of Petri nets with inhibitor arcs. This approach can be extended to nets augmented with priority specifications. In particular, it is demonstrated how to derive stratified order structures for such nets by generalising the standard construction of causal partial orders based on occurrence nets.