Elementary transition systems

DOI10.1016/0304-3975(92)90180-NMaRDI QIDQ1190485zbMATH OpenOpenAlexFDO

Authors P. S. Thiagarajan, Mogens Nielsen, Grzegorz Rozenberg

Publication date 26 September 1992

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(92)90180-n

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Elementary transition systems and refinement
• Some complexity results on transition systems and elementary net systems
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Transition systems, event structures, and unfoldings
• Property-preserving transformations of elementary net systems based on morphisms

Cites work

• 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

Cited in

(27)

• Transition systems without transitions
• Event-based functional decomposition
• Coupling asynchrony and interrupts: Place Chart Nets
• Representation of computations in concurrent automata by dependence orders
• Property-preserving transformations of elementary net systems based on morphisms
• Elementary transition systems and refinement
• Stability of regional orthomodular posets under synchronisation and refinement
• Synthesis of Petri nets with whole-place operations and localities
• The synthesis problem of Petri nets
• Rough set models ofPhysarummachines
• Strategies for minimising the synthesised ENL-systems
• Petri nets and bisimulation
• Synthesising elementary net systems with localities
• Multiplicative transition systems
• An algebraic model of observable properties in distributed systems
• Transformations in Reconfigurable Place/Transition Systems
• A characterization of set representable labeled partial 2-structures through decompositions
• Applying regions
• Synthesis of nets with inhibitor arcs
• Regions of Petri nets with a/sync connections
• An event structure semantics for general Petri nets
• Modeling Distributed Private Key Generation by Composing Petri Nets
• Some complexity results on transition systems and elementary net systems
• Transition systems of Elementary Net Systems with inhibitor arcs
• A theoretical investigation of regular equivalences for fuzzy graphs
• Trace nets and process automata
• Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra

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)