The formalization of decision-free Petri net

DOI10.2478/forma-2014-0004zbMath1298.68196OpenAlexW915070251MaRDI QIDQ467809

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

zbMATH Keywords

Petri netspecification and verification of discrete systems

Mathematics Subject Classification ID

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

Cites Work

• Semantics of MML Query - Ordering
• Continuity of Barycentric Coordinates in Euclidean Topological Spaces
• Unnamed Item
• Unnamed Item

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