Andrey Rivkin

Andrey Rivkin

Auto-generated profile, based on publicly available information

Andrey Rivkin

Technical University of Denmark

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2016 in Formal Aspects of Computing
Verified
Journal Article
Open access
PDF file
MMMarco Montali
Marco Montali
ARAndrey Rivkin
Andrey Rivkin
Petri nets with name creation and management ( ν -PNs) have been recently introduced as an expressive model for dynamic (distributed) systems, whose dynamics are determined not only by how tokens flow in the system, but also by the pure names they carry. On the one hand, this extension makes the resulting nets strictly more expressive than P/T nets: they can be exploited to capture a plethora of interesting systems, such as distributed systems enriched with channels and name passing, service interaction with correlation mechanisms, and resource-constrained workflow nets that explicitly account for process instances. On the other hand, fundamental properties like coverability, termination and boundedness are decidable for ν -PNs. In this work, we go one step beyond the verification of such general properties, and provide decidability and undecidability results of model checking ν -PNs against variants of first-order μ -calculus, recently proposed in the area of data-aware process analysis. While this model checking problem is undecidable in the general case, decidability can be obtained by considering different forms of boundedness, which still give raise to an infinite-state transition system. We then ground our framework to tackle the problem of soundness checking over workflow nets enriched with explicit process instances and resources. Notably, our decidability results are obtained via a translation to data-centric dynamic systems, a recently devised framework for the formal specification and verification of data-aware business processes working over full-fledged relational databases with constraints. In this light, our results contribute to the cross-fertilization between the area of formal methods for concurrent systems and that of foundations of data-aware processes, which has not been extensively investigated so far.

4 September 2020
Verified
Book Chapter
Closed access
PDF file
SGSilvio Ghilardi
Silvio Ghilardi
AGAlessandro Gianola
Alessandro Gianola
MMMarco Montali
Marco Montali
ARAndrey Rivkin
Andrey Rivkin

28 August 2023 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Open access
PFPaolo Felli
Paolo Felli
AGAlessandro Gianola
Alessandro Gianola
MMMarco Montali
Marco Montali
ARAndrey Rivkin
Andrey Rivkin
SWSarah Winkler
Sarah Winkler

13 June 2022
Verified
Book Chapter
Closed access
PDF file
JWJan Martijn E. M. van der Werf
Jan Martijn E. M. van der Werf
ARAndrey Rivkin
Andrey Rivkin
APArtem Polyvyanyy
Artem Polyvyanyy
MMMarco Montali
Marco Montali

12 May 2022 in Journal of Automated Reasoning
Verified
Journal Article
Open access
PDF file
DCDiego Calvanese
Diego Calvanese
SGSilvio Ghilardi
Silvio Ghilardi
AGAlessandro Gianola
Alessandro Gianola
MMMarco Montali
Marco Montali
ARAndrey Rivkin
Andrey Rivkin
Uniform interpolants were largely studied in non-classical propositional logics since the nineties, and their connection to model completeness was pointed out in the literature. A successive parallel research line inside the automated reasoning community investigated uniform quantifier-free interpolants (sometimes referred to as “covers”) in first-order theories. In this paper, we investigate cover transfer to theory combinations in the disjoint signatures case. We prove that, for convex theories, cover algorithms can be transferred to theory combinations under the same hypothesis needed to transfer quantifier-free interpolation (i.e., the equality interpolating property, aka strong amalgamation property). The key feature of our algorithm relies on the extensive usage of the Beth definability property for primitive fragments to convert implicitly defined variables into their explicitly defining terms. In the non-convex case, we show by a counterexample that covers may not exist in the combined theories, even in case combined quantifier-free interpolants do exist. However, we exhibit a cover transfer algorithm operating also in the non-convex case for special kinds of theory combinations; these combinations (called ‘tame combinations’) concern multi-sorted theories arising in many model-checking applications (in particular, the ones oriented to verification of data-aware processes).

7 September 2022
Verified
Book Chapter
Closed access
PDF file
PFPaolo Felli
Paolo Felli
AGAlessandro Gianola
Alessandro Gianola
MMMarco Montali
Marco Montali
ARAndrey Rivkin
Andrey Rivkin
SWSarah Winkler
Sarah Winkler