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

DOI10.1007/978-3-540-73196-2_12zbMath1215.68147OpenAlexW1575624548MaRDI QIDQ3614850

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

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri nets and algebraic specifications
• Coloured Petri nets and the invariant-method
• A symbolic reachability graph for coloured Petri nets
• PN Standardisation: A Survey
• Automated Technology for Verification and Analysis

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