Synchronisationsgraphen

DOI10.1007/BF00264027MaRDI QIDQ2554953zbMATH OpenOpenAlexFDO

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

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

Cited in

(15)

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

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)