A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets

DOI10.1007/978-3-540-73196-2_12MaRDI QIDQ3614850zbMATH OpenOpenAlexFDO

Authors Sami Evangelista, C. Pajault, Jean-François Pradat-Peyre

Publication date 10 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73196-2_12

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A symbolic reachability graph for coloured Petri nets
• Automated Technology for Verification and Analysis
• Coloured Petri nets and the invariant-method
• scientific article; zbMATH DE number 3890746 (Why is no real title available?)
• scientific article; zbMATH DE number 2011471 (Why is no real title available?)
• scientific article; zbMATH DE number 4001493 (Why is no real title available?)
• Petri nets and algebraic specifications
• PN Standardisation: A Survey

Cited in

(1)

• scientific article; zbMATH DE number 4037228 (Why is no real title available?)

This page was built for publication: A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets

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