scientific article; zbMATH DE number 3795366
From MaRDI portal
Publication:4741710
zbMath0504.68035MaRDI QIDQ4741710
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Towards a language theory for infinite N-free pomsets. ⋮ A partial trace semantics for Petri nets ⋮ Asynchronous cellular automata for pomsets without auto-concurrency ⋮ Executions: A new partial-order semantics of Petri nets ⋮ Fairness and partial order semantics ⋮ The limit of splitn-language equivalence ⋮ Failures semantics based on interval semiwords is a congruence for refinement ⋮ Semi-commutations and Petri nets ⋮ Process languages and nets ⋮ Asynchronous cellular automata for pomsets
This page was built for publication: