Hierarchies in Coloured Petri Nets
APN 90 Proceedings on Advances in Petri nets 1990
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Diagnosis of Asynchronous Discrete Event Systems: A Net Unfolding Approach
WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
A Semantics of Security Protocol Language (SPL) using a Class of Composable High-Level Petri Nets
ACSD '04 Proceedings of the Fourth International Conference on Application of Concurrency to System Design
Acta Informatica
Situation recognition: representation and algorithms
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Time supervision of concurrent systems using symbolic unfoldings of time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
An activity is described by a chronicle that expresses relationships between events in a sequence ordered in time. A chronicle language provides a syntax for the different chronicle operators considered. The recognition of chronicles is used in the processing of complex system simulations so as to detect activities or analyse behaviours. This work models formally the chronicle recognition, and coloured Petri nets (CPN) are used to model the recognition of a chronicle within a flow of events. The occurrence of an event to be detected is modelled by the firing of the corresponding transition. We provide coloured Petri nets to model the recognition of chronicles expressed with logical and temporal operators, as well as minimum and maximum time delays. We show how the composition of operators can be modelled by a composition of the coloured subnets associated with the different operators. The algebraic properties of the operators are reflected in the coloured nets. In this work, composition is achieved through place fusion, and a comprehensive modelling is provided, including more delicate issues such as chronicle with repetitions, and the absence of sub-chronicles.