#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2012

2014

- This year (0)
- Last 5 years (5)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Reiner Hüchting, Rupak Majumdar, Roland Meyer
- CONCUR
- 2013

We develop a theory of name-bounded π-calculus processes, which have a bound on the number of restricted names that holds for all reachable processes. Name boundedness reflects resource constraints in practical reconfigurable systems, like available communication channels in networks and address space limitations in software. Our focus is on the algorithmic… (More)

- Roland Meyer, Victor Khomenko, Reiner Hüchting
- CONCUR
- 2012

We develop a polynomial translation from finite control processes (an important fragment of π-calculus) to safe low-level Petri nets. To our knowledge, this is the first such translation. It is natural (there is a close correspondence between the control flow of the original specification and the resulting Petri net), enjoys a bisimulation result, and is… (More)

- Reiner Hüchting, Rupak Majumdar, Roland Meyer
- CONCUR
- 2014

We study natural semantic fragments of the π-calculus: depthbounded processes (there is a bound on the longest communication path), breadth-bounded processes (there is a bound on the number of parallel processes sharing a name), and name-bounded processes (there is a bound on the number of shared names). We give a complete characterization of the… (More)

- Victor Khomenko, Roland Meyer, Reiner Hüchting
- Logical Methods in Computer Science
- 2013

We develop a polynomial translation from finite control π-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.

We develop a polynomial translation from finite control processes (an important fragment of pi-calculus) to safe low-level Petri nets. To our knowledge, this is the first such translation. It is natural (there is a close correspondence between the control flow of the original specification and the resulting Petri net), enjoys a bisimulation result, and is… (More)

- ‹
- 1
- ›