Elementary transition systems
From MaRDI portal
Publication:1190485
DOI10.1016/0304-3975(92)90180-NzbMath0759.68022OpenAlexW2032838513MaRDI QIDQ1190485
P. S. Thiagarajan, Grzegorz Rozenberg, Mogens Nielsen
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Modeling Distributed Private Key Generation by Composing Petri Nets, Some complexity results on transition systems and elementary net systems, A theoretical investigation of regular equivalences for fuzzy graphs, Synthesis of Petri Nets with Whole-Place Operations and Localities, The synthesis problem of Petri nets, Trace nets and process automata, Rough set models ofPhysarummachines, Synthesis of nets with inhibitor arcs, Transformations in Reconfigurable Place/Transition Systems, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, A characterization of set representable labeled partial 2-structures through decompositions, An event structure semantics for general Petri nets, Petri nets and bisimulation, Transition systems without transitions, Regions of Petri nets with a/sync connections, Stability of regional orthomodular posets under synchronisation and refinement, Applying regions, Event-based functional decomposition, Representation of computations in concurrent automata by dependence orders, Synthesising elementary net systems with localities, An algebraic model of observable properties in distributed systems, Elementary transition systems and refinement
Cites Work
