The following pages link to CAESAR (Q40852):
Displaying 9 items.
- Translating FSP into LOTOS and networks of automata (Q613134) (← links)
- Accelerating the computation of dead and concurrent places using reductions (Q832013) (← links)
- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP (Q1001805) (← links)
- Preventing differential fault analysis attack on AEGIS family of ciphers (Q2050730) (← links)
- Efficient algorithms for three reachability problems in safe Petri nets (Q2117182) (← links)
- Nested-unit Petri nets (Q2423743) (← links)
- Reflections on the future of concurrency theory in general and process calculi in particular (Q2870196) (← links)
- CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes (Q3000666) (← links)
- Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account (Q5100747) (← links)