scientific article; zbMATH DE number 3471613
From MaRDI portal
Publication:4055201
zbMATH Open0301.68063MaRDI QIDQ4055201FDOQ4055201
Authors: Robert M. Keller 
Publication date: 1975
Title of this publication is not available (Why is that?)
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)
Cited In (25)
- On the reversibility of circular conservative Petri nets
- A context dependent equivalence between processes
- A decomposition theorem for finite persistent transition systems
- Synthesis of (choice-free) reset nets
- Causal automata
- Step persistence in the design of GALS systems
- A Note on Persistent Petri Nets
- Decomposition Theorems for Bounded Persistent Petri Nets
- Sufficient conditions for the marked graph realisability of labelled transition systems
- Presynthesis of bounded choice-free or fork-attribution nets
- Modal logics for communicating systems
- State space axioms for T-systems
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Execution termination and computation determinacy of data-flow program nets
- Factorisation of transition systems
- Synchronization and computing capabilities of linear asynchronous structures
- Bounded choice-free Petri net synthesis: algorithmic issues
- Regularity and firing sequences of computation graphs
- An extension of the taxonomy of persistent and nonviolent steps
- Simulation, reduction and preservation of correctness properties of parallel systems
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- Linear time analysis of properties of conflict-free and general Petri nets
- Modular implementation of concurrency
- Characterisation of the state spaces of marked graph Petri nets
- On reduction of asynchronous systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055201)
