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 Sciences and Engineering > Electronics and Computer Science
ePrint ID: 253219
Date Deposited: 03 May 2000
Last Modified: 27 Mar 2014 19:55
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/253219

Actions (login required)

View Item View Item