1743 search results - page 39 / 349 » Generalized Modal Satisfiability |
104
click to vote
FSTTCS
2006
Springer
15 years 4 months ago
2006
Springer
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...
83
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
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...
88
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
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...
ENTCS
2008
15 years 25 days ago
2008
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,...
104
Voted
ACTA
2004
15 years 19 days ago
2004
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...