
	Where results make sense

Topic: Unbounded nondeterminism

In the News (Tue 29 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Unbounded nondeterminism at AllExperts
		In computer science, unbounded nondeterminism (sometimes called unbounded indeterminacy) is a property of concurrency by which the amount of delay in servicing a request can become unbounded as a result of arbitration of contention for shared resources while still guaranteeing that the request will eventually be serviced.
		Unbounded nondeterminism became an important issue in the development of the denotational semantics of concurrency.
		According to Clinger [1981]:The reason unbounded nondeterminism does not appear in conventional power domain semantics is that each element of the power domain is interpreted as a finitely generable subset of the underlying Ï-complete domain [see Power domains from incomplete domains ].
	en.allexperts.com /e/u/un/unbounded_nondeterminism.htm (1897 words)

	Unbounded - Qwika
		Unbounded nondeterminism In computer science, unbounded nondeterminism (sometimes called unbounded indeterminacy) is a property of concurrency by...
		Unbounded system In the theory of dynamical systems, an unbounded system is a system that has no...
		Unbounded jet unbounded jet (JSL) is one mechanism of role...
	www.qwika.com /find/Unbounded (592 words)

	Mislove N00014-91-J-1692
		Unbounded nondeterminism is an important phenomenon in such areas as fairness and specification and refinement.
		We also reported that demonic nondeterminism - in which divergence is catastrophic - is the only one of the three common forms of nondeterminism that can be extended in a uniform manner to a theory to support unbounded choice.
		Since we already know that demonic nondeterminism is the only form that allows a general theory, by providing such a full abstraction result we would provide a complete theory for the one form of unbounded nondeterminism amenable to a general theory.
	www.math.tulane.edu /~mwm/ftp/eoyl95.html (2603 words)

	Michael Mislove Home Page
		The former is modelled using the probabilistic powerdomain of Jones and Plotkin, while the latter is modelled by a geometrically convex variant of the Plotkin powerdomain.
		Denotational Models for Unbounded Nondeterminism This paper is an extended abstract which appeared in the Proceedings of MFPS 11, which took place at Tulane in 1995.
		Left open is the question whether there is an analogue for the convex power domain for unbounded nondeterminism; while the claim is made in the paper that no such object exists, the example presented only shows that the "obvious candidate" will not suffice, because it is not a local cpo.
	www.entcs.org /mislove.html (3703 words)

	Michael Mislove's position paper
		Unbounded nondeterminism is useful - in some sense required - to have a theory adequate to model process refinement.
		In the setting of untimed and Timed CSP, where many models are available to provide a varying array of levels of abstraction at which to consider processes and their specifications, unbounded nondeterminism is necessary in moving from one level to another.
		Inspired by results about CSP and models for unbounded nondeterminism, Roscoe, Steve Schneider and I were led to consider more general structures than domains.
	www.kestrel.edu /~jullig/rio97/position-papers/mislove.html (2058 words)

	Spartanburg SC \| GoUpstate.com \| Spartanburg Herald-Journal (Site not responding. Last check: 2007-10-05)
		Such nondeterministic automata have the property of bounded nondeterminism; that is, if a machine always halts when started in its initial state, then there is a bound on the number of states in which it halts.
		Unbounded nondeterminism (also called unbounded indeterminacy, a title preferred by Hewitt following Niels Bohr), is a property of concurrency by which the amount of delay in servicing a request can become unbounded as a result of arbitration of contention for shared resources while still guaranteeing that the request will eventually be serviced.
		In Dijkstra's model, although there could be an unbounded amount of time between the execution of sequential instructions on a computer, a (parallel) program that started out in a well defined state could terminate in only a bounded number of states 1976.
	www.goupstate.com /apps/pbcs.dll/section?category=NEWS&template=wiki&text=Actor_model (4780 words)

	[No title] (Site not responding. Last check: 2007-10-05)
		However, the CSP failures-divergences model does not treat unbounded nondeterminism, although unbounded nondeterminism arises quite naturally in action systems; to that extent, the correspondence between the two approaches is inadequate.
		Fortunately there is an extended infinite traces model of CSP developed by Roscoe which treats unbounded nondeterminism.
		In passing, we develop a definition of the weakest precondition under which an infinite heterogeneous trace of actions is enabled.
	eprints.ecs.soton.ac.uk /perl/oai2?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai:eprints.ecs.soton.ac.uk:966 (113 words)

	Operational and Denotational Models for Languages Supporting Nondeterminism and Synchronization
		Unbounded nondeterminism is an important phenomenon in specification and refinement.
		For example, we can show that, in general, demonic nondeterminism - in which divergence is catastrophic - is the only one of the three common forms of nondeterminism that can be extended to support unbounded choice.
		The theory we derive relies on the fact that the finitely nondeterministic processes have a well-behaved model, and we use a generalization of spectral theory that guarantees that a needed dominated convergence theorem holds.
	www.math.tulane.edu /~mwm/ftp/annualrep.html (2171 words)

	DLT06: Abstract for Paper
		For example, automata with unbounded nondeterminism that have to empty their pushdown store up to the initial symbol in order to make a guess are characterized by the regular closure of DCFL.
		Automata that additionally have to reenter the initial state are (almost) characterized by the Kleene star closure of the union closure of the prefix-free deterministic context-free languages.
		Pushdown automata with bounded nondeterminism are characterized by the union closure of DCFL in any of the considered contexts.
	dlt2006.cs.ucsb.edu /24.html (156 words)

	Entry Boom:1982:WPL from toplas.bib (Site not responding. Last check: 2007-10-05)
		He shows that unbounded nondeterminism is incompatible with his axioms and his continuity principle, and he argues that this is no drawback because unboundedly nondeterministic machines cannot be built.
		This paper considers the question of unbounded nondeterminism.
		nondeterminism, 2(2)234, 7(2)270, 9(2)125, 10(1)87, 12(2)203, 16(3)924, 16(6)1675, 17(2)366, 18(3)325, 18(5)528, 20(2)436
	www.math.utah.edu:8080 /ftp/pub/tex/bib/idx/toplas/4/4/668-677.html (567 words)

	LinuxHPC.org/Cluster Builder 1.2 - Distributed Computing
		Asynchronously, different subsystems can come up and go down and communication links can come in and go out between subsystems of an open distributed system.
		Therefore the time that it will take to complete an operation cannot be bounded in advance (see unbounded nondeterminism).
		A scalable system is one that can easily be altered to accommodate changes in the number of users, resources and computing entities affected to it.
	www.clusterbuilder.org /pages/encyclopedia/alphabetized/d/distributed-computing.php (1437 words)

	[No title] (Site not responding. Last check: 2007-10-05)
		It also permits unbounded nondeterminism and angelic nondeterminism.
		The language is divided into sublanguages using criteria of demonic and angelic nondeterminism, termination and absence of miracles.
		We investigate dualities between the sublanguages and how they can be generated from simple primitive commands.
	www.tucs.fi /publications/oldpubs/reports/abstracts/A89-86.txt (97 words)

	Amazon.com: "angelic nondeterminism": Key Phrase page (Site not responding. Last check: 2007-10-05)
		Programs are assumed to have only demonic nondeterminism (or sometimes only angelic nondeterminism) but not both kinds of nondeterminism.
		This base language permits unbounded nondeterminism, demonic and angelic nondeterminism and is extended to permit miracles also.
		It also approaches the decomposition problem in a powerful equivalence framework, which is a bisimulation with angelic nondeterminism.
	www.amazon.com /phrase/angelic-nondeterminism (609 words)

	Distributed computing - Team Hack-a-Day Wiki
		There is no central arbiter of truth in open distributed systems.
		unbounded nondeterminism: Asynchronously, different subsystems can come up and go down and communication links can come in and go out between subsystems of an open distributed system.
		Therefore the time that it will take to complete an operation cannot be bounded in advance.
	teamhackaday.com /wiki/index.php?title=Distributed_computing (1316 words)

	ACG Abstracts (Site not responding. Last check: 2007-10-05)
		Power domains are fundamental for modeling nondeterminism from a domain-theoretic viewpoint.
		In this talk I will present a new method for constructing power domains in the case of algebraic cpos that extends to the construction of continuous algebras over continuous domains (using the recent results of Abramsky and Jung on abstract bases).
		As time permits, I also will present results about models for unbounded nondeterminism that evolve from the domain-theoretic setting.
	www.cwi.nl /projects/acg/PAST/abstracts96.html (326 words)

	nondeterminism - OneLook Dictionary Search
		We found 3 dictionaries with English definitions that include the word nondeterminism:
		Tip: Click on the first link on a line below to go directly to a page where "nondeterminism" is defined.
		Nondeterminism : Technology Terms and Acronyms [home, info]
	www.onelook.com /cgi-bin/cgiwrap/bware/dofind.cgi?word=nondeterminism (85 words)

	Handling unbounded nondeterminism
		The initial statement of a process and the exit assertion of transitions may involve unbounded nondeterminism.
		's value are unbounded provided it is of type integer.
		The expressibility of ASTRAL formulas shown as invariant statements etc., is the same as PA (Peano Arithmetic), therefore the validity of ASTRAL formula is undecidable.
	dimacs.rutgers.edu /Workshops/Security/program2/kemmerer/node3.html (345 words)

	[No title] (Site not responding. Last check: 2007-10-05)
		context idea is to see how to define semantics of PLs using predicate transformers, like wp, and to see how good that is as an approach to PL semantics def: the nondeterminism** in a statement is bounded if for any given input state, it has only a finite number of final states.
		Hehner) Floyd-Hoare method (predicate-transformer semantics): assertions at program points, inductive reasoning This motivates choice of semantics: it should be applicable to reasoning.
		Combination of unbounded choice and predicate transformer semantics is new ** predicate transformation semantics (0.2) def: state space is a set (of variables) def: wp.c.p is weakest such that c always terminates and establishes p wlp.c.p is weakest such that when c terminates, it establishes p semantic equality of commands central concept.
	www.cs.iastate.edu /~leavens/ComS641-Hesselink/lectures/weakest-preconditions/intro.txt (650 words)

	Comp.compilers: Re: Have I discovered something new?
		This grammar is unambiguous, but it features unbounded nondeterminism.
		Parsing this grammar requires finding the middle of the input string.
		Determinisic grammars and grammars with bounded nondeterminism can be
	compilers.iecc.com /comparch/article/02-07-126 (269 words)

	Non-deterministic Turing machine Information
		How much longer is not known in general - this is, in a nutshell, the definition of the "Is P = NP?" problem (see Complexity classes P and NP).
		A NTM has the property of bounded nondeterminism, i.e.
		) This is in contrast to some models of concurrent computation such as the Actor model that have the property of unbounded nondeterminism.
	www.bookrags.com /wiki/Non-deterministic_Turing_machine (690 words)

	Bill Roscoe - Home Page
		Unbounded nondeterminism in CSP, in `Two papers on CSP', technical monograph PRG-67, Oxford University Computing Laboratory, July 1988.
		Analysing TM : a study of nondeterminism in real-time concurrency (with G.M. Reed), in Concurrency: Theory Language and Architecture, (Yonezawa and Ito, eds) Springer LNCS 491.
		Modelling unbounded parallel sessions of security protocols in CSP with E. Kleiner PDF
	web.comlab.ox.ac.uk /oucl/work/bill.roscoe/pubs.html (2395 words)

	Actor model Information
		In Dijkstra's model, although there could be an unbounded amount of time between the execution of sequential instructions on a computer, a (parallel) program that started out in a well defined state could terminate in only a bounded number of states [Dijkstra 1976].
		The original Communicating Sequential Processes model published by Tony Hoare [1978] differed from the Actor model because it was based on the parallel composition of a fixed number of sequential processes of fixed topology communicating using synchronous buffered communication.
		Modern, theoretical CSP ([Hoare 1985] and [Roscoe 2005]) explicitly provides unbounded nondeterminism.
	www.bookrags.com /wiki/Actor_model (4933 words)

	CS370 - Computation and Complexity
		From here we define some complexity classes, define intra-class reductions, develop several techniques for the complexity analysis (best, worst, average case) of algorithms, and prove that certain algorithms are optimal for a given model of computation and given complexity measures.
		The concept of nondeterminism allows us to develop a richer complexity class structure (including the class NP, NP-completeness, NP-hardness), and we prove a solution's membership of these classes.
		Where are the tractable problems?, A new class of problems, Verifiable in polynomial time, Analysing correctness proofs, Bounded and unbounded nondeterminism, Nondeterministic TMs
	www.cs.may.ie /~tnaughton/teaching/cs370/cs370outline.html (693 words)

	ECS EPrints Service - Action Systems, Unbounded Nondeterminism, and Infinite Traces
		An RSS Feed of this repository is available.
		EPrints is free software developed by the University of Southampton to facilitate Open Access to research.
		Butler, M. and Morgan, C. Action Systems, Unbounded Nondeterminism, and Infinite Traces.
	eprints.ecs.soton.ac.uk /966 (210 words)

	An Unbounded Nondeterministic Model for CSP-like Languages : Papers : eWiC : BCS
		An Unbounded Nondeterministic Model for CSP-like Languages : Papers : eWiC : BCS
		The main contribution of this paper is the introduction of unbounded nondeterminism into CSP-like languages with specification, which increases the expressive power of the specification language.
		This is achieved by extending the finite message set of such mixed languages to an infinite one.
	www.bcs.org /server.php?show=ConWebDoc.4393 (121 words)

	Grupo de Concurrencia: Publicaciones Relevantes
		We present an extension of the classical testing semantics for the case when nondeterminism is unbounded.
		This characterization will be an extension of acceptance sets, considering not only the finite traces a process can execute but also its infinite traces.
		Process algebra; CSP; Unbounded nondeterminism; Operational semantics; Testing semantics.
	dalila.sip.ucm.es /concurrencia/publicaciones.html (2877 words)

	Hoare Logics for Recursive Procedures and Unbounded Nondeterminism (Site not responding. Last check: 2007-10-05)
		This paper presents sound and complete Hoare logics for partial and total correctness of recursive parameterless procedures in the context of unbounded nondeterminism.
		For total correctness, the literature so far has either restricted recursive procedures to be deterministic or has studied unbounded nondeterminism only in conjunction with loops rather than procedures.
		We consider both single procedures and systems of mutually recursive procedures.
	wwwbroy.in.tum.de /~nipkow/pubs/csl02.html (118 words)

	Journals and Books By Prof Bill Roscoe
		Barrett and A.W. Roscoe, "Unbounded Nondeterminism in CSP"
		Proceedings of the Thirteenth International Colloquium on Automata, Languages and Programming, Rennes, France, 15--19 July 1986
		G.M. Reed and A.W. Roscoe, editor A. Yonewaza and T. Ito, "Analysing $TM_{FS}$ : A Study of Nondeterminism in Real-Time Concurrency"
	web.comlab.ox.ac.uk /oucl/work/bill.roscoe/jandb.html (645 words)

Try your search on: Qwika (all wikis)