Petri nets: an introduction
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
Diamond properties of elementary net systems
Fundamenta Informaticae
Handbook of logic in computer science (vol. 4)
Fundamenta Informaticae - Special issue on graph transformations
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Introduction to General Net Theory
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Categories of asynchronous systems
Categories of asynchronous systems
An algebraic characterization of independence of Petri net processes
Information Processing Letters - Special issue: Contribution to computing science
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
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 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 Systems with Rich Internal Structures of States and Processes
Fundamenta Informaticae
Hi-index | 0.00 |
The paper is the second part of two-part paper that contributeswith a concept of a process, with operations allowing to define complex processes in terms of their components, with the respective algebras, and with the idea of using the formal tools thus obtained to describe the behaviours of concurrent systems. In the first part a universal model of a process have been introduced and operations on processes have been defined. A process is viewed as a model of a run of a system (discrete, continuous, or of a mixed type). A process may have an initial state (a source), a final state (a target), or both. A process can be represented by a partially ordered multiset. Processes of which one is a continuation of the other can be composed sequentially. Independent processes, can be composed in parallel. Processes may be prefixes, i.e. independent components of initial segments of other processes. It has been shown that processes in a universe of objects and operations on such processes form a partial algebra, called algebra of processes, that is a specific partial category with respect to the sequential composition, and a specific partial monoid with respect to the parallel composition. In the second part the properties of algebras of processes described in the first part are regarded as axioms defining a class of abstract partial algebras, called behaviour-oriented algebras, and properties of such algebras are investigated. In particular, it is shown how some of the behaviour-oriented algebras can be represented as algebras of processes, and how to use them to describe phenomena with states and processes provided with specific structures.