Hackage :: [Package]

CSPM-FiringRules: Firing rules semantic of CSPM

[ bsd3, concurrency, formal-methods, language, library ] [ Propose Tags ]

This package contains functions for computing the transitions of a CSP process based on the standard CSP firing rule semantic (see The Theory and Practice of Concurrency A.W. Roscoe 1999.) It also contains a rudimentary tracer for executing transitions, some QuickCheck tests, and a data type for proof trees. To use this package one has to provide instances for the classes and type families, defined in the CSPM-CoreLanguage package. The package contains two mock-implementations that provide these instances. The CSPM-Interpreter package contains an other implementation.

[Skip to Readme]

Flags

Automatic Flags
NameDescriptionDefault
quickcheck

enable QuickCheck tests

Enabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.3.0.3, 0.4.0.0, 0.4.1.2, 0.4.2.0, 0.4.3.0, 0.4.4.0
Dependencies base (>=4.0 && <5.0), containers (>=0.5 && <0.6), CSPM-CoreLanguage (>=0.3 && <0.4), mtl (>=2.1 && <2.3), parallel-tree-search (>=0.4 && <0.5), QuickCheck (>=2.6 && <2.11), random (>=1.0 && <1.2), tree-monad (>=0.3 && <0.4) [details]
License BSD-3-Clause
Author 2010 - 2017 Marc Fontaine <Marc.Fontaine@gmx.de>
Maintainer Marc Fontaine <Marc.Fontaine@gmx.de>
Category Language, Formal Methods, Concurrency
Source repo head: git clone git://github.com/MarcFontaine/cspm
Uploaded by MarcFontaine at 2017-10-26T16:04:59Z
Distributions
Reverse Dependencies 2 direct, 0 indirect [details]
Downloads 7288 total (21 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-10-26 [all 1 reports]

Readme for CSPM-FiringRules-0.4.4.0

[back to package description]

CSPM-FiringRules

This package contains functions for computing the transitions of a CSP process based on the standard CSP firing rule semantic (see The Theory and Practice of Concurrency A.W. Roscoe 1999.) It also contains a rudimentary tracer for executing transitions, some QuickCheck tests, and a data type for proof trees. To use this package one has to provide instances for the classes and type families, defined in the CSPM-CoreLanguage package. The package contains two mock-implementations that provide these instances. The CSPM-Interpreter package contains an other implementation.

Haddock documentation