Petri nets: basic notions, structure, behaviour
Current trends in concurrency. Overviews and tutorials
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Axiomatizing net computations and processes
Proceedings of the Fourth Annual Symposium on Logic in computer science
Fundamenta Informaticae - Special issue on graph transformations
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
Proceedings of the 11th Colloquium on Automata, Languages and Programming
K-density, N-density and finiteness properties
Proceedings of the European Workshop on Applications and Theory in Petri Nets, covers the last two years which include the workshop 1983 in Toulouse and the workshop 1984 in Aarhus, selected papers
An algebraic characterization of independence of Petri net processes
Information Processing Letters - Special issue: Contribution to computing science
Towards a Framework for Modelling Systems with Rich Internal Structures of States and Processes
Fundamenta Informaticae
An Axiomatic Characterization of Algebras of Processes of Petri Nets
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Towards a Framework for Modelling Behaviours of Hybrid Systems
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
An Algebraic Framework for Defining Random Concurrent Behaviours
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
The paper is concerned with algebras whose elements can be used to represent runs of a system, called processes. These algebras, called behaviour algebras, are categories with respect to a partial binary operation called sequential composition, and they are partial monoids with respect to a partial binary operation called parallel composition. They are characterized by axioms such that their elements and operations can be represented by labelled posets and operations on such posets. The respective representation is obtained without assuming a discrete nature of represented elements. In particular, it remains true for behaviour algebras with infinitely divisible elements, and thus also with elements which can represent continuous and partially continuous processes. An important consequence of the representation of elements of behaviour algebras by labelled posets is that elements of some subalgebras of behaviour algebras can be endowed in a consistent way with structures such as a graph structure etc.