Petri net languages revisited

DOI10.1016/J.TCS.2011.12.043zbMATH Open1247.68190OpenAlexW2029659892MaRDI QIDQ418794FDOQ418794

Authors: Antoni Mazurkiewicz 

Publication date: 30 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.043

Recommendations

• On the regularity of Petri net languages
• Deterministic weak-and-marked Petri net languages are regular
• Infinite behaviour of Petri nets
• Some results on Petri net languages
• On the properties of the intersection of Petri net languages and context free languages

zbMATH Keywords

reachabilitycommutativitycompositionalitycontext-free languageatomic netscommutative languagesconcurrent systemPetri net behaviourPetri net languagessequential behaviour

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (27)

• Title not available (Why is that?)
• How Expressive Are Petri Net Schemata?
• Erasing in Petri Net Languages and Matrix Grammars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing Petri net languages by reductions
• Infinite behaviour of Petri nets
• Title not available (Why is that?)
• Pushdown automata, multiset automata, and Petri nets
• Labeled Step Sequences in Petri Nets
• Title not available (Why is that?)
• Subset languages of Petri nets. I: The relationship to string languages and normal forms
• Title not available (Why is that?)
• Synchronized shuffle operation of Petri net languages and its applications in analysis for language behaviors
• Title not available (Why is that?)
• Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
• Rectangular arrays and Petri nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some results on Petri net languages
• Selective petri net languages
• On the properties of the intersection of Petri net languages and context free languages
• Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
• On the relationship between the language of the CN-model with component junctions and the language of the detailed Petri model of parallel distributed systems
• Title not available (Why is that?)
• Process languages and nets
• Overview of reconfigurable Petri nets

This page was built for publication: Petri net languages revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418794)