mCRL2

swMATH1496MaRDI QIDQ14230FDOQ14230

Author name not available (Why is that?)

Cited In (59)

• Model Checking Value-Passing Modal Specifications
• Title not available (Why is that?)
• Family-Based SPL Model Checking Using Parity Games with Variability
• Dynamic Consistency in Process Algebra: From Paradigm to ACP
• Realizability and dynamic reconfiguration of chor specifications
• Conceptual building blocks for modeling reconfiguration of component-based systems using Petri nets
• Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions
• A formal verification technique for behavioural model-to-model transformations
• Invariants for parameterised Boolean equation systems
• Suitability of mCRL2 for Concurrent-System Design: A 2 × 2 Switch Case Study
• Lifting non-finite axiomatizability results to extensions of process algebras
• Dynamic consistency in process algebra: from paradigm to ACP
• Off-the-shelf automated analysis of liveness properties for just paths (extended abstract)
• A set automaton to locate all pattern matches in a term
• An efficient algorithm to determine probabilistic bisimulation
• A Multi-Core Solver for Parity Games
• Abstraction in Fixpoint Logic
• Instantiation for Parameterised Boolean Equation Systems
• Off-the-shelf automated analysis of liveness properties for just paths
• A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus
• Verification of mobile ad hoc networks: an algebraic approach
• Analysing sanity of requirements for avionics systems
• Title not available (Why is that?)
• Verification of reactive systems via instantiation of parameterised Boolean equation systems
• Symbolic execution of Reo circuits using constraint automata
• Saving space in a time efficient simulation algorithm
• From generic partition refinement to weighted tree automata minimization
• Symbolic Analysis Tools for CSP
• Theorem proving graph grammars with attributes and negative application conditions
• Axiomatizing recursion-free, regular monitors
• Specification Guidelines to Avoid the State Space Explosion Problem
• Synchronous Kleene algebra
• Strategies, model checking and branching-time properties in Maude
• A formal semantics of extended hierarchical state transition matrices using CSP\#
• Term rewriting on GPUs
• A generic framework for \(n\)-protocol compatibility checking
• Revisiting sequential composition in process calculi
• An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
• Title not available (Why is that?)
• Product line process theory
• Input-output conformance testing for software product lines
• An Overview of the mCRL2 Toolset and Its Recent Advances
• Verification of distributed systems with the axiomatic system of MSVL
• An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
• Combine and conquer: relating BIP and Reo
• Analysing an autonomous tramway positioning system with the \textsc{Uppaal} statistical model checker
• Branching Bisimulation Games
• A formalisation of consistent consequence for Boolean equation systems
• Improving parity game solvers with justifications
• Extended beam search for non-exhaustive state space analysis
• Decomposing monolithic processes in a process algebra with multi-actions
• A Formal Calculus for Informal Equality with Binding
• Verification of Context-Dependent Channel-Based Service Models
• Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations
• Interface automata for shared memory
• Logical characterisations, rule formats and compositionality for input-output conformance simulation
• Lifted structural invariant analysis of Petri net product lines
• Modeling and verification of reconfigurable printing system based on process algebra
• Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types

This page was built for software: mCRL2