354 search results - page 7 / 71 » Modal and Temporal Logics for Processes |
CHARME
2005
Springer
14 years 14 days ago
2005
Springer
Timing diagrams are useful for capturing temporal specifications in which all mentioned events are required to occur. We first show that translating timing diagrams with both par...
TIME
1999
IEEE
13 years 11 months ago
1999
IEEE
We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus [5] and Kabanza [11], where domain-dependent search control knowledge represented as tem...
LPAR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Recently, graded modalities have been added to the semantics of two of the logics most commonly used by the computer science community:
TOCL
2008
13 years 6 months ago
2008
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
FSTTCS
2004
Springer
14 years 9 days ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...