The University of Southampton
University of Southampton Institutional Repository

Verifying Temporal Logic Formulas in Abstractions of Large Reachability Graphs

Nitsche, Ulrich, (1994) Verifying Temporal Logic Formulas in Abstractions of Large Reachability Graphs Desel, Jörg, Oberweis, Andreas and Reisig, Wolfgang (eds.) At National Workshop on Algorithms and Tools for Petri Nets (Algorithmen und Werkzeuge für Petrinetze, AWP'94). , p. 42.

Record type: Conference or Workshop Item (Other)

Full text not available from this repository.

More information

Published date: 1994
Venue - Dates: National Workshop on Algorithms and Tools for Petri Nets (Algorithmen und Werkzeuge für Petrinetze, AWP'94), 1994-01-01
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 252678
URI: http://eprints.soton.ac.uk/id/eprint/252678
PURE UUID: b7f7ef0f-8d73-4fc3-bfcf-5c98f6ed234c

Catalogue record

Date deposited: 10 Mar 2000
Last modified: 18 Jul 2017 10:03

Export record

Contributors

Author: Ulrich Nitsche
Editor: Jörg Desel
Editor: Andreas Oberweis
Editor: Wolfgang Reisig

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×