Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1341758

From MaRDI portal
Publication:4263303
Jump to:navigation, search

zbMATH Open0935.68074MaRDI QIDQ4263303FDOQ4263303


Authors: Piotr Chrząstowski-Wachtel Edit this on Wikidata


Publication date: 22 September 1999



Title of this publication is not available (Why is that?)



Recommendations

  • Decidability of the Petri net reachability problem
  • Entscheidbarkeit bei Petri Netzen
  • An Algorithm for the General Petri Net Reachability Problem
  • scientific article; zbMATH DE number 4092785


zbMATH Keywords

Petri nets


Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability (number-theoretic aspects) (11U05)



Cited In (1)

  • Soundness of workflow nets: classification, decidability, and analysis





This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4263303&oldid=18168200"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 17:13. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki