Some results on Petri net languages

DOI10.1109/9.52310zbMATH Open0709.68036OpenAlexW2099016294MaRDI QIDQ3493244

Hyuck Yoo, Stéphane Lafortune

Publication date: 1990

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a99431b40a03e25e8fe05a7987bb542d00b3bd29

zbMATH Keywords

Petri netsPetri net languagesfinitely recursive processes

Mathematics Subject Classification ID

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

Related Items (7)

Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data ⋮ Verification of scenarios in Petri nets using compact tokenflows ⋮ Title not available (Why is that?) ⋮ Deterministic weak-and-marked Petri net languages are regular ⋮ Title not available (Why is that?)

Recommendations

• Petri net languages revisited 👍 👎
• On the rationality of Petri net languages 👍 👎
• A logical approach of Petri net languages 👍 👎
• On the regularity of Petri net languages 👍 👎
• Selective petri net languages 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Some results on Petri net languages

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