Sciweavers

1743 search results - page 39 / 349
» Generalized Modal Satisfiability
Sort
View
FSTTCS
2006
Springer
14 years 1 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Laura Bozzelli, Mojmír Kretínsk&yacu...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 10 months ago
Characterising Probabilistic Processes Logically
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
Yuxin Deng, Rob J. van Glabbeek
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 10 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich
ENTCS
2008
112views more  ENTCS 2008»
13 years 10 months ago
Residual for Component Specifications
We address the problem of component reuse by describing a quotient operation. Starting from the specifications of the behaviors of the component and of the desired overall system,...
Jean-Baptiste Raclet
ACTA
2004
97views more  ACTA 2004»
13 years 9 months ago
Past is for free: on the complexity of verifying linear temporal properties with past
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
Nicolas Markey