scientific article; zbMATH DE number 3471613
From MaRDI portal
Publication:4055201
Cited in
(25)- 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
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- Characterisation of the state spaces of marked graph Petri nets
- Step persistence in the design of GALS systems
- Modal logics for communicating systems
- Linear time analysis of properties of conflict-free and general Petri nets
- On the reversibility of circular conservative Petri nets
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)
