On-The-Fly Solving for Symbolic Parity Games using the mCRL2 toolset

This artifact contains a set of mCRL2 specifications and formulas that are used to compare various on-the-fly solving techniques for symbolic parity games. The techniques are described in the paper "On-The-Fly Solving for Symbolic Parity Games" by Maurice Laveaux, Wieger Wesselink and Tim A.C. Willemse

Antichain-based refinement checking benchmark using the mCRL2 toolset

A set of benchmarks consisting of mCRL2 specifications that can be compared using the ltscompare tool of the mCRL2 toolset

Experiments for the paper "(Re)moving Quantifiers to Simplify Parameterised Boolean Equation Systems"

This archive contains files for experiments with quantifier elimination for parameterised Boolean equation systems, as described in the paper Thomas Neele, (Re)moving Quantifiers to Simplify Parameterised Boolean Equation Systems, in ARQNL 2022, CEUR-WS. Each folder contains an mCRL2 process specification, a modal mu-calculus formula and a bash script run.sh. To run the experiments, an installation of the mCRL2 tool set (version 202206.0 or newer) should be available in the PATH. Source code and binaries are available via https://mcrl2.org or https://github.com/mCRL2org/mCRL2. The run scripts automatically generate a linear process (LPS) and a PBES. The latter is used to compare three approaches: Not applying any constant elimination. Applying the standard constant elimination algorithm from the paper "Static Analysis Techniques for Parameterised Boolean Equation Systems" by Simona Orzan, Wieger Wesselink and Tim A. C. Willemse. Applying the quantifier analysis of the paper mentioned at the top. In case of the motivating example, the resulting PBES for each approach is printed to stdout. For the ABP and cache coherence examples, the size of the underlying BES (called structure graph in the tools) is printed

Replication package for the paper "Compositional Automata Learning of Synchronous Systems"

This artifact package allows replication of the results in the paper "Compositional Automata Learning of Synchronous Systems" accepted for publication at FASE2023. It contains the source code of the tool Coal, as well as experimental files and scripts to run the experiments. Dependencies required to install the artifact in the FASE2023 virtual machine (https://doi.org/10.5281/zenodo.7446277) are included

Replication package for the paper "Compositional Automata Learning of Synchronous Systems"

This artifact package allows replication of the results in the paper "Compositional Automata Learning of Synchronous Systems" accepted for publication at FASE2023. It contains the source code of the tool Coal, as well as experimental files and scripts to run the experiments. Dependencies required to install the artifact in the FASE2023 virtual machine (https://doi.org/10.5281/zenodo.7446277) are included

Replication package with proofs for the paper "Operations on Fixpoint Equation Systems"

This archive contains mechanized proofs for the theorems and lemmas that appear in the paper Operations on Fixpoint Equation Systems, Thomas Neele and Jaco van de Pol This package contains proofs in both Coq and PVS. See the included README file for details on how to execute the proofs

mCRL2 models, requirements and test logs for the EULYNX Point interface case study

mCRL2 models and mu-calculus formulas for the EULYNX Point Interface. Models and requirements are made in the context of the FormaSig project. Data is made available for replication purposes. REQ_P_001, REQ_P_001_1 and REQ_P_002 are requirements for the point specific mCRL2 model point_spec.mcrl2 Remaining .mcf files are requirements for the generic PDI interface pdi_spec.mcrl2 Artifacts relating to testing are: An mCRL2 model, mbt.mcrl2A rename file to rename internal actions to tau, rename_file.rePartial state space associated to mbt.mcrl2, partial_state_space.autThe weak-trace bisim reduced version of the state space, partial_state_space_reduced.autTesting logs, test-logs.zipThe source code of the simulator and the testing tools, Simulator code.zi

Decomposing Monolithic Processes using the mCRL2 toolset

A set of experiments consisting of mCRL2 specifications that can be decomposed into two monolithic processes using the lpscleave tool of the mCRL2 toolset. The resulting monolithic processes can be subsequently composed to obtain the state space of the original specification more efficiently than by exploring the original specification itself. The technique is described in detail in the "Decomposing Monolithic Processes in a Process Algebra with Multi-actions" paper

Decomposing Monolithic Processes using the mCRL2 toolset

A set of experiments consisting of mCRL2 specifications that can be decomposed into two (or more) monolithic processes using the lpscleave tool of the mCRL2 toolset. The resulting monolithic processes can be subsequently composed to obtain the state space of the original specification more efficiently than by exploring the original specification itself. The technique is described in detail in the "Decomposing Monolithic Processes in a Process Algebra with Multi-actions" paper

Dataset with experiments for 'Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems'

This archive contains the experiments that were performed as part of the publication Thomas Neele, Tim A. C. Willemse, Wieger Wesselink: Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems. TACAS 2020 (accepted for publication)