?
Consistent Timed Semantics for Nested Petri Nets with Restricted Urgency
Ch. 1. P. 3–18.
Dworzanski L. W.
The nested Petri nets are a nets-within-nets formalism convenient for modelling systems that consist of distributed mobile agents with individual behaviour. The formalism is supported by developed verification methods based on structural analysis and model checking techniques. Time constraints are crucial for many safety critical and everyday IoT systems. Recently, the non Turing-complete time semantics for Time Petri nets based on restricted urgency was suggested; and, it was shown that some behavioural analysis problems are decidable under the semantics. In the paper, the semantics is extended to the nested Petri nets formalism and it was demonstrated that some behavioural analysis problems are still decidable. The semantics is illustrated by an example of a health monitoring system.
Mecheraoui K., Carrasquel Gamez J. C., Lomazova I. A., , in: Proceedings of the Conference on Modeling and Analysis of Complex Systems and Processes 2020 (MACSPro 2020)Vol. 2795.: CEUR Workshop Proceedings, 2020. P. 34–45.
This paper presents a compositional conformance checking approach between nested Petri nets and event logs of multi-agent systems. By projecting an event log onto model components, one can perform conformance checking between each projected log and the corresponding component. We formally demonstrate the validity of our approach proving that, to check fitness of a nested ...
Added: January 14, 2021
Mecheraoui K., Carrasquel Gamez J. C., Lomazova I. A., / Series Computer Science "arxiv.org". 2020.
This paper presents a compositional conformance checking approach between nested Petri nets and event logs of multi-agent systems. By projecting an event log onto model components, one can perform conformance checking between each projected log and the corresponding component. We formally demonstrate the validity of our approach proving that, to check fitness of a nested ...
Added: October 20, 2020
Lee S., Cho M., Podkopaev A. et al., , in: PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation.: NY: Association for Computing Machinery (ACM), 2020. P. 362–376.
Added: August 19, 2020
Carrasquel Gamez J. C., Lomazova I. A., Itkin I., , in: Proceedings of the MACSPro Workshop 2019Vol. 2478: CEUR Workshop Proceedings.: CEUR-WS.org, 2019. P. 92–103.
Electronic trading systems provide the computational support for stock exchanges. Liquid markets use order-driven systems, i.e., where client requests, for trading financial instruments, are served through individual orders. This paper presents Petri net models assembling some crucial processes executed within order-driven systems such as orders submission, application of precedence rules, and the order matching mechanism. ...
Added: October 14, 2019
Mitsyuk A. A., Котылев Я. В., , in: Tools and Methods of Program Analysis: 4th International Conference, TMPA 2017, Moscow, Russia, March 3-4, 2017, Revised Selected PapersVol. 779: Communications in Computer and Information Science.: Springer, 2018. Ch. 11 P. 127–138.
Modern software systems can be large. They often have a complex architecture and non-trivial behaviour. That is why different modelling techniques are used for their design and analysis. Illustrative visualization of a system architecture can facilitate better analysis and give useful insights. In this paper we propose an approach for visualization of software system models. ...
Added: January 30, 2018
Dworzanski L. W., Михайлов В. Е., Proceedings of the Institute for System Programming of the RAS 2017 Vol. 29 No. 4 P. 175–190
Well-structured transition systems (WSTS) became a well-known tool in the study of concurrency systems for proving decidability of properties based on coverability and boundedness. Each year brings new formalisms proven to be WSTS systems. Despite the large body of theoretical work on the WSTS theory, there has been a notable gap of empirical research of ...
Added: October 1, 2017
Ermakova V., Lomazova I. A., Труды Института системного программирования РАН 2016 Т. 28 № 4 С. 115–136
Nested Petri nets (NP-nets) have proved to be one of the convenient formalisms for distributed multi-agent systems modeling and analysis. It allows representing multi-agent systems structure in a natural way, since tokens in the system net are Petri nets themselves, and have their own behavior. Multi-agent systems are highly concurrent. Verification of such systems with model ...
Added: October 21, 2016
Dworzanski L. W., Lomazova I. A., Programming and Computer Software 2016 Vol. 42 No. 5 P. 292–306
Multi-level multi-agent systems (MASs) with dynamic structure are widely used in solving important applied problems in telecommunication, transportation, social, and other systems. Therefore, ensuring correct behavior of such systems is an actual and important task. One of the most error-prone stages of system development in the framework of model-oriented approach is the implementation stage, in ...
Added: September 27, 2016
Samokhvalov D., Dworzanski L. W., Proceedings of the Institute for System Programming of the RAS 2016 Vol. 28 No. 3 P. 65–84
Nested Petri net formalisms is an extension of coloured Petri net formalism that uses Petri Nets as tokens. The formalism allows creating comprehensive models of multi-agent systems, simulating, verifying and analyzing them in a formal and rigorous way. Multi-agent systems are found in many different fields — from safety critical systems to everyday networks of ...
Added: September 15, 2016
Switzerland: Springer, 2016.
Control and analysis of the timing of computations are crucial to many domains of system engineering, be it, e.g., for ensuring a timely response to stimuli originating in an uncooperative environment or for synchronizing components in VLSI. Reflecting this broad scope, timing aspects of systems from a variety of domains have been treated independently by ...
Added: September 13, 2016
Lomazova I. A., Ermakova V., , in: CEUR Workshop ProceedingsVol. 1591: Petri Nets and Software Engineering. International Workshop, PNSE'16, Torun, Poland, June 20-21, 2016. Proceedings.: CEUR Workshop Proceedings, 2016. P. 93–112.
Nested Petri nets (NP-nets) is an extension of the Petri nets formalism within the nets-within-nets approach, allowing to model systems of interacting dynamic agents in a natural way. One of the main problems in verifying of such systems is the State Explosion Problem. To tackle this problem for highly concurrent systems the unfolding method has ...
Added: June 28, 2016
Dworzanski L. W., Lomazova I. A., , in: Application and Theory of Petri Nets and Concurrency. 37th International Conference, PETRI NETS 2016, Toruń, Poland, June 19-24, 2016. ProceedingsVol. 9698: Lecture Notes in Computer Science.: Switzerland: Springer, 2016. P. 325–344.
Nested Petri nets (NP-nets) is an extension of the Petri nets formalism within the “nets-within-nets” approach. Due to tokens with individual behavior and the mechanism of synchronization NP-nets are convenient for modeling multi-agent and adaptive systems, flexible workflow nets, and other systems with mobile interacting components and dynamic structure. In contrast to classical Petri nets, ...
Added: June 11, 2016