Verifying Temporal Logic Formulas in Abstractions of Large Reachability Graphs


Nitsche, U., (1994) Verifying Temporal Logic Formulas in Abstractions of Large Reachability Graphs Desel, J., Oberweis, A. and Reisig, W. (eds.) At Proc. National Workshop on Algorithms and Tools for Petri Nets (AWP). , pp. 42-47.

Download

Full text not available from this repository.

Item Type: Conference or Workshop Item (Other)
Additional Information: Address: Berlin, Germany
Venue - Dates: Proc. National Workshop on Algorithms and Tools for Petri Nets (AWP), 1994-01-01
Organisations: Electronics & Computer Science
ePrint ID: 253219
Date :
Date Event
1994Published
Date Deposited: 03 May 2000
Last Modified: 17 Apr 2017 23:26
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/253219

Actions (login required)

View Item View Item