scientific article; zbMATH DE number 3795366

MaRDI QIDQ4741710zbMATH OpenFDO

Authors Peter H. Starke

Publication date 1981

zbMATH Keywords

concurrencypartial orderingPetri netssemilanguagesemiword

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(10)

• Executions: A new partial-order semantics of Petri nets
• A partial trace semantics for Petri nets
• Process languages and nets
• Asynchronous cellular automata for pomsets
• Semi-commutations and Petri nets
• Towards a language theory for infinite N-free pomsets.
• The limit of \(\operatorname{split}_n\)-language equivalence
• Asynchronous cellular automata for pomsets without auto-concurrency
• Fairness and partial order semantics
• Failures semantics based on interval semiwords is a congruence for refinement

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 Q4741710)