CADP

swMATH4993MaRDI QIDQ17140

No author found.

Related Items (only showing first 100 items - show all)

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

This page was built for software: CADP