Petri nets: an introduction
Current trends in concurrency. Overviews and tutorials
Petri nets: basic notions, structure, behaviour
Current trends in concurrency. Overviews and tutorials
Journal of Computer and System Sciences
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
Process versus unfolding semantics for place/transition Petri nets
Theoretical Computer Science - Special volume on Petri nets
Fundamenta Informaticae - Special issue on graph transformations
Termination of Probabilistic Concurrent Program
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Continuous Petri Nets and Transition Systems
Unifying Petri Nets, Advances in Petri Nets
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
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Model checking for probability and time: from theory to practice
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
An algebraic characterization of independence of Petri net processes
Information Processing Letters - Special issue: Contribution to computing science
Observing Branching Structure through Probabilistic Contexts
SIAM Journal on Computing
Trace-based semantics for probabilistic timed I/O automata
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
An Algebraic Framework for Defining Random Concurrent Behaviours
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
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 first part of a two-part paper that contributes with a concept of a process viewed as a model of a run of a phenomenon (discrete, continuous, or of a mixed type), 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. 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 can be a continuation of the other can be composed sequentially. Independent processes, i.e. processes which do not disturb each other, can be composed in parallel. Processes may be prefixes, i.e. independent components of initial segments of other processes. Processes in a universe of objects and operations on such processes form a partial algebra, called algebra of processes. Algebras of processes are partial categories with respect to the sequential composition, and partial monoids with respect to the parallel composition. Algebras of processes can be used to define behaviours of concurrent systems. The behaviour of a system can be defined as the set of possible processes of this system with a structure on this set. Such a set is prefix-closed. The structure on this set reflects the prefix order and, possibly, specific features of the behaviour like observability, the relation to flow of real time, etc. Algebras of processes can also be used to define behaviours, to define operations on behaviours similar to those in the existing calculi of behaviours, and to define random behaviours. The first part of the whole paper investigates algebras of processes and their applications to describing behaviours of systems. 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 behaviouroriented algebras, and they initiate a theory of such algebras.