The following pages link to CADP (Q17140):
Displaying 50 items.
- Efficient approximation of optimal control for continuous-time Markov games (Q259052) (← links)
- 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)
- Confluence reduction for Markov automata (Q507382) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous (Q516036) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- Verification of mobile ad hoc networks: an algebraic approach (Q549194) (← links)
- Translating FSP into LOTOS and networks of automata (Q613134) (← links)
- A formal verification technique for behavioural model-to-model transformations (Q682361) (← links)
- Interactive Markov chains. And the quest for quantified quality (Q701689) (← links)
- A linear process-algebraic format with data for probabilistic automata (Q764285) (← links)
- Stepwise development of process-algebraic specifications in decorated trace semantics (Q816202) (← links)
- Reduced models for efficient CCS verification (Q816205) (← links)
- Two case studies of semantics execution in Maude: CCS and LOTOS (Q816216) (← links)
- Explaining safety violations in real-time systems (Q832041) (← links)
- Revisiting sequential composition in process calculi (Q890611) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Invariants for parameterised Boolean equation systems (Q960855) (← links)
- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP (Q1001805) (← links)
- Analysis of a distributed system for lifting trucks. (Q1400154) (← links)
- Automated verification of automata communicating via FIFO and bag buffers (Q1650866) (← links)
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors (Q1651010) (← links)
- Extended dependency graphs and efficient distributed fixed-point computation (Q1662534) (← links)
- Model checking properties on reduced trace systems (Q1736621) (← links)
- A brief history of process algebra (Q1781995) (← links)
- Verification of the link layer protocol of the IEEE-1394 serial bus (FireWire): An experiment with E-LOTOS (Q1856183) (← links)
- The electronic tool integration platform: Concepts and design (Q1856185) (← links)
- Continuous modeling of real-time and hybrid systems: From concepts to tools (Q1856190) (← links)
- OMT and SDL based techniques and tools for design, simulation and test production of distributed systems (Q1856197) (← links)
- Protocol verification with the Aldébaran toolset (Q1856199) (← links)
- Planning proofs of equations in CCS (Q1857269) (← links)
- Modular semantics for a UML statechart diagrams kernel and its extension to multicharts and branching time model-checking (Q1858428) (← links)
- An integrated framework for the performance analysis of asynchronous communicating stochastic processes (Q1882804) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Automated compositional Markov chain generation for a plain-old telephone system (Q1969600) (← links)
- Selective mu-calculus and formula-based equivalence of transition systems (Q1970206) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Compositional verification of concurrent systems by combining bisimulations (Q2147689) (← links)
- Scaling up livelock verification for network-on-chip routing algorithms (Q2152663) (← links)
- Coupled similarity: the first 32 years (Q2182667) (← links)
- Off-the-shelf automated analysis of liveness properties for just paths (Q2182670) (← 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)
- Theorem proving graph grammars with attributes and negative application conditions (Q2358623) (← links)
