• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 799
Next 10 →

Undecidability of Bisimulations in Concurrent Systems with Indefinite Number of Identical Processes

by Mahesh Girkar, Robert Moll , 1993
"... In this paper, we show that bisimulation equivalence between concurrent systems of the type described in [9] is undecidable for two logics --- Linear Temporal Logic LTL and LTL without the nexttime operator. Such concurrent systems contain a control process and arbitrarily many identical user proces ..."
Abstract - Add to MetaCart
In this paper, we show that bisimulation equivalence between concurrent systems of the type described in [9] is undecidable for two logics --- Linear Temporal Logic LTL and LTL without the nexttime operator. Such concurrent systems contain a control process and arbitrarily many identical user processes. These negative results indicate that it might be difficult to compare two such concurrent systems and obtain the advantages from equivalences that are possible in other simpler models of concurrency [3, 6, 1, 7]. 1 Introduction Most formal models for concurrent systems (referred to as CS subsequently) provide a means for describing, and ultimately, detecting such phenomenon as deadlock, starvation and liveness in such systems. In a resource--oriented model [2, 11], processes are entities executing operations which request and release resources. These resources are controlled by finite state devices called synchronizers. In this model, properties such as deadlock and liveness can be e...

Lexical-Functional Grammar: A Formal System for Grammatical Representation

by Ronald M. Kaplan, Joan Bresnan - IN: FORMAL ISSUES IN LEXICAL-FUNCTIONAL GRAMMAR , 1995
"... In learning their native language, children develop a remarkable set of capabilities. They acquire knowledge and skills that enable them to produce and comprehend an indefinite number of novel utterances, and to make quite subtle judgments about certain of their properties. The major goal of psychol ..."
Abstract - Cited by 609 (23 self) - Add to MetaCart
In learning their native language, children develop a remarkable set of capabilities. They acquire knowledge and skills that enable them to produce and comprehend an indefinite number of novel utterances, and to make quite subtle judgments about certain of their properties. The major goal

Evolving Virtual Creatures

by Karl Sims - in SIGGRAPH 94 Conference Proceedings, ser. Annual Conference Series , 1994
"... This paper describes a novel system for creating virtual creatures that move and behave in simulated three-dimensional physical worlds. The morphologies of creatures and the neural systems for controlling their muscle forces are both generated automatically using genetic algorithms. Different fitnes ..."
Abstract - Cited by 386 (1 self) - Add to MetaCart
the morphology and the neural circuitry of these creatures. This genetic language defines a hyperspace containing an indefinite number of possible creatures with behaviors, and when it is searched using optimization techniques, a variety of successful and interesting locomotion strategies emerge, some of which

RESEARCH ARTICLE The weight of representing the body: addressing the potentially indefinite number of body representations in healthy individuals

by M. P. M. Kammers, F. De Vignemont
"... Ó The Author(s) 2009. This article is published with open access at Springerlink.com Abstract There is little consensus about the characteristics and number of body representations in the brain. In the present paper, we examine the main problems that are encountered when trying to dissociate multipl ..."
Abstract - Add to MetaCart
Ó The Author(s) 2009. This article is published with open access at Springerlink.com Abstract There is little consensus about the characteristics and number of body representations in the brain. In the present paper, we examine the main problems that are encountered when trying to dissociate

Automorphisms of indefinite . . .

by F. Galluzzi, G. Lombardo, C. Peters , 2010
"... Every even indefinite binary form occurs as the Picard lattice of some K3-surface. For these there is an explicit description for the group of isometries, or automorphs as they are called in classical literature [4, 8]. This group is always infinite, while the automorphism group of the correspondin ..."
Abstract - Add to MetaCart
Every even indefinite binary form occurs as the Picard lattice of some K3-surface. For these there is an explicit description for the group of isometries, or automorphs as they are called in classical literature [4, 8]. This group is always infinite, while the automorphism group

NUMBER MARKING AND (IN)DEFINITENESS IN KIND TERMS

by Veneeta Dayal , 2004
"... This paper explores the link between number marking and (in)definiteness in nominals and their interpretation. Differences between bare singulars and plurals in languages without determiners are explained by treating bare nominals as kind terms. Differences arise, it is argued, because singular and ..."
Abstract - Cited by 33 (1 self) - Add to MetaCart
This paper explores the link between number marking and (in)definiteness in nominals and their interpretation. Differences between bare singulars and plurals in languages without determiners are explained by treating bare nominals as kind terms. Differences arise, it is argued, because singular

KMS: A distributed Hypermedia system for managing Knowledge in Organizations

by Robert Akscyn, Donald Mccracken, Elise Yoder - Communications of the ACM , 1988
"... KMS is a commercial hypermedia system developed by Knowledge Systems for networks of heterogeneous workstations. It is designed to support organization-wide collaboration for a broad range of applications, such as electronic publishing, software engineering, project management, computer-aided design ..."
Abstract - Cited by 198 (2 self) - Add to MetaCart
. They may also be used to invoke programs. The database can be distributed across an indefinite number of file servers and be as large as available disk space permits. Independently developed KMS databases can be linked together. The KMS user interface uses an extreme form of direct manipulation. A single

General number and the semantics and pragmatics of indefinite bare nouns

by Hotze Rullmann, Aili You - University of Calgary
"... Like many other languages, Mandarin Chinese has noun phrases consisting of just a BARE NOUN without any functional elements such as determiners, classifiers, or number morphemes:1 ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
Like many other languages, Mandarin Chinese has noun phrases consisting of just a BARE NOUN without any functional elements such as determiners, classifiers, or number morphemes:1

Domain decomposition algorithms for indefinite elliptic problems

by Xiao-chuan Cai, Olof B. Widlund - SIAM J. Sci. Stat. Comput , 1992
"... Iterative methods for linear systems of algebraic equations arising from the finite element discretization of nonsymmetric and indefinite elliptic problems are considered. Methods previously known to work well for positive definite, symmetric problems are extended to certain nonsymmetric problems, w ..."
Abstract - Cited by 62 (17 self) - Add to MetaCart
Iterative methods for linear systems of algebraic equations arising from the finite element discretization of nonsymmetric and indefinite elliptic problems are considered. Methods previously known to work well for positive definite, symmetric problems are extended to certain nonsymmetric problems

The Randomized Complexity of Indefinite Integration

by Stefan Heinrich, Bernhard Milla
"... We show that for functions f ∈ Lp([0, 1] d), where 1 ≤ p ≤ ∞, the family of integrals ∫ f(t)dt (x = (x1,..., xd) ∈ [0, 1] d) [0,x] can be approximated by a randomized algorithm uniformly over x ∈ [0, 1] d with the same rate n −1+1 / min(p,2) as the optimal rate for a single integral, where n is the ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
is the number of samples. We present two algorithms, one being of optimal order, the other up to logarithmic factors. We also prove lower bounds and discuss the dependence of the constants in the error estimates on the dimension. 1
Next 10 →
Results 1 - 10 of 799
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University