Cited in
(31)- Reflections on the future of concurrency theory in general and process calculi in particular
- Accelerating the computation of dead and concurrent places using reductions
- Nested-unit Petri nets
- Automatic decomposition of Petri nets into automata networks -- a synthetic account
- Efficient algorithms for three reachability problems in safe Petri nets
- Translating FSP into LOTOS and networks of automata
- jETI
- PiXL
- BISIMULATOR
- M-TREE
- AEGIS
- TINA
- libDDD
- Renew
- CADP
- Fiacre
- csp2B
- Exp.Open
- LLBMC
- CAESAR_SOLVE
- Petriweb
- Murphi
- XTL
- caesar.bdd
- LOEWE
- NUPN_INFO
- PNML2NUPN
- PNMC
- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
- CADP 2010: a toolbox for the construction and analysis of distributed processes
- Preventing differential fault analysis attack on AEGIS family of ciphers
This page was built for software: CAESAR
