An analytical method for well-formed workflow/Petri net verification of classical soundness

DOI10.2478/amcs-2014-0068zbMath1309.93099OpenAlexW2017089346MaRDI QIDQ2018421

Julio B. Clempner

Publication date: 14 April 2015

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/amcs-2014-0068

zbMATH Keywords

verificationLyapunov stabilityPetri netsdecidabilitysoundnessworkflow nets

Mathematics Subject Classification ID

Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Discrete event control/observation systems (93C65) Control/observation systems governed by ordinary differential equations (93C15)

Related Items (1)

Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems

Uses Software

• WSAT
• Metagraphs
• Woflan

Cites Work

• Web services, e-business, and the semantic web. CAiSE 2002 international workshop, WES 2002, Toronto, Canada, May 27--28, 2002. Revised papers
• Lagrange stability and boundedness of discrete event systems
• Diagnosing Workflow Processes using Woflan
• Numbering action vertices in workflow graphs
• Fundamental Approaches to Software Engineering
• Applications and Theory of Petri Nets 2004
• Applications and Theory of Petri Nets 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An analytical method for well-formed workflow/Petri net verification of classical soundness