The formalization of decision-free Petri net

DOI10.2478/FORMA-2014-0004MaRDI QIDQ467809zbMATH OpenOpenAlexFDO

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

Publication date 5 November 2014

Published in Formalized Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

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)

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 DE number 5014120

Cites work

• scientific article; zbMATH DE number 1228291 (Why is no real title available?)
• scientific article; zbMATH DE number 4197282 (Why is no real title available?)
• Continuity of barycentric coordinates in Euclidean topological spaces
• Semantics of MML query -- ordering

Cited in

(6)

• Deciding Selective Declassification of Petri Nets
• Free Choice Petri Nets
• Token-Free Petri Nets
• Deficiency Zero Petri Nets and Product Form
• Entscheidbarkeit bei Petri Netzen
• scientific article; zbMATH DE number 107897 (Why is no real title available?)

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)