For the most recent entries see the Petri Nets Newsletter.

Elementary transition systems.

Nielsen, M.; Rozenberg, G.; Thiagarajan, P.S.

In: Theoretical Computer Science 96. 1992.

Abstract: Transition systems are a simple and powerful formalism for explaining the operational behaviour of models of concurrency. They provide a common framework for investigating the interrelationships between different approaches to the study of distributed systems. Hence an important question to be answered is: which subclass of transition systems corresponds to a particular model of distributed systems? In this paper we provide an answer to this question for elementary net systems. Within net theory, which is one well-established theory of distributed systems, elementary net systems constitute a basic systems model. Using this modek, fundamental concepts such as causality, concurrency, conflict and confusion can be clearly defined and separated from each other. Much is known about the behavioural aspects of elementary net systems in terms of trace theory, nonsequential processes and event structures. Trace theory was initiated by Mazurkiewicz.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography