Pages that link to "Item:Q3000666"
From MaRDI portal
The following pages link to CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes (Q3000666):
Displayed 32 items.
- Verification of \(\mathrm{EB}^3\) specifications using CADP (Q282110) (← links)
- Formal modelling and verification of GALS systems using GRL and CADP (Q315303) (← links)
- On the diversity of asynchronous communication (Q315311) (← links)
- A generic framework for \(n\)-protocol compatibility checking (Q433347) (← links)
- Sequential and distributed on-the-fly computation of weak tau-confluence (Q436408) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- A formal verification technique for behavioural model-to-model transformations (Q682361) (← links)
- A linear process-algebraic format with data for probabilistic automata (Q764285) (← links)
- Automated verification of automata communicating via FIFO and bag buffers (Q1650866) (← links)
- Model checking properties on reduced trace systems (Q1736621) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Scaling up livelock verification for network-on-chip routing algorithms (Q2152663) (← links)
- Probabilistic model checking of BPMN processes at runtime (Q2165511) (← links)
- Cartesian difference categories (Q2200813) (← links)
- Evaluation of cyber security and modelling of risk propagation with Petri nets (Q2333477) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Fault trees on a diet: automated reduction by graph rewriting (Q2403528) (← links)
- Identity-Based Cryptosystems and Quadratic Residuosity (Q2798777) (← links)
- Branching Bisimulation Games (Q2827464) (← links)
- Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular (Q2870196) (← links)
- A compositional framework to the specification of service protocols controllability and substitutability (Q2921918) (← links)
- Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets (Q2941150) (← links)
- Performance Model Checking Scenario-Aware Dataflow (Q3172842) (← links)
- On the Minimisation of Acyclic Models (Q3541025) (← links)
- Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities (Q5164168) (← links)
- An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211) (← links)
- Probabilistic Model Checking for Energy-Utility Analysis (Q5418957) (← links)
- Elimination of detached regions in dependency graph verification (Q6049047) (← links)
- Simulation relations and applications in formal methods (Q6113980) (← links)
- Convex lattice equation systems (Q6113988) (← links)
- Equivalence checking 40 years after: a review of bisimulation tools (Q6163887) (← links)