Multiplicative Transition Systems
The paper is concerned with algebras whose elements can be used to represent runs of a system. These algebras, called multiplicative transition systems, are partial categories with respect to a partial binary operation called multiplication. They can be characterized by axioms such that their elements and operations can be represented by partially ordered multisets of a certain type and operations on such multisets. The representation can be obtained without assuming a discrete nature of represented elements. In particular, it remains valid for systems with elements which can represent continuous and partially continuous runs.
The author is grateful to the referees for their remarks which helped to improve the final version of the paper.
- 13.Winkowski, J.: Multiplicative transition systems. Fundamenta Informaticae 109(2), 201–222 (2011). http://www.ipipan.waw.pl/~wink/winkowski.htm
- 14.Winkowski, J.: An Algebraic Framework for Concurrent Systems. Monograph 2 in Monograph Series. Institute of Computer Science of the Polish Academy of Sciences, Warsaw (2014)Google Scholar
- 15.Winskel, G., Nielsen, M.: Models for concurrency. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 4, pp. 1–148 (1995)Google Scholar