Basic linear algebraic techniques for place/transition nets

DOI10.1007/3-540-65306-6_18MaRDI QIDQ4247288zbMATH OpenFDO

Authors Jörg Desel

Publication date 16 June 1999

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

Full work available at URL https://doi.org/10.1007/3-540-65306-6_18

zbMATH Keywords

marked Petri netsplace/transition nets

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4031001
• Linear algebraic and linear programming techniques for the analysis of place/transition net systems
• Using linear programming in Petri net analysis
• A relation-algebraic approach to liveness of place/transition nets
• scientific article; zbMATH DE number 1216193

Cited in

(11)

• Algebraic method of determining nonexistence of deadlock markings in Petri nets
• Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data
• A relation-algebraic approach to liveness of place/transition nets
• scientific article; zbMATH DE number 4031001 (Why is no real title available?)
• Using linear programming in Petri net analysis
• scientific article; zbMATH DE number 1216193 (Why is no real title available?)
• Linear algebraic and linear programming techniques for the analysis of place/transition net systems
• scientific article; zbMATH DE number 1956602 (Why is no real title available?)
• Analyzing Reachability for Some Petri Nets With Fast Growing Markings
• Stop-transitions of Petri nets
• Automated Technology for Verification and Analysis

This page was built for publication: Basic linear algebraic techniques for place/transition nets

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