The formalization of decision-free Petri net

DOI10.2478/FORMA-2014-0004zbMATH Open1298.68196OpenAlexW915070251MaRDI QIDQ467809FDOQ467809

Pratima K. Shah, Pauline N. Kawamoto, Mariusz Giero

Publication date: 5 November 2014

Published in: Formalized Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/forma-2014-0004

Recommendations

• Token-Free Petri Nets
• Free Choice Petri Nets
• Linear time analysis of properties of conflict-free and general Petri nets
• scientific article; zbMATH DE number 3982529
• scientific article

zbMATH Keywords

Petri netspecification and verification of discrete systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Semantics of MML query -- ordering
• Title not available (Why is that?)
• Title not available (Why is that?)
• Continuity of barycentric coordinates in Euclidean topological spaces

Cited In (5)

• Deficiency Zero Petri Nets and Product Form
• Entscheidbarkeit bei Petri Netzen
• Title not available (Why is that?)
• Free Choice Petri Nets
• Deciding Selective Declassification of Petri Nets

This page was built for publication: The formalization of decision-free Petri net

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