scientific article
From MaRDI portal
Publication:3766866
zbMath0629.68064MaRDI QIDQ3766866
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
closure propertiesPetri net languagesfiring sequenceintersection closed semi-AFLmulti-counter languagetransition sequences
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Cancellation in context-free languages: enrichment by reduction, Computing Petri net languages by reductions, Selective petri net languages, Algebraic characterization of petri net pomset semantics, On sets of numbers accepted by P/T systems composed by join, Some behavioural aspects of net theory, Petri net languages and infinite subsets of \(\mathbb{N}^m\), Methods for behavior descriptions of structure-complex Petri nets, A uniform approach to true-concurrency and interleaving semantics for Petri nets, Time-based expressivity of time Petri nets for system specification, Supervisory Control of Petri Nets with Language Specifications, Groups Whose Word Problem is a Petri Net Language
