A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets

DOI10.1007/978-3-642-32940-1_31zbMath1364.68292arXiv1309.0717OpenAlexW2015130290MaRDI QIDQ2912696

Roland Meyer, Reiner Hüchting, Victor Khomenko

Publication date: 25 September 2012

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

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

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)

Related Items (1)

Non-interference by Unfolding

Uses Software

• Petruchio

This page was built for publication: A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets