?
Analyzing Compatibility of Services via Resource Conformance
Fundamenta Informaticae. 2013. Vol. 128. No. 1-2. P. 129-141.
Lomazova I. A., Romanov I.
In this work we consider modeling of services with workflow modules, which form a Petri net subclass. The service compatibility problem is to answer the question, whether two services fit together, i.e. whether the composed system is correct. We study complementarity of resources, produced/consumed by two services—a necessary condition for the service compatibility. Resources, which are produced/consumed by a service, are represented as a multiset language. We define an algebra of multiset languages and present algorithms for checking conformance of resources for two given well-structured workflow modules.
Publication based on the results of:
Lomazova I. A., Romanov I., , in : Concurrency, Specification and Programming. CS&P’2012. Berlin, September 26 – September 28, 2012. Volume 2. Vol. 2. Issue 225.: Berlin : Humboldt University of Berlin, 2012. P. 239-250.
In this work we consider modeling of services with workflow modules, which are a subclass of Petri nets. The service compatibility problem is to answer the question, whether two Web services fit together, i.e. whether the composed system is sound. We study complementarity of service produced/consumed resources, that is a necessary condition for the service ...
Added: November 19, 2012
Lomazova I. A., Fundamenta Informaticae 2010 Vol. 101 No. 1-2 P. 59-70
In this work we consider modeling of workflow systems with Petri nets. To increase flexibility and give tools for workflow models re-engineering we extend the formalism of workflow nets by considering systems of interacting nets. Then we study soundness - the main correctness property of workflow processes - and show, that for a special class ...
Added: November 19, 2012
Vladimir A. Bashkin, Irina A. Lomazova, Transactions on Petri Nets and Other Models of Concurrency 2014 Vol. 9 P. 1-18
A resource workflow net (RWF-net) is a workflow net, supplied with an additional set of initially marked resource places. Resources can be consumed and/or produced by transitions. Neither the intermediate nor final resource markings are constrained, hence a net can have an infinite number of different reachable states. An RWF-net with k tokens in the ...
Added: December 7, 2014
Berlin : Springer, 2014
This book constitutes the proceedings of the 35th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2014, held in Tunis, Tunisia, in June 2014. The 15 regular papers and 4 tool papers presented in this volume were carefully reviewed and selected from 48 submissions. In addition the book contains 3 ...
Added: July 3, 2014
Mitsyuk A. A., Lomazova I. A., van der Aalst W., Моделирование и анализ информационных систем 2017 Т. 24 № 4 С. 459-480
During the life-cycle of an Information System (IS) its actual behaviour may not correspond to the original system model. However, to the IS support it is very important to have the latest model that reflects the current system behaviour. To correct the model, the information from the event log of the system may be used. ...
Added: August 28, 2017
N. S. Zubkova, S. A. Shershakov, Proceedings of the Institute for System Programming of the RAS 2019 Vol. 31 No. 4 P. 139-150
UML Activity Diagrams are widely used models for representing software processes. Models built from event logs, recorded by information systems, can provide valuable insights into real flows in processes and suggest ways of improving those systems. This paper proposes a novel method for mining UML Activity Diagrams from event logs. The method is based on ...
Added: October 28, 2019
Tsaregorodtsev A. V., Дербин Е. А., Мухин И. Н., Информация и безопасность 2015 Т. 18 № 3 С. 408-411
The use of cloud computing to build of IT-infrastructure of the organization implies the refusal of the organization direct control over the security aspects. There is a need for solving the problem of data privacy in the design architecture based on cloud computing technology. In the article the simulation method of data processing using Petri ...
Added: March 15, 2016
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
Mitsyuk A. A., Lomazova I. A., van der Aalst W., Automatic Control and Computer Sciences 2017 Vol. 51 No. 7 P. 709-723
Added: December 1, 2017
Mecheraoui K., Lomazova I. A., Belala N., Journal of Parallel and Distributed Computing 2021 Vol. 155 P. 14-23
This paper provides a true-concurrency approach for the specification and verification of systems of concurrent communicating agents with durable actions. We present high-level Petri nets with durable actions (DaHL) to cope with various details in such complex systems. We define a DaHL module as an open variant of time-dependent colored Petri nets. A DaHL system ...
Added: May 13, 2021
Begicheva A., Lomazova I. A., Nesterov R., / Cornell University. Series Computer Science "arxiv.org". 2023.
Process mining is a field of computer science that deals with discovery and analysis of process models based on automatically generated event logs. Currently, many companies use this technology for optimization and improving their processes. However, a discovered process model may be too detailed, sophisticated and difficult for experts to understand. In this paper, we ...
Added: March 31, 2023
Netherlands : Springer, 2017
<TBD> ...
Added: August 28, 2017
Vladimir A. Bashkin, Lomazova I. A., Fundamenta Informaticae 2011 Vol. 109 No. 3 P. 223-236
A new formalism of Resource Driven Automata Nets (RDA-nets) is presented. A RDAnet has two levels: a system level is represented by a net of active resources, describing distribution of agents/resources and their interactions; agents in an object level are finite automata, communicating via ports and shared resources of a system level. RDA-nets are assigned ...
Added: February 2, 2013
Switzerland : Springer, 2017
This book constitutes the proceedings of the 38th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2017, held in Zaragoza, Spain, in June 2017. Petri Nets 2017 is co-located with the Application of Concurrency to System Design Conference, ACSD 2017.
The 16 papers, 9 theory papers, 4 application papers, and 3 tool papers, ...
Added: May 6, 2017
Vladimir A. Bashkin, Lomazova I. A., Fundamenta Informaticae 2012 Vol. 120 No. 3-4 P. 243-257
Resource-driven automata (RDA) are finite automata, sitting in the nodes of a finite system net and asynchronously consuming/producing shared resources through input/output system ports (arcs of the system net). RDAs themselves may be resources for each other, thus allowing the highly flexible structure of the model. It was proved earlier, that RDA-nets are expressively equivalent ...
Added: November 28, 2012
Dordrecht, L., Heidelberg, NY : Springer, 2013
This volume constitutes the proceedings of the 34th International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2013). The Petri Net conferences serve as annual meeting places to discuss the progress in the field of Petri nets and related models of concurrency. They provide a forum for researchers to present and ...
Added: November 3, 2013
Dworzanski L. W., Formal Methods in System Design (Нидерланды, целевой журнал) 2020
The nested Petri nets (NP-nets) are a nets-within-nets formalism convenient for modelling systems that consist of distributed mobile agents with individual behaviour. The expressiveness of
the NP-nets formalism is greater than that of classical place/transition nets; and, the formalism
allows to model open multiagent systems with agents being introduced, eliminated, and cloned.
Several verification methods based on structural ...
Added: November 2, 2019
K.G. Serebrennikov, Proceedings of the Institute for System Programming of the RAS 2019 Vol. 31 No. 4 P. 163-174
. In this paper, we propose an approach to implementation of the algorithm for computing transition priorities for live Petri nets. Priorities are a form of constraints which can be imposed to ensure liveness and boundedness of a Petri net model. These properties are highly desirable in analysis of different types of systems, ranging from business processes systems ...
Added: October 24, 2019
Mitsyuk A. A., Shugurov I., Моделирование и анализ информационных систем 2014 Т. 21 № 4 С. 181-198
Process mining is a new emerging discipline related to process management, formal process models, and data mining. One of the main tasks of process mining is the model synthesis (discovery) based on the event logs. A wide range of algorithms for process model discovery, analysis, and enhancement are developed. The real-life event logs often contain ...
Added: October 20, 2014
Lomazova I. A., Popova-Zeugmann L., Fundamenta Informaticae 2016 Vol. 143 No. 1-2 P. 101-112
In this paper we examine how it is possible to control Petri net behavior with the help of transition priorities. Controlling here means forcing a process to behave in a stable way by ascribing priorities to transitions and hence transforming a classic Petri net into a Priority Petri net. For Petri net models stability is ...
Added: October 12, 2015
R.A. Nesterov, S.Yu. Savelyev, Proceedings of the Institute for System Programming of the RAS 2021 Vol. 33 No. 3 P. 155-170
In this paper, we present an approach to the generation of Petri nets exhibiting desired structural and behavioral properties. Given a reference Petri net, we apply a collection of local refinement transformations, which extends the internal structure of the reference model. The correctness of applying these transformations is justified via Petri net morphisms and by ...
Added: August 9, 2021
Sukhoroslov O. V., Journal of Parallel and Distributed Computing 2018 Vol. 118 No. 1 P. 177-188
The paper presents an approach to the design and implementation of web-based environments for practical exercises in parallel and distributed computing (PDC). The presented approach introduces minimal development and operational costs by relying on Everest, a general-purpose platform for building computational web services. The flexibility of proposed service-oriented architecture enables the development of different types ...
Added: August 27, 2018
Nesterov R.A., Mitsyuk A.A., Lomazova I.A., Proceedings of the Institute for System Programming of the RAS 2018 Vol. 30 No. 3 P. 285-302
In this paper, we present an approach to model and simulate models of multi-agent systems (MAS) using Petri nets. A MAS is modeled as a set of workflow nets. The agent-toagent interactions are described by means of an interface. It is a logical formula over atomic interaction constraints specifying the order of inner agent actions. ...
Added: July 10, 2018
Lomazova I. A., Mitsyuk A. A., Rivkin A., / Cornell University. Series Computer Science "arxiv.org". 2021.
Recently introduced Petri net-based formalisms advocate the importance of proper representation and management of case objects as well as their co-evolution. In this work we build on top of one of such formalisms and introduce the notion of soundness for it. We demonstrate that for nets with non-deterministic synchronization between case objects, the soundness problem ...
Added: October 14, 2022