Cited in
(20)- Multiset rewriting for the verification of depth-bounded processes with name binding
- Deciding safety properties in infinite-state pi-calculus via behavioural types
- A practical approach to verification of mobile systems using net unfolding
- A counter abstraction technique for verifying properties of probabilistic swarm systems
- Numerical homogenization: survey, new results, and perspectives
- On hierarchical communication topologies in the \(\pi\)-calculus
- Encoding Asynchronous Interactions Using Open Petri Nets
- PLTMGC
- MWB
- SLMC
- Overture Tool
- VDMTools
- ByMC
- Liveness in broadcast networks
- A polynomial translation of \(\pi \)-calculus (FCP) to safe Petri nets
- Efficient coverability analysis by proof minimization
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
- A polynomial translation of \(\pi\)-calculus FCPS to safe Petri nets
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
This page was built for software: Petruchio
