Petri Nets with Parameterised Data

Ghilardi, Silvio; Gianola, Alessandro; Montali, Marco; Rivkin, Andrey

doi:10.1007/978-3-030-58666-9_4

Cited by 30 publications

(18 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Applications are also important for testing the feasibility of the algorithms suggested by theoretical research in concrete implementations. As briefly mentioned in the introduction, frameworks for the verification of data-aware processes [35,69,70] provide a particularly interesting setting where (combined) uniform interpolation plays a crucial role from the theoretical, the methodological/algorithmic, and the operational perspectives (see [71] for an exhaustive introduction to this topic). In this context, complex dynamic systems that can interact with a persistent data storage are verified against some property of interest via sophisticated techniques based on SMT-solving and on automated reasoning; specifically, the presence of the 'data' component, which is usually represented as relational databases that the 'process' component can query and update, requires the development of suitable techniques for eliminating (to some extent) quantifiers binding variables that range over the content of such databases.…”

Section: Discussionmentioning

confidence: 99%

Interpolation and Uniform Interpolation in Quantifier-Free Fragments of Combined First-Order Theories

Ghilardi

Gianola

2022

Mathematics

Self Cite

View full text Add to dashboard Cite

In this survey, we report our recent work concerning combination results for interpolation and uniform interpolation in the context of quantifier-free fragments of first-order theories. We stress model-theoretic and algebraic aspects connecting this topic with amalgamation, strong amalgamation, and model-completeness. We give sufficient (and, in relevant situations, also necessary) conditions for the transfer of the quantifier-free interpolation property to combined first-order theories; we also investigate the non-disjoint signature case under the assumption that the shared theory is universal Horn. For convex, strong-amalgamating, stably infinite theories over disjoint signatures, we also provide a modular transfer result for the existence of uniform interpolants. Model completions play a key role in the whole paper: They enter into transfer results in the non-disjoint signature case and also represent a semantic counterpart of uniform interpolants.

show abstract

Section: Discussionmentioning

confidence: 99%

Interpolation and Uniform Interpolation in Quantifier-Free Fragments of Combined First-Order Theories

Ghilardi

Gianola

2022

Mathematics

Self Cite

View full text Add to dashboard Cite

show abstract

“…We consider the present work, together with [12,13,17,28], as the starting point for a full line of research dedicated to SMT-based techniques for the effective verification of data-aware processes [15], addressing richer forms of verification beyond safety (such as liveness, fairness, or full LTL-FO) and richer classes of artifact systems, (e.g., with concrete data types and arithmetics), while identifying novel decidable classes (e.g., by restricting the structure of the DB and of transition and state formulae) beyond the ones presented in [13,17]. Concerning implementation, we plan to further develop our tool to incorporate in it the plethora of optimizations and sophisticated search strategies available in infinite-state SMT-based model checking.…”

Section: Discussionmentioning

confidence: 99%

Model Completeness, Uniform Interpolants and Superposition Calculus

et al. 2021

Self Cite

View full text Add to dashboard Cite

Uniform interpolants have been largely studied in non-classical propositional logics since the nineties; a successive research line within the automated reasoning community investigated uniform quantifier-free interpolants (sometimes referred to as “covers”) in first-order theories. This further research line is motivated by the fact that uniform interpolants offer an effective solution to tackle quantifier elimination and symbol elimination problems, which are central in model checking infinite state systems. This was first pointed out in ESOP 2008 by Gulwani and Musuvathi, and then by the authors of the present contribution in the context of recent applications to the verification of data-aware processes. In this paper, we show how covers are strictly related to model completions, a well-known topic in model theory. We also investigate the computation of covers within the Superposition Calculus, by adopting a constrained version of the calculus and by defining appropriate settings and reduction strategies. In addition, we show that computing covers is computationally tractable for the fragment of the language used when tackling the verification of data-aware processes. This observation is confirmed by analyzing the preliminary results obtained using the mcmt tool to verify relevant examples of data-aware processes. These examples can be found in the last version of the tool distribution.

show abstract

“…We focus on block-structured BPMN since this allows us to define a direct execution semantics also for advanced constructs like interrupting exceptions and cancelations, and to exploit this upon verifying the resulting models (see [1] for the technical details). However, our approach would seamlessly carry over to the case where the control-flow backbone of the process is captured using a Petri net, as in [13]. Although, conceptually, delta-BPMN supports the same set of blocks as DAB [1], its current implementation covers the fundamental blocks shown in Figure 1.…”

Section: The Process Component Of Delta-bpmnmentioning

confidence: 99%

Delta-BPMN: A Concrete Language and Verifier for Data-Aware BPMN

Ghilardi

Gianola

Montali

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

The increasing recognition of the need for integrating data and processes, both at conceptual and system levels, raises a new demand in standardfriendly, verifiable data-aware process modelling languages. So far, a few proposals in the area have been largely focusing on either uncharted approaches or conceptual proposals that would lack in tool support. In this work, we propose delta-BPMNa verifiable operational framework for data-aware processes that employs (blockstructured) BPMN to capture the process backbone, and a SQL-based language for representing and manipulating volatile and persistent data. We also propose a proof-of-concept implementation of delta-BPMN by realising the front-end part in Camunda and the back-end in a framework that translates language specifications into the executable code of a state-of-the-art SMT-based model checker.

show abstract

Petri Nets with Parameterised Data

Cited by 30 publications

References 22 publications

Interpolation and Uniform Interpolation in Quantifier-Free Fragments of Combined First-Order Theories

Interpolation and Uniform Interpolation in Quantifier-Free Fragments of Combined First-Order Theories

Model Completeness, Uniform Interpolants and Superposition Calculus

Delta-BPMN: A Concrete Language and Verifier for Data-Aware BPMN

Contact Info

Product

Resources

About