Results 1  10
of
21,392
UCPOP: A Sound, Complete, Partial Order Planner for ADL
, 1992
"... We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove ucpo ..."
Abstract

Cited by 493 (25 self)
 Add to MetaCart
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove
Modelling Concurrency with Partial Orders
, 1986
"... Concurrency has been expressed variously in terms of formal languages (typically via the shuffle operator), partial orders, and temporal logic, inter alia. In this paper we extract from these three approaches a single hybrid approach having a rich language that mixes algebra and logic and having a n ..."
Abstract

Cited by 260 (17 self)
 Add to MetaCart
Concurrency has been expressed variously in terms of formal languages (typically via the shuffle operator), partial orders, and temporal logic, inter alia. In this paper we extract from these three approaches a single hybrid approach having a rich language that mixes algebra and logic and having a
Partially Ordered Sets
, 2000
"... this article we define the choice function of a nonempty set family that does not contain ; as introduced in [6, pages 8889]. We define order of a set as a relation being reflexive, antisymmetric and transitive in the set, partially ordered set as structure nonempty set and order of the set, cha ..."
Abstract

Cited by 155 (4 self)
 Add to MetaCart
this article we define the choice function of a nonempty set family that does not contain ; as introduced in [6, pages 8889]. We define order of a set as a relation being reflexive, antisymmetric and transitive in the set, partially ordered set as structure nonempty set and order of the set
Partial Ordering
"... Partial orders are special relations are special sets. are structurally the same as directed acyclic graphs. Synonyms: partial order, partially ordered set, poset, or simply order. Partial orders can be used to formally capture many informal concepts such as parthood (“the hall is part of the house” ..."
Abstract
 Add to MetaCart
Partial orders are special relations are special sets. are structurally the same as directed acyclic graphs. Synonyms: partial order, partially ordered set, poset, or simply order. Partial orders can be used to formally capture many informal concepts such as parthood (“the hall is part of the house
PartialOrder Methods for the Verification of Concurrent Systems  An Approach to the StateExplosion Problem
, 1995
"... Statespace exploration techniques are increasingly being used for debugging and proving correct finitestate concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy to ..."
Abstract

Cited by 368 (12 self)
 Add to MetaCart
Statespace exploration techniques are increasingly being used for debugging and proving correct finitestate concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy to use: they are fully automatic. Moreover, the range of properties that they can verify has been substantially broadened thanks to the development of modelchecking methods for various temporal logics. The main limit of statespace exploration verification techniques is the often excessive size of the state space due, among other causes, to the modeling of concurrency by interleaving. However, exploring all interleavings of concurrent events is not a priori necessary for verification: interleavings corresponding to the same concurrent execution contain related information. One can thus hope to be able to verify properties of a concurrent system without exploring all interleavings of its concu...
Timestamps in MessagePassing Systems That Preserve the Partial Ordering,”
 Proc. 11th Austral. Comput. Sci. Conf. (ACSC ‘88)
, 1988
"... ABSTRACT Timestamping is a common method of totally ordering events in concurrent programs. However, for applications requiring access to the global state, a total ordering is inappropriate. This paper presents algorithms for timestamping events in both synchronous and asynchronous n1essagepassing ..."
Abstract

Cited by 223 (3 self)
 Add to MetaCart
passing programs that allow for access to the partial ordering inherent in a parallel system. The algorithms do not change the con1munications graph or require a central timestamp issuing authority.
Reviving Partial Order Planning
, 2001
"... This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make them competitive with the state of the art plan synthesis algorithms. Our key insight is that the techniques respons ..."
Abstract

Cited by 79 (7 self)
 Add to MetaCart
This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make them competitive with the state of the art plan synthesis algorithms. Our key insight is that the techniques
Revising Partially Ordered Beliefs
 in Proc. of the 9th International Workshop on NonMonotonic Reasoning
, 2002
"... This paper deals with the revision of partially ordered beliefs. It proposes a semantic representation of epistemic states by partial preorders on interpretations and a syntactic representation by partially ordered belief bases. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper deals with the revision of partially ordered beliefs. It proposes a semantic representation of epistemic states by partial preorders on interpretations and a syntactic representation by partially ordered belief bases.
Tripled partially ordered sets
"... In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partially ordered sets. Some basic properties on these new defined sets are studied and some examples for clarifying are given. ..."
Abstract
 Add to MetaCart
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partially ordered sets. Some basic properties on these new defined sets are studied and some examples for clarifying are given.
Partiallyordered modalities
 in Advances in Modal Logic
"... Modal logic is extended by partially ordering the modalities. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The partial order does not conflict with type of modality (K, S4, etc.) although this paper will concen ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Modal logic is extended by partially ordering the modalities. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The partial order does not conflict with type of modality (K, S4, etc.) although this paper
Results 1  10
of
21,392