Sciweavers

1157 search results - page 34 / 232
» Descriptive Complexity and Model Checking
Sort
View
IDA
2007
Springer
14 years 1 months ago
Compact and Understandable Descriptions of Mixtures of Bernoulli Distributions
Abstract. Finite mixture models can be used in estimating complex, unknown probability distributions and also in clustering data. The parameters of the models form a complex repres...
Jaakko Hollmén, Jarkko Tikka
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
TOCL
2011
87views more  TOCL 2011»
13 years 2 months ago
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
ECMDAFA
2010
Springer
241views Hardware» more  ECMDAFA 2010»
14 years 12 days ago
Detecting Inconsistencies in Multi-View Models with Variability
Multi-View Modeling (MVM) is a common modeling practice that advocates the use of multiple, different and yet related models to represent the needs of diverse stakeholders. Of cruc...
Roberto Erick Lopez-Herrejon, Alexander Egyed
FORMATS
2003
Springer
14 years 24 days ago
Discrete-Time Rewards Model-Checked
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
Suzana Andova, Holger Hermanns, Joost-Pieter Katoe...