Semi-commutations and Petri nets

DOI10.1016/0304-3975(89)90098-4zbMath0679.68049OpenAlexW2002746187MaRDI QIDQ1822948

Dang Van Hung, Eloed Knuth

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90098-4

zbMATH Keywords

Petri netspartial commutationsemi-commutationfiring sequencesquasi-traces

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

On the synchronization of semi-traces ⋮ Semi-trace morphisms and rational transductions ⋮ Modelling concurrency with semi-commutations ⋮ Classifying invariant structures of step traces ⋮ On regular compatibility of semi-commutations ⋮ Step traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semi-commutations
• Mixed product and asynchronous automata
• Theory of traces
• Net theory and applications. Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, October 8-19, 1979. Ed. by Wilfried Brauer
• Notes on finite asynchronous automata

This page was built for publication: Semi-commutations and Petri nets