Synchronisationsgraphen

DOI10.1007/BF00264027zbMATH Open0244.68026OpenAlexW4246197434MaRDI QIDQ2554953FDOQ2554953

Authors: Hartmann J. Genrich, Kurt Lautenbach 

Publication date: 1973

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264027

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Directed graphs (digraphs), tournaments (05C20)

Cited In (14)

• A theory of bipolar synchronization scheme
• Traps characterize home states in free choice systems
• Target-oriented Petri net synthesis
• Synthesis and reengineering of persistent systems
• State space axioms for T-systems
• (A-)synchronous (non)-deterministic cell spaces simulating each other
• The decidability of persistence for vector addition systems
• Complexity results for 1-safe nets
• Some behavioural aspects of net theory
• D-continuous causal nets: A model of non-sequential processes
• Kleene theorems for product systems
• Characterisation of the state spaces of marked graph Petri nets
• Adequacy properties of path programs
• Reachability in cyclic extended free-choice systems

This page was built for publication: Synchronisationsgraphen

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2554953)