Analysis of Petri Nets and Transition Systems

This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent, dedicated algorithms which have been designed to operate modularly, portably, extensibly, and efficiently.Comment: In Proceedings ICE 2015, arXiv:1508.0459

Tensor network and (pp-adic) AdS/CFT

We use the tensor network living on the Bruhat-Tits tree to give a concrete realization of the recently proposed $p$-adic AdS/CFT correspondence (a holographic duality based on the $p$-adic number field $\mathbb{Q}_p$). Instead of assuming the $p$-adic AdS/CFT correspondence, we show how important features of AdS/CFT such as the bulk operator reconstruction and the holographic computation of boundary correlators are automatically implemented in this tensor network.Comment: 59 pages, 18 figures; v3: improved presentation, added figures and reference