CADP 2010: a toolbox for the construction and analysis of distributed processes
From MaRDI portal
Publication:3000666
Recommendations
Cites work
- scientific article; zbMATH DE number 1283472 (Why is no real title available?)
- scientific article; zbMATH DE number 1956597 (Why is no real title available?)
- scientific article; zbMATH DE number 1538042 (Why is no real title available?)
- scientific article; zbMATH DE number 1746649 (Why is no real title available?)
- scientific article; zbMATH DE number 1418456 (Why is no real title available?)
- Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus
- Interactive Markov chains. And the quest for quantified quality
- Model checking and boolean graphs
- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
- Reflections on the future of concurrency theory in general and process calculi in particular
- Rewriting of imperative programs into logical equations
- Solving Parity Games in Big Steps
- State space reduction for process algebra specifications
- Tools and Algorithms for the Construction and Analysis of Systems
- Translating FSP into LOTOS and networks of automata
Cited in
(37)- A compositional framework to the specification of service protocols controllability and substitutability
- Equivalence checking 40 years after: a review of bisimulation tools
- Performance model checking scenario-aware dataflow
- scientific article; zbMATH DE number 1956597 (Why is no real title available?)
- Cartesian difference categories
- Evaluation of cyber security and modelling of risk propagation with Petri nets
- A case in point: verification and testing of a EULYNX interface
- Sequential and distributed on-the-fly computation of weak tau-confluence
- A linear process-algebraic format with data for probabilistic automata
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- Fault trees on a diet: automated reduction by graph rewriting
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- Automated verification of automata communicating via FIFO and bag buffers
- Convex lattice equation systems
- Probabilistic model checking for energy-utility analysis
- Scaling up livelock verification for network-on-chip routing algorithms
- An \(\mathcal O(m\log n)\) algorithm for computing stuttering equivalence and branching bisimulation
- A formal verification technique for behavioural model-to-model transformations
- Ensuring liveness properties of distributed systems: open problems
- Formal modelling and verification of GALS systems using GRL and CADP
- Identity-Based Cryptosystems and Quadratic Residuosity
- Reflections on the future of concurrency theory in general and process calculi in particular
- On the use of model and logical embeddings for model checking of probabilistic systems
- Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets
- A generic framework for \(n\)-protocol compatibility checking
- Model checking properties on reduced trace systems
- On the diversity of asynchronous communication
- An overview of the mCRL2 toolset and its recent advances
- Compositional verification of asynchronous concurrent systems using CADP
- Simulation relations and applications in formal methods
- Computing maximal weak and other bisimulations
- The Conic toolkit for building distributed systems
- On the Minimisation of Acyclic Models
- Improving active Mealy machine learning for protocol conformance testing
- Probabilistic model checking of BPMN processes at runtime
- Elimination of detached regions in dependency graph verification
- Branching bisimulation games
Describes a project that uses
Uses Software
This page was built for publication: CADP 2010: a toolbox for the construction and analysis of distributed processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000666)
