Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 15 of 161.

Add to Quick Collection   All 161 Results

Sort:
 Add All Items to Quick Collection
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/281038
Description: We give a new true-concurrent model for probabilistic concurrent Kleene algebra. The model is based on probabilistic event structures, which combines ideas from Katoen's work on probabilistic concurre ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/279821
Description: We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main result is an FPT 4-approximation algorithm f ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/264395
Description: This article makes the key observation that when using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is not always the signs of those polynomial ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/267637
Description: We study the information propagation speed in multi-lane vehicle-to-vehicle networks such as roads or highways. We focus on the impact of time-varying radio ranges and of multiple lanes of vehicles, v ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/275797
Description: Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, po ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/262839
Description: We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is soun ... More
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/190328
Description: We propose a novel domain-theoretic model for nondeterminism, probability and hidden state, with relations on it that compare information flow. One relation is Smyth-like, based on a structural, refin ... More
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/172380
Description: We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Ad-hoc On-Demand Dis ... More
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/172368
Description: This paper describes an automated, formal and rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, a popular protocol used in wireless mesh networks. We give a brief over ... More
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/195847
Description: We introduce and study algebraic dynamical systems generated by triangular systems of rational functions. We obtain several results about the degree growth and linear independence of iterates as well ... More
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/205736
Description: Many authors have argued, for good reasons, that in a range of applications the lens put-put law is too strong. On the other hand, the present authors have shown that very well behaved lenses, which d ... More
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/183072
Description: 14 page(s)
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/150097
Description: NTRUEncrypt, proposed in 1996 by Hoffstein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic performance and conjectured resista ... More
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/158895
Description: The role played by counterexamples in standard system analysis is well known; but less common is a notion of counterexample in probabilistic systems refinement. In this paper we extend previous work u ... More
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/150146
Description: We show that a class of automata modulo simulation equivalence forms a model of probabilistic Kleene algebra. We prove completeness of this model with respect to continuous probabilistic Kleene algebr ... More
Reviewed: Reviewed