Verifying Temporal Logic Formulas in Abstractions of Large Reachability Graphs
Nitsche, U. (1994) Verifying Temporal Logic Formulas in Abstractions of Large Reachability Graphs. Proc. National Workshop on Algorithms and Tools for Petri Nets (AWP) Humboldt Universit{\"a}t, 42-47.
Download
Full text not available from this repository.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Additional Information: | Address: Berlin, Germany |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science |
| Item ID: | 253219 |
| Date Deposited: | 03 May 2000 |
| Last Modified: | 01 Mar 2012 10:35 |
| Contributors: | Nitsche, U. (Author) Desel, J. (Editor) Oberweis, A. (Editor) Reisig, W. (Editor) |
| Date: | 1994 |
| Additional Information: | Address: Berlin, Germany |
| Status: | Published |
| Publisher: | Humboldt Universit{\"a}t |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/253219 |
Actions (login required)
 |
View Item |
