MWB
From MaRDI portal
Cited in
(53)- A theory of structural stationarity in the \(\pi\)-calculus
- ACVisualizer
- SIGREF
- A two-phase approach for design of supervisory controllers for robot cells: Model checking and Markov decision models
- BISIMULATOR
- M-TREE
- Petruchio
- Coalgebraic minimization of HD-automata for the -calculus using polymorphic types
- A partition refinement algorithm for the -calculus
- Behavior analysis for validating communication patterns
- Symbolic transition graph and its early bisimulation checking algorithms for the \(\pi\)-calculus
- Computing bisimulations for finite-control -calculus
- Modeling ontology evolution via pi-calculus
- Facile
- Pict
- TVT
- tKlaim
- fc2tools
- A static analysis of cryptographic processes: the denotational approach
- ContentCVS
- PIC2LNT
- MMC
- Concurrency Workbench
- PEP
- A polynomial translation of -calculus FCPS to safe Petri nets
- Self-assembling trees
- VDMTools
- Overture Tool
- Mec 5
- SPEC
- VERSA
- Formalising the pi-calculus using nominal logic
- ACVisualizer: A visualization tool for APi-calculus
- Modelling and Verifying Mobile Systems Using π-Graphs
- Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus
- Algebra and logic for resource-based systems modelling
- A logical and computational theory of located resource
- mCRL
- Computing strong and weak bisimulations for psi-calculi
- From a concurrent λ-calculus to the π-calculus
- A characterisation of open bisimilarity using an intuitionistic modal logic
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems
- CONCUR 2004 - Concurrency Theory
- PIC2LNT: model transformation for model checking an applied pi-calculus
- Encoding cryptographic primitives in a calculus with polyadic synchronisation
- Behavioral equivalence in the polymorphic pi-calculus
- Formal Methods in Software and Systems Modeling
- A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
- Bisimulation verification using the up to techniques
- Explicit substitutions for -congruences
- Bisimulations in the join-calculus
- Global computing in a dynamic network of tuple spaces
- A compositional Petri net translation of general -calculus terms
This page was built for software: MWB
