CSPM-FiringRules: Firing rules semantic of CSPM
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.
Flags
Automatic Flags
| Name | Description | Default |
|---|---|---|
| quickcheck | enable QuickCheck tests | Enabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- CSPM-FiringRules-0.3.0.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
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.4 && <0.5), CSPM-CoreLanguage (>=0.2 && <0.3), mtl (>=1.1 && <1.2 || >=2.0 && <2.1), parallel-tree-search (>=0.4 && <0.5), QuickCheck (>=2.4 && <2.5), random (>=1.0 && <1.1), tree-monad (>=0.3 && <0.4) [details] |
| License | BSD-3-Clause |
| Author | 2010 - 2011 Marc Fontaine |
| Maintainer | Marc Fontaine <fontaine@cs.uni-duesseldorf.de> |
| Category | Language, Formal Methods, Concurrency |
| Home page | http://www.stups.uni-duesseldorf.de/~fontaine/csp |
| Uploaded | by MarcFontaine at 2011-03-18T16:03:33Z |
| Distributions | |
| Reverse Dependencies | 2 direct, 0 indirect [details] |
| Downloads | 7288 total (20 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |