Publication:4055201
From MaRDI portal
zbMath0301.68063MaRDI QIDQ4055201
Publication date: 1975
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68W99: Algorithms in computer science
Related Items
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis, Step Persistence in the Design of GALS Systems, Characterisation of the state spaces of marked graph Petri nets, Modal logics for communicating systems, Linear time analysis of properties of conflict-free and general Petri nets, A decomposition theorem for finite persistent transition systems, Simulation, reduction and preservation of correctness properties of parallel systems, A context dependent equivalence between processes, Regularity and firing sequences of computation graphs, Causal automata, On reduction of asynchronous systems, Synchronization and computing capabilities of linear asynchronous structures, (A-)synchronous (non)-deterministic cell spaces simulating each other, Sufficient conditions for the marked graph realisability of labelled transition systems, Factorisation of transition systems, Bounded choice-free Petri net synthesis: algorithmic issues, Modular implementation of concurrency, Synthesis of (choice-free) reset nets, An extension of the taxonomy of persistent and nonviolent steps, Presynthesis of bounded choice-free or fork-attribution nets, State space axioms for T-systems, Execution termination and computation determinacy of data-flow program nets, A Note on Persistent Petri Nets, Decomposition Theorems for Bounded Persistent Petri Nets
