CADP

swMATH4993MaRDI QIDQ17140FDOQ17140

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Reflections on the future of concurrency theory in general and process calculi in particular
• Synchronizability for Verification of Asynchronously Communicating Systems
• Efficient SAT-based bounded model checking for software verification
• A formal verification technique for behavioural model-to-model transformations
• Title not available (Why is that?)
• Efficient approximation of optimal control for continuous-time Markov games
• Invariants for parameterised Boolean equation systems
• Efficient approximation of optimal control for continuous-time Markov games
• Explaining safety violations in real-time systems
• Two case studies of semantics execution in Maude: CCS and LOTOS
• Nested-unit Petri nets
• On testing UML statecharts
• CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
• Model Checking of Biological Systems
• Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols
• The Korrigan environment
• Interactive Markov chains. And the quest for quantified quality
• Extended dependency graphs and efficient distributed fixed-point computation
• Verification of the link layer protocol of the IEEE-1394 serial bus (FireWire): An experiment with E-LOTOS
• Verification of mobile ad hoc networks: an algebraic approach
• Verification of \(\mathrm{EB}^3\) specifications using CADP
• Counterexample Guided Synthesis of Monitors for Realizability Enforcement
• Formal modelling and verification of GALS systems using GRL and CADP
• Compositional abstraction for stochastic systems
• Title not available (Why is that?)
• Sigref – A Symbolic Bisimulation Tool Box
• Title not available (Why is that?)
• Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
• Sequential and distributed on-the-fly computation of weak tau-confluence
• From generic partition refinement to weighted tree automata minimization
• Planning proofs of equations in CCS
• The How and Why of Interactive Markov Chains
• Analysis of a distributed system for lifting trucks.
• Hierarchical Adaptive State Space Caching Based on Level Sampling
• On the diversity of asynchronous communication
• Automated verification of automata communicating via FIFO and bag buffers
• A compositional model to reason about end-to-end QoS in stochastic Reo connectors
• Formal Modeling and Analysis of Timed Systems
• A generic framework for \(n\)-protocol compatibility checking
• Revisiting sequential composition in process calculi
• Translating FSP into LOTOS and networks of automata
• On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
• Selective mu-calculus and formula-based equivalence of transition systems
• Efficient Modelling and Generation of Markov Automata
• Partial model checking using networks of labelled transition systems and Boolean equation systems
• Title not available (Why is that?)
• An efficient algorithm for computing bisimulation equivalence
• Symbolic Reachability for Process Algebras with Recursive Data Types
• Automated compositional Markov chain generation for a plain-old telephone system
• A brief history of process algebra
• An Overview of the mCRL2 Toolset and Its Recent Advances
• PIC2LNT: Model Transformation for Model Checking an Applied Pi-Calculus
• Improving active Mealy machine learning for protocol conformance testing
• A linear process-algebraic format with data for probabilistic automata
• An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
• Improving Time Bounded Reachability Computations in Interactive Markov Chains
• Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous
• Compositional verification of asynchronous concurrent systems using CADP
• A compositional framework to the specification of service protocols controllability and substitutability
• Deciding choreography realizability
• Distributed branching bisimulation reduction of state spaces
• Modular semantics for a UML statechart diagrams kernel and its extension to multicharts and branching time model-checking
• Towards Performance Prediction of Compositional Models in Industrial GALS Designs
• CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
• Computation Tree Regular Logic for Genetic Regulatory Networks
• Confluence reduction for Markov automata
• Computing maximal weak and other bisimulations
• Verification of Context-Dependent Channel-Based Service Models
• Ensuring liveness properties of distributed systems: open problems
• Model checking properties on reduced trace systems
• Title not available (Why is that?)
• Reduced models for efficient CCS verification
• Stepwise development of process-algebraic specifications in decorated trace semantics
• Title not available (Why is that?)
• Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal
• 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
• The electronic tool integration platform: Concepts and design
• Ten Years of Saturation: A Petri Net Perspective
• Session types for safe web service orchestration
• Formal Techniques for Networked and Distributed Systems - FORTE 2003
• Structural Analysis of Boolean Equation Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Abstraction in Fixpoint Logic
• Off-the-shelf automated analysis of liveness properties for just paths
• An integrated framework for the performance analysis of asynchronous communicating stochastic processes
• Evaluation of cyber security and modelling of risk propagation with Petri nets
• Model-based engineering of embedded systems using the hybrid process algebra Chi
• Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms
• Theorem proving graph grammars with attributes and negative application conditions
• Specification Guidelines to Avoid the State Space Explosion Problem
• Scaling up livelock verification for network-on-chip routing algorithms
• Coupled similarity: the first 32 years
• Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
• Tools and Methods for RTCP-Nets Modeling and Verification
• Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems
• Performance validation tools for software/hardware systems
• Performance Model Checking Scenario-Aware Dataflow
• Probabilistic Model Checking for Energy-Utility Analysis

This page was built for software: CADP