Elementary transition systems
The relation between elementary net systems [\textit{M. Nielsen}, \textit{G. Rozenberg} and \textit{P. S. Thiagarajan}, Behavioural notion for elementary net systems, Distributed Computing 4, 45-57 (1990); \textit{P. S. Thiagarajan}, Lect. Notes Comput. Sci. 254, 26-59 (1986; Zbl 0636.68063); \textit{G. Rozenberg}, Lect. Notes Comput. Sci. 254, 60-94 (1986; Zbl 0636.68064)] and transition systems is studied through the notion of elementary transition systems, denoting a subclass of the class of all transition systems. It is shown, how behaviour preserving transformations between elementary net systems correspond to those between elementary transition systems. With the help of category theory net morphisms and various other morphisms between transition systems are studied. This work is a good companion to [loc. cit.] and other related works.
- scientific article; zbMATH DE number 4018370 (Why is no real title available?)
- scientific article; zbMATH DE number 4035156 (Why is no real title available?)
- scientific article; zbMATH DE number 4037216 (Why is no real title available?)
- scientific article; zbMATH DE number 4037217 (Why is no real title available?)
- scientific article; zbMATH DE number 3787631 (Why is no real title available?)
- scientific article; zbMATH DE number 193318 (Why is no real title available?)
- scientific article; zbMATH DE number 4119618 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- Mathematical aspects of net theory
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Petri nets, event structures and domains. I
- Synchronization trees
- A characterization of set representable labeled partial 2-structures through decompositions
- Representation of computations in concurrent automata by dependence orders
- Elementary transition systems and refinement
- Some complexity results on transition systems and elementary net systems
- An algebraic model of observable properties in distributed systems
- Transition systems, event structures, and unfoldings
- The synthesis problem of Petri nets
- Trace nets and process automata
- Stability of regional orthomodular posets under synchronisation and refinement
- Synthesising elementary net systems with localities
- Property-preserving transformations of elementary net systems based on morphisms
- Event-based functional decomposition
- A theoretical investigation of regular equivalences for fuzzy graphs
- Multiplicative transition systems
- Rough set models of \textit{Physarum} machines
- Synthesis of Petri nets with whole-place operations and localities
- Modeling Distributed Private Key Generation by Composing Petri Nets
- Transformations in Reconfigurable Place/Transition Systems
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- Transition systems without transitions
- Synthesis of nets with inhibitor arcs
- Transition systems of Elementary Net Systems with inhibitor arcs
- Coupling asynchrony and interrupts: Place Chart Nets
- Strategies for minimising the synthesised ENL-systems
- An event structure semantics for general Petri nets
- Petri nets and bisimulation
- Regions of Petri nets with a/sync connections
- Applying regions
This page was built for publication: Elementary transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190485)
