Petri nets are less expressive than state-extended PA

DOI10.1016/J.TCS.2007.12.003zbMATH Open1136.68039OpenAlexW2059578925MaRDI QIDQ2481981FDOQ2481981

Vojtěch Řehák, Jan Strejček, Mojmír Křetínský

Publication date: 15 April 2008

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

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

zbMATH Keywords

Petri netsexpressivenessprocess algebrasstrong bisimulation

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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deciding bisimulation-like equivalences with finite-state processes
• Process rewrite systems.
• Pushdown automata, multiset automata, and Petri nets
• Infinite results
• On the regular structure of prefix rewriting
• CONCUR 2004 - Concurrency Theory

Cited In (1)

• How Expressive Are Petri Net Schemata?

This page was built for publication: Petri nets are less expressive than state-extended PA

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