Petri nets with semi-structured data

Eric Badouel 1 Loïc Hélouët 1 Christophe Morvan 1, 2
1 SUMO - SUpervision of large MOdular and distributed systems
IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL, Inria Rennes – Bretagne Atlantique
Abstract : This paper proposes Structured Data Nets (SDN), a Petri net extension that describes transactional systems with data. In these nets, tokens are semi-structured documents. Each transition is attached to a query, guarded by patterns, (logical assertions on the contents of its preset) and transforms tokens. We define SDNs and their semantics. We then consider their formal properties: coverability of a marking, termination and soundness of transactions. Unrestricted SDNs are Turing complete , so these properties are undecidable. We thus use an order on documents , and show that under reasonable restrictions on documents and on the expressiveness of patterns and queries, SDNs are well-structured transition systems, for which coverability, termination and soundness are decidable.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01193279
Contributor : Loic Helouet <>
Submitted on : Monday, September 7, 2015 - 8:23:27 AM
Last modification on : Thursday, February 7, 2019 - 2:22:49 PM
Long-term archiving on : Tuesday, December 8, 2015 - 10:39:55 AM

File

Datanets.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01193279, version 1

Citation

Eric Badouel, Loïc Hélouët, Christophe Morvan. Petri nets with semi-structured data. Petri Nets 2015, 36th International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2015, Bruxelles, Belgium. pp.212-233. ⟨hal-01193279⟩

Share

Metrics

Record views

579

Files downloads

189