Analysis of RTCP-nets with Reachability Graphs

Authors:
Marcin Szpyrka
Affiliations:
Institute of Automatics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Kraków, Poland. E-mail: mszpyrka@agh.edu.pl
Venue:
Fundamenta Informaticae
Year:
2006

Citing 2
Cited 3

Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3

Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Computer Aided Verification of Lamport's Fast Mutual Exclusion Algorithm Using Colored Petri Nets and Occurrence Graphs with Symmetries

IEEE Transactions on Parallel and Distributed Systems

Snapshot reachability graphs for Alvis models

KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I
Verification of automatic train protection systems with RTCP-Nets

SAFECOMP'06 Proceedings of the 25th international conference on Computer Safety, Reliability, and Security
HTCPNs---Based modelling and evaluation of dynamic computer cluster reconfiguration

CEE-SET'09 Proceedings of the 4th IFIP TC 2 Central and East European conference on Advances in Software Engineering Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

RTCP-nets are a subclass of timed coloured Petri nets defined for modelling and analysis of embedded real-time systems. One of the main advantages of strongly bounded RTCP-nets is a possibility to present the set of reachable states of an RTCP-net using a finite reachability and/or coverability graph. These graphs can be used to verify most of the net's properties, including the timing ones. The paper discusses analysis methods based on these graphs. A formal definition of RTCP-nets and a survey of their properties are also presented in the paper.