Analysis of RTCP-nets with reachability graphs

MaRDI QIDQ3416087zbMATH OpenFDO

Authors Marcin Szpyrka

Publication date 19 January 2007

zbMATH Keywords

analysiscoverability graphsreachability graphsRTCP-nets

Mathematics Subject Classification ID

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

Recommendations

• Tools and Methods for RTCP-Nets Modeling and Verification
• Design and analysis of embedded systems with RTCP-nets.
• Analysis of VME-bus communication protocol -- RTCP-net approach
• Analysis of reachability and prohibitibility of a class of coloured Petri nets with interval timed arcs
• scientific article; zbMATH DE number 4209631

Cited in

(6)

• Evaluation of cyber security and modelling of risk propagation with Petri nets
• Analysis of reachability and prohibitibility of a class of coloured Petri nets with interval timed arcs
• scientific article; zbMATH DE number 2058666 (Why is no real title available?)
• Tools and Methods for RTCP-Nets Modeling and Verification
• Design and analysis of embedded systems with RTCP-nets.
• Analysis of VME-bus communication protocol -- RTCP-net approach

This page was built for publication: Analysis of RTCP-nets with reachability graphs

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