timed-automata-analyzer 0.9.1 → 1.0.1

package/README.md

@@ -21,7 +21,7 @@ In case you want to contribute to the tool or fork the repository, only few step
 - As a first step, you need to install Rust.
   See the [Rust website](https://www.rust-lang.org/tools/install) for information on how to do this.
 - Additionally, you need to install _wasm-pack_ with `cargo install wasm-pack` for WebAssembly outputs.
-- The WebAssembly binary (including glue code for JavaScript/TypeScript and an NPM package) is generated by running `wasm-pack build --target bundler`.
+- The WebAssembly binary (including glue code for JavaScript/TypeScript and an npm package) is generated by running `wasm-pack build --target bundler` and published to the npm registry by running `wasm-pack publish`.
 - This project includes an extensive test suite. Tests can be run with `cargo test`.
 - For linting, this project uses the built-in linter of Rust as well as [Clippy](https://github.com/rust-lang/rust-clippy).
   To run the linters, execute `cargo check` and `cargo clippy`, respectively.

package/package.json

@@ -5,7 +5,7 @@
     "luth1um"
   ],
   "description": "An analyzer for Timed Automata written in Rust",
-  "version": "0.9.1",
+  "version": "1.0.1",
   "license": "MIT",
   "repository": {
     "type": "git",

package/timed_automata_analyzer.d.ts

@@ -1,6 +1,23 @@
 /* tslint:disable */
 /* eslint-disable */
 /**
+* Checks all locations of the input TA for reachability and returns all unreachable locations. The
+* result will be empty if all locations are reachable.
+*
+* This function will throw an error if one or more validation checks fail. The following
+* properties will be validated:
+* <ul>
+* <li>There exists exactly one initial location.</li>
+* <li>The set of locations is non-empty.</li>
+* <li>All invariants are downward-closed.</li>
+* <li>The highest constant used in any clock constraint is not greater than the highest allowed
+* value (536870909).</li>
+* <li>All locations names are unique.</li>
+* <li>All clock names are unique.</li>
+* <li>All clocks used in clock constraints are also contained in the set of clocks.</li>
+* <li>All location names used as source and target of switches are also contained in the set of
+* locations.</li>
+* </ul>
 * @param {TimedAutomaton} ta
 * @returns {(string)[]}
 */

package/timed_automata_analyzer_bg.js

@@ -151,6 +151,23 @@ function getArrayJsValueFromWasm0(ptr, len) {
     return result;
 }
 /**
+* Checks all locations of the input TA for reachability and returns all unreachable locations. The
+* result will be empty if all locations are reachable.
+*
+* This function will throw an error if one or more validation checks fail. The following
+* properties will be validated:
+* <ul>
+* <li>There exists exactly one initial location.</li>
+* <li>The set of locations is non-empty.</li>
+* <li>All invariants are downward-closed.</li>
+* <li>The highest constant used in any clock constraint is not greater than the highest allowed
+* value (536870909).</li>
+* <li>All locations names are unique.</li>
+* <li>All clock names are unique.</li>
+* <li>All clocks used in clock constraints are also contained in the set of clocks.</li>
+* <li>All location names used as source and target of switches are also contained in the set of
+* locations.</li>
+* </ul>
 * @param {TimedAutomaton} ta
 * @returns {(string)[]}
 */