Verifying Temporal Logic Formulas in Abstractions of Large Reachability Graphs


Nitsche, Ulrich (1994) Verifying Temporal Logic Formulas in Abstractions of Large Reachability Graphs. National Workshop on Algorithms and Tools for Petri Nets (Algorithmen und Werkzeuge für Petrinetze, AWP'94) Humboldt Universität Berlin, 42.

Download

Full text not available from this repository.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science
ePrint ID: 252678
Date Deposited: 10 Mar 2000
Last Modified: 27 Mar 2014 19:54
Publisher: Humboldt Universität Berlin
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/252678

Actions (login required)

View Item View Item