A polynomial translation of -calculus (FCP) to safe Petri nets

DOI10.1007/978-3-642-32940-1_31zbMATH Open1364.68292arXiv1309.0717OpenAlexW2015130290MaRDI QIDQ2912696FDOQ2912696

Authors: Roland Meyer, Victor Khomenko, Reiner Hüchting 

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: We develop a polynomial translation from finite control pi-calculus processes to safe low-level Petri nets. To our knowledge, this is the first such translation. It is natural in that there is a close correspondence between the control flows, enjoys a bisimulation result, and is suitable for practical model checking.

Full work available at URL: https://arxiv.org/abs/1309.0717

Recommendations

• A polynomial translation of \(\pi\)-calculus FCPS to safe Petri nets
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• A Petri Net Translation of π-Calculus Terms
• Petri net semantics of the finite \(\pi\)-calculus terms
• A compositional Petri net translation of general \(\pi\)-calculus terms

zbMATH Keywords

model checkingPetri net\(\pi \)-calculusfinite control process

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (11)

• Petri net semantics of the finite \(\pi\)-calculus terms
• Title not available (Why is that?)
• A practical approach to verification of mobile systems using net unfolding
• A Petri Net Translation of π-Calculus Terms
• A polynomial translation of mobile ambients into safe Petri nets. Understanding a calculus of hierarchical protection domains
• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
• Non-interference by unfolding
• A compositional Petri net translation of general \(\pi\)-calculus terms
• A polynomial translation of \(\pi\)-calculus FCPS to safe Petri nets
• Toward extracting \(\pi\)-calculus from UML sequence and state diagrams
• Formal Techniques for Networked and Distributed Systems – FORTE 2004

Uses Software

• Petruchio

This page was built for publication: A polynomial translation of \(\pi \)-calculus (FCP) to safe Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912696)