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