Strong behavioral similarities in timed-arc Petri nets

DOI10.1016/J.AMC.2018.03.073MaRDI QIDQ2335136zbMATH OpenOpenAlexWikidataFDO

Authors Valentín Valero

Publication date 13 November 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10578/20972

zbMATH Keywords

formal methodsreachability graphssimilaritiestimed-arc Petri nets

Mathematics Subject Classification ID

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

Recommendations

• Timed processes of timed Petri nets
• Processes of timed Petri nets
• scientific article; zbMATH DE number 2081112
• scientific article; zbMATH DE number 1830920
• Time processes for time Petri nets

Cites work

• scientific article; zbMATH DE number 1696456 (Why is no real title available?)
• scientific article; zbMATH DE number 2088674 (Why is no real title available?)
• scientific article; zbMATH DE number 2081112 (Why is no real title available?)
• scientific article; zbMATH DE number 1755138 (Why is no real title available?)
• Fifty years of graph matching, network alignment and network comparison
• Removing dead transitions in timed-arc Petri nets
• TAPAAL 2.0: integrated development environment for timed-arc Petri nets
• Time-based expressivity of time Petri nets for system specification
• Verification of Timed-Arc Petri Nets

Describes a project that uses

Uses Software

• TAPAAL

This page was built for publication: Strong behavioral similarities in timed-arc Petri nets

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