This PR is a retake on pomset.v.
It features several changes.
In pomset.v the Pomset structure is renamed into LPoset (labeled partially ordered set) to avoid confusion. A labelling function is embedded into LPoset hierarchy.
An axiom of finite cause is removed from LPoset (top of the hierarchy) and is moved to a new structure Elem.eventStruct that is an elementary event structure (which is a labelled poset + axiom if finite cause). Elementary event structures are then inherited by various subclasses of prime event structures, that is prime event structures with binary and general conflict.
Definition of homomorphism between labelled posets is given, together with basic combinators (id, tr) and notations.
This PR is a retake on
pomset.v
. It features several changes.In
pomset.v
thePomset
structure is renamed intoLPoset
(labeled partially ordered set) to avoid confusion. A labelling function is embedded intoLPoset
hierarchy.An axiom of finite cause is removed from
LPoset
(top of the hierarchy) and is moved to a new structureElem.eventStruct
that is an elementary event structure (which is a labelled poset + axiom if finite cause). Elementary event structures are then inherited by various subclasses of prime event structures, that is prime event structures with binary and general conflict.Definition of homomorphism between labelled posets is given, together with basic combinators (
id
,tr
) and notations.