Complexity of Decision Problems for Mixed and Modal Specifications

Adam Antonik, Michael Huth, Ulrik Mathias Nyman, Kim Guldstrand Larsen, Andrzej Wasowski

Publikation: Artikel i tidsskrift og konference artikel i tidsskriftKonferenceartikelForskningpeer review

Abstrakt

We consider decision problems for modal and mixed transition systems used as specifications: the common implementation problem (whether a set of specifications has a common implementation), the consistency problem (whether a single specification has an implementation), and the thorough refinement problem (whether all implementations of one specification are also implementations of another one). Common implementation and thorough refinement are shown to be PSPACE-hard for modal, and so also for mixed, specifications. Consistency is PSPACE-hard
for mixed, while trivial for modal specifications. We also supply upper bounds suggesting strong links between these problems.

OriginalsprogEngelsk
BogserieLecture Notes in Computer Science
Sider (fra-til)112-126
ISSN0302-9743
DOI
StatusUdgivet - 2008
Begivenhed11th International Conference, FOSSACS 2008:Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. - Budapest, Ungarn
Varighed: 29 mar. 20086 apr. 2008
Konferencens nummer: 11

Konference

Konference11th International Conference, FOSSACS 2008:Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008.
Nummer11
Land/OmrådeUngarn
ByBudapest
Periode29/03/200806/04/2008

Citationsformater