CADP

CADP (”Construction and Analysis of Distributed Processes”, formerly known as ”CAESAR/ALDEBARAN Development Package”) is a popular toolbox for the design of communication protocols and distributed systems. CADP is developed by the VASY team at INRIA Rhone-Alpes and connected to various complementary tools. CADP is maintained, regularly improved, and used in many industrial projects.


References in zbMATH (referenced in 133 articles , 1 standard article )

Showing results 1 to 20 of 133.
Sorted by year (citations)

1 2 3 ... 5 6 7 next

  1. Lang, Frédéric; Mateescu, Radu; Mazzanti, Franco: Compositional verification of concurrent systems by combining bisimulations (2021)
  2. Mari, Thomas; Dang, Thao; Gössler, Gregor: Explaining safety violations in real-time systems (2021)
  3. Wißmann, Thorsten; Deifel, Hans-Peter; Milius, Stefan; Schröder, Lutz: From generic partition refinement to weighted tree automata minimization (2021)
  4. Bisping, Benjamin; Nestmann, Uwe; Peters, Kirstin: Coupled similarity: the first 32 years (2020)
  5. Bouwman, Mark; Luttik, Bas; Willemse, Tim: Off-the-shelf automated analysis of liveness properties for just paths (2020)
  6. Garavel, Hubert: Nested-unit Petri nets (2019)
  7. van Glabbeek, Rob: Ensuring liveness properties of distributed systems: open problems (2019)
  8. Akroun, Lakhdar; Salaün, Gwen: Automated verification of automata communicating via FIFO and bag buffers (2018)
  9. de Putter, Sander; Wijs, Anton: A formal verification technique for behavioural model-to-model transformations (2018)
  10. da Costa Cavalheiro, Simone André; Foss, Luciana; Ribeiro, Leila: Theorem proving graph grammars with attributes and negative application conditions (2017)
  11. Dalsgaard, Andreas E.; Enevoldsen, Søren; Fogh, Peter; Jensen, Lasse S.; Jepsen, Tobias S.; Kaufmann, Isabella; Larsen, Kim G.; Nielsen, Søren M.; Olesen, Mads Chr.; Pastva, Samuel; Srba, Jiří: Extended dependency graphs and efficient distributed fixed-point computation (2017)
  12. Evrard, Hugues; Lang, Frédéric: Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous (2017)
  13. Groote, Jan Friso; Jansen, David N.; Keiren, Jeroen J. A.; Wijs, Anton J.: An (\mathcalO(m\logn)) algorithm for computing stuttering equivalence and branching bisimulation (2017)
  14. Junges, Sebastian; Guck, Dennis; Katoen, Joost-Pieter; Rensink, Arend; Stoelinga, Mariëlle: Fault trees on a diet: automated reduction by graph rewriting (2017)
  15. Szpyrka, Marcin; Jasiul, Bartosz: Evaluation of cyber security and modelling of risk propagation with Petri nets (2017)
  16. Boulgakov, Alexandre; Gibson-Robinson, Thomas; Roscoe, A. W.: Computing maximal weak and other bisimulations (2016)
  17. Chevrou, Florent; Hurault, Aurélie; Quéinnec, Philippe: On the diversity of asynchronous communication (2016)
  18. de Frutos Escrig, David; Keiren, Jeroen J. A.; Willemse, Tim A. C.: Branching bisimulation games (2016)
  19. Fearnley, John; Rabe, Markus N.; Schewe, Sven; Zhang, Lijun: Efficient approximation of optimal control for continuous-time Markov games (2016)
  20. Jebali, Fatma; Lang, Frédéric; Mateescu, Radu: Formal modelling and verification of GALS systems using GRL and CADP (2016)

1 2 3 ... 5 6 7 next