Processes in Place/Transition (P/T) nets are defined inductively by a peculiar numbering of place occurrences. Along with an associative sequential composition called catenation and a neutral process, a monoid of processes is obtained. The power algebra of this monoid contains all process languages with appropriate operations on them. Hence the problems of analysis and synthesis, analogous to those in the formal languages and automata theory, arise. Here, the analysis problem is: for a given P/T...
Three basic operations on labelled net structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets. It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed – even...
Processes in Place/Transition (P/T) nets are defined
inductively by a peculiar numbering of place occurrences. Along
with an associative sequential composition called catenation and a neutral
process, a monoid of processes is obtained. The power algebra of this monoid
contains all process languages with appropriate operations on them. Hence
the problems of analysis and synthesis, analogous to those in the formal
languages and automata theory, arise. Here, the analysis problem is: for a
given P/T...
Three basic operations on labelled net
structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets.
It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed – even...
Download Results (CSV)