The University of Southampton
University of Southampton Institutional Repository

Deterministic ω-regular liveness properties

Deterministic ω-regular liveness properties
Deterministic ω-regular liveness properties
A major drawback for the use of automated verification techniques is the complexity of verification algorithms in general. One of the sources of the algorithms' complexity is the difference between the language classes accepted by deterministic and nondeterministic Büchi-automata respectively. This difference causes the problem of complementing Büchi-automata and hence deciding subset conditions on regular ω-languages to be PSPACE-complete. We investigate in this paper whether nontrivial property classes exist that can be characterized by deterministic Büchi-automata and hence be complemented rather easily.
Since the class of safety properties is known to be representable deterministically, taking into account that safety properties are the closed sets in
the Cantor topology, it suffices for us to identify nontrivial deterministic ω-regular liveness properties.
237-247
Nießner, F.
b5d632b7-d6d1-4b5d-a59c-cde37a9da491
Nitsche, U.
6d9cf989-a6bb-4dee-b363-aa239b544072
Ochsenschläger, P.
fc02f6f0-01e3-4551-9378-012d3f06626b
Bozapalidis, S.
140b5a73-2553-432a-8e3c-f240d6087691
Nießner, F.
b5d632b7-d6d1-4b5d-a59c-cde37a9da491
Nitsche, U.
6d9cf989-a6bb-4dee-b363-aa239b544072
Ochsenschläger, P.
fc02f6f0-01e3-4551-9378-012d3f06626b
Bozapalidis, S.
140b5a73-2553-432a-8e3c-f240d6087691

Nießner, F., Nitsche, U. and Ochsenschläger, P. (1998) Deterministic ω-regular liveness properties. Bozapalidis, S. (ed.) Proc. 3rd Int. Conf. Developments in Language Theory (DLT). pp. 237-247 .

Record type: Conference or Workshop Item (Other)

Abstract

A major drawback for the use of automated verification techniques is the complexity of verification algorithms in general. One of the sources of the algorithms' complexity is the difference between the language classes accepted by deterministic and nondeterministic Büchi-automata respectively. This difference causes the problem of complementing Büchi-automata and hence deciding subset conditions on regular ω-languages to be PSPACE-complete. We investigate in this paper whether nontrivial property classes exist that can be characterized by deterministic Büchi-automata and hence be complemented rather easily.
Since the class of safety properties is known to be representable deterministically, taking into account that safety properties are the closed sets in
the Cantor topology, it suffices for us to identify nontrivial deterministic ω-regular liveness properties.

Full text not available from this repository.

More information

Published date: 1998
Additional Information: Address: Thessaloniki, Greece
Venue - Dates: Proc. 3rd Int. Conf. Developments in Language Theory (DLT), 1998-01-01
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 250534
URI: http://eprints.soton.ac.uk/id/eprint/250534
PURE UUID: 0aca48a2-1115-4039-b504-a47e6e5cdc9d

Catalogue record

Date deposited: 04 Aug 1999
Last modified: 29 Jan 2020 14:58

Export record

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.

×