Correctness Notions for Petri Nets with Identifiers
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908942836170752 |
|---|---|
| author | van der Werf, Jan Martijn E. M. Rivkin, Andrey Montali, Marco Polyvyanyy, Artem |
| author_facet | van der Werf, Jan Martijn E. M. Rivkin, Andrey Montali, Marco Polyvyanyy, Artem |
| contents | A model of an information system describes its processes and how resources are involved in these processes to manipulate data objects. This paper presents an extension to the Petri nets formalism suitable for describing information systems in which states refer to object instances of predefined types and resources are identified as instances of special object types. Several correctness criteria for resource- and object-aware information systems models are proposed, supplemented with discussions on their decidability for interesting classes of systems. These new correctness criteria can be seen as generalizations of the classical soundness property of workflow models concerned with process control flow correctness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_07363 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Correctness Notions for Petri Nets with Identifiers van der Werf, Jan Martijn E. M. Rivkin, Andrey Montali, Marco Polyvyanyy, Artem Formal Languages and Automata Theory A model of an information system describes its processes and how resources are involved in these processes to manipulate data objects. This paper presents an extension to the Petri nets formalism suitable for describing information systems in which states refer to object instances of predefined types and resources are identified as instances of special object types. Several correctness criteria for resource- and object-aware information systems models are proposed, supplemented with discussions on their decidability for interesting classes of systems. These new correctness criteria can be seen as generalizations of the classical soundness property of workflow models concerned with process control flow correctness. |
| title | Correctness Notions for Petri Nets with Identifiers |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2212.07363 |