Algebraic nets with flexible arcs

DOI10.1016/S0304-3975(00)00205-XzbMath0992.68145OpenAlexW1985993942MaRDI QIDQ5958125

Ekkart Kindler, Hagen Völzer

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00205-x

zbMATH Keywords

algebraic Petri netsflexible arcslinear-algebraic verification techniquesplace invariants

Mathematics Subject Classification ID

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

Cites Work

• Proving nonreachability by modulo-invariants
• Petri nets and algebraic specifications
• Petri nets are monoids
• Petri net based verification of distributed algorithms: An example
• Computer science today. Recent trends and developments
• The non-sequential behaviour of Petri nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic nets with flexible arcs