CADP
From MaRDI portal
Cited in
(only showing first 100 items - show all)- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
- Galileo
- GreatSPN
- jETI
- Sylvan
- SCADE
- SIGREF
- TAPAAL
- WSAT
- PRISM
- Rapide
- Analysis of a distributed system for lifting trucks.
- Kronos
- Tiburon
- TREX
- TIMES
- JTorX
- mCRL2
- MoDeST
- GreatSPN 1.7
- Uppaal2k
- Truth/SLC
- DiVer
- PiXL
- SPADES
- BISIMULATOR
- M-TREE
- ECDAR
- MANIFOLD
- LOTOS
- MOTOR
- E-LOTOS
- SHARPE
- IF-2.0
- SPIN
- libDDD
- SMART_
- Möbius
- MRMC
- DiVinE
- NuSMV
- ProbDiVinE
- Automated verification of automata communicating via FIFO and bag buffers
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors
- Renew
- MWB
- Extended dependency graphs and efficient distributed fixed-point computation
- CEGAR
- Uppaal
- Model checking properties on reduced trace systems
- A brief history of process algebra
- Reo
- Verification of the link layer protocol of the IEEE-1394 serial bus (FireWire): An experiment with E-LOTOS
- The electronic tool integration platform: Concepts and design
- Continuous modeling of real-time and hybrid systems: From concepts to tools
- OMT and SDL based techniques and tools for design, simulation and test production of distributed systems
- Protocol verification with the Aldébaran toolset
- Planning proofs of equations in CCS
- Modular semantics for a UML statechart diagrams kernel and its extension to multicharts and branching time model-checking
- An integrated framework for the performance analysis of asynchronous communicating stochastic processes
- An efficient algorithm for computing bisimulation equivalence
- BPEL2oWFN
- Fiacre
- Rodin
- Atelier B
- TorX
- LTSmin
- STG
- TaPAS
- Orc
- Automated compositional Markov chain generation for a plain-old telephone system
- Selective mu-calculus and formula-based equivalence of transition systems
- Exp.Open
- csp2B
- From generic partition refinement to weighted tree automata minimization
- SPNP
- Ensuring liveness properties of distributed systems: open problems
- Dryad
- SysML
- Compositional verification of concurrent systems by combining bisimulations
- PlusCal
- Scaling up livelock verification for network-on-chip routing algorithms
- Joeq
- VLTS Benchmark Suite
- TVT
- Coupled similarity: the first 32 years
- Off-the-shelf automated analysis of liveness properties for just paths
- JITty
- SMI++
- CAESAR_SOLVE
- SCOOP
- PEPA
- RoVerGeNe
- Evaluation of cyber security and modelling of risk propagation with Petri nets
- FDR2
- Compositional verification of asynchronous concurrent systems using CADP
- Theorem proving graph grammars with attributes and negative application conditions
- InVeSt
- Fault trees on a diet: automated reduction by graph rewriting
- Polychrony
This page was built for software: CADP
