The following pages link to CADP (Q17140):
Displaying 50 items.
- Fault trees on a diet: automated reduction by graph rewriting (Q2403528) (← links)
- Nested-unit Petri nets (Q2423743) (← links)
- Session types for safe web service orchestration (Q2436511) (← links)
- On testing UML statecharts (Q2500697) (← links)
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal (Q2568979) (← links)
- Decomposing monolithic processes in a process algebra with multi-actions (Q2693301) (← links)
- The Korrigan environment (Q2709215) (← links)
- (Q2769597) (← links)
- Branching Bisimulation Games (Q2827464) (← links)
- Distributed branching bisimulation reduction of state spaces (Q2845494) (← links)
- Partial model checking using networks of labelled transition systems and Boolean equation systems (Q2851668) (← links)
- Relating hybrid chi to other formalisms (Q2864397) (← links)
- Model-based engineering of embedded systems using the hybrid process algebra Chi (Q2870190) (← links)
- Reflections on the future of concurrency theory in general and process calculi in particular (Q2870196) (← links)
- Ten Years of Saturation: A Petri Net Perspective (Q2889608) (← links)
- Synchronizability for Verification of Asynchronously Communicating Systems (Q2891401) (← links)
- Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems (Q2894270) (← links)
- Specification Guidelines to Avoid the State Space Explosion Problem (Q2894558) (← links)
- Efficient approximation of optimal control for continuous-time Markov games (Q2911641) (← links)
- Efficient Modelling and Generation of Markov Automata (Q2912690) (← links)
- Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols (Q2915106) (← links)
- A compositional framework to the specification of service protocols controllability and substitutability (Q2921918) (← links)
- Deciding choreography realizability (Q2942872) (← links)
- Structural Analysis of Boolean Equation Systems (Q2946656) (← links)
- Improving Time Bounded Reachability Computations in Interactive Markov Chains (Q2948248) (← links)
- CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes (Q3000666) (← links)
- Verification of Context-Dependent Channel-Based Service Models (Q3066118) (← links)
- The How and Why of Interactive Markov Chains (Q3066128) (← links)
- Performance Model Checking Scenario-Aware Dataflow (Q3172842) (← links)
- (Q3394898) (← links)
- A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains (Q3510814) (← links)
- Sigref – A Symbolic Bisimulation Tool Box (Q3522930) (← links)
- (Q3539948) (← links)
- Computation Tree Regular Logic for Genetic Regulatory Networks (Q3540063) (← links)
- Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations (Q3584957) (← links)
- Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format (Q3605462) (← links)
- Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms (Q3612925) (← links)
- Hierarchical Adaptive State Space Caching Based on Level Sampling (Q3617761) (← links)
- Towards Performance Prediction of Compositional Models in Industrial GALS Designs (Q3636862) (← links)
- Compositional Abstraction for Stochastic Systems (Q3648832) (← links)
- (Q4417943) (← links)
- (Q4417945) (← links)
- (Q4471921) (← links)
- (Q4518897) (← links)
- Performance validation tools for software/hardware systems (Q4538592) (← links)
- (Q4551165) (← links)
- Counterexample Guided Synthesis of Monitors for Realizability Enforcement (Q4649300) (← links)
- Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols (Q4921500) (← links)
- Tools and Methods for RTCP-Nets Modeling and Verification (Q4971674) (← links)
- Abstraction in Fixpoint Logic (Q5277894) (← links)
