|
Temporal Process Language
In theoretical computer science, Temporal Process Language (TPL) is a process calculus which extends Robin Milner's CCS with the notion of ''multi-party synchronization'', which allows multiple process to synchronize on a global 'clock'. This clock measures time, though not concretely, but rather as an abstract signal which defines when the entire process can step onward. Informal definition TPL is a conservative extension of CCS, with the addition of a special action called σ representing the passage of time by a process - the ticking of an abstract clock. As in CCS, TPL features action prefix and it can be described as being ''patient'', that is to say a process a.P will idly accept the ticking of the clock, written as a.P \rightarrow^a a.P Key to the use of abstract time is the ''timeout'' operator, which presents two processes, one to behave as if the clock ticks, one to behave as if it can't, i.e. \lfloor E \rfloor (F) \rightarrow^\sigma F provided process E does no ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theoretical Computer Science
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory. It is difficult to circumscribe the theoretical areas precisely. The Association for Computing Machinery, ACM's ACM SIGACT, Special Interest Group on Algorithms and Computation Theory (SIGACT) provides the following description: History While logical inference and mathematical proof had existed previously, in 1931 Kurt Gödel proved with his incompleteness theorem that there are fundamental limitations on what statements could be proved or disproved. Information theory was added to the field with a 1948 mathematical theory of communication by Claude Shannon. In the same decade, Donald Hebb introduced a mathematical model of Hebbian learning, learning in the brain. With mounting biological data supporting this hypothesis with some modification, the fields of n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Process Calculus
In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems. Process calculi provide a tool for the high-level description of interactions, communications, and synchronizations between a collection of independent agents or processes. They also provide algebraic laws that allow process descriptions to be manipulated and analyzed, and permit formal reasoning about equivalences between processes (e.g., using bisimulation). Leading examples of process calculi include CSP, CCS, ACP, and LOTOS. More recent additions to the family include the π-calculus, the ambient calculus, PEPA, the fusion calculus and the join-calculus. Essential features While the variety of existing process calculi is very large (including variants that incorporate stochastic behaviour, timing information, and specializations for studying molecular interactions), there are several features that all process calculi have i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robin Milner
Arthur John Robin Gorell Milner (13 January 1934 – 20 March 2010), known as Robin Milner or A. J. R. G. Milner, was a British computer scientist, and a Turing Award winner.Obituary – Professor Robin Milner: computer scientist '''', 31 March 2010. Life, education and career Milner was born in Yealmpton, near , |
Matthew Hennessy
Matthew Hennessy is an Irish computer scientist who has contributed especially to concurrency, process calculi and programming language semantics. Career During 1976–77, Matthew Hennessy was an assistant professor at the University of Waterloo in Canada. Then during 1977–78, he was a visiting professor at the Universidade Federal de Pernambuco in Brazil. Subsequently, he was a research associate (1979–81) and then lecturer (1981–85) at the University of Edinburgh in Scotland. During 1985, he was a guest lecturer/researcher at the University of Aarhus in Denmark. Hennessy was Professor of Computer Science at the Department of Informatics, University of Sussex, England, from 1985 until 2008. Since then, Hennessy has held a research professorship at the Department of Computer Science, Trinity College, Dublin. Hennessy's research interests are in the area of the semantic foundations of programming and specification languages, particularly involving distribute ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
