Multiplicative Transition Systems

Authors:
Józef Winkowski
Affiliations:
(Correspd.) (This work of the author has been supported by the Inst. of Comp. Sci. of the Polish Acad. of Sci.) Institute of Computer Science, Polish Academy of Sciences, Ordona 21, 01-237 Warszaw ...
Venue:
Fundamenta Informaticae
Year:
2011

Citing 10
Cited 0

Petri nets: basic notions, structure, behaviour

Current trends in concurrency. Overviews and tutorials
Partial (set) 2-structures. Part I: basic notions and the representation problem

Acta Informatica
Elementary transition systems

Selected papers of the Second Workshop on Concurrency and compositionality
Models for concurrency

Handbook of logic in computer science (vol. 4)
Introduction to General Net Theory

Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Basic notions of trace theory

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Hybrid I/O automata

Information and Computation
An algebraic characterization of independence of Petri net processes

Information Processing Letters - Special issue: Contribution to computing science
An Algebraic Framework for Defining Behaviours of Concurrent Systems. Part 1: The Constructive Presentation

Fundamenta Informaticae
An Algebraic Framework for Defining Behaviours of Concurrent Systems. Part 2: The Axiomatic Presentation

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper is concerned with algebras whose elements can be used to represent runs of a system from a state to a state. These algebras, called multiplicative transition systems, are categories with respect to a partial binary operation called composition. 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 infinitely divisible elements, and thus also for systems with elements which can represent continuous and partially continuous runs.