|
Alternating-time Temporal Logic
In computer science, alternating-time temporal logic, or ATL, is a branching-time temporal logic that extends computation tree logic (CTL) to multiple players. ATL naturally describes computations of multi-agent systems and multiplayer video games. Quantification in ATL is over program-paths that are possible outcomes of games. ATL uses alternating-time formulas to construct model-checkers in order to address problems such as receptiveness, realizability, and controllability. Examples One can write logical formulas in ATL such as \langle \langle \\rangle \rangle F p that expresses the fact that agents ''a'' and ''b'' have a strategy to ensure that the property ''p'' holds in the future, whatever the other agents of the system are performing. Extensions and variants ATL* is the extension of ATL, as CTL* extends CTL. ATL* allows to write more complex temporal objectives, for instance \langle \langle \\rangle \rangle (F p \land G q). Belardinelli et al. proposes a variant of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical disciplines (including the design and implementation of Computer architecture, hardware and Computer programming, software). Computer science is generally considered an area of research, academic research and distinct from computer programming. Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and for preventing Vulnerability (computing), security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Progr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Temporal Logic
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time (for example, "I am ''always'' hungry", "I will ''eventually'' be hungry", or "I will be hungry ''until'' I eat something"). It is sometimes also used to refer to tense logic, a modal logic-based system of temporal logic introduced by Arthur Prior in the late 1950s, with important contributions by Hans Kamp. It has been further developed by computer scientists, notably Amir Pnueli, and logicians. Temporal logic has found an important application in formal verification, where it is used to state requirements of hardware or software systems. For instance, one may wish to say that ''whenever'' a request is made, access to a resource is ''eventually'' granted, but it is ''never'' granted to two requestors simultaneously. Such a statement can conveniently be expressed in a temporal logic. Motivation Consider the statement "I am hungry". Though its ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computation Tree Logic
Computation tree logic (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is realized. It is used in formal verification of software or hardware artifacts, typically by software applications known as model checkers, which determine if a given artifact possesses safety or liveness properties. For example, CTL can specify that when some initial condition is satisfied (e.g., all program variables are positive or no cars on a highway straddle two lanes), then all possible executions of a program avoid some undesirable condition (e.g., dividing a number by zero or two cars colliding on a highway). In this example, the safety property could be verified by a model checker that explores all possible transitions out of program states satisfying the initial condition and ensures that all such executions satisfy the property. Compu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multi-agent System
A multi-agent system (MAS or "self-organized system") is a computerized system composed of multiple interacting intelligent agents.Hu, J.; Bhowmick, P.; Jang, I.; Arvin, F.; Lanzon, A.,A Decentralized Cluster Formation Containment Framework for Multirobot Systems IEEE Transactions on Robotics, 2021. Multi-agent systems can solve problems that are difficult or impossible for an individual agent or a monolithic system to solve.Hu, J.; Turgut, A.; Lennox, B.; Arvin, F.,Robust Formation Coordination of Robot Swarms with Nonlinear Dynamics and Unknown Disturbances: Design and Experiments IEEE Transactions on Circuits and Systems II: Express Briefs, 2021. Intelligence may include methodic, functional, procedural approaches, algorithmic search or reinforcement learning.Hu, J.; Bhowmick, P.; Lanzon, A.,Group Coordinated Control of Networked Mobile Robots with Applications to Object Transportation IEEE Transactions on Vehicular Technology, 2021. Despite considerable overlap, a multi-ag ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multiplayer Video Game
A multiplayer video game is a video game in which more than one person can play in the same game environment at the same time, either locally on the same computing system (couch co-op), on different computing systems via a local area network, or via a wide area network, most commonly the Internet (e.g. ''World of Warcraft'', '' Call of Duty'', ''DayZ''). Multiplayer games usually require players to share a single game system or use networking technology to play together over a greater distance; players may compete against one or more human contestants, work cooperatively with a human partner to achieve a common goal, or supervise other players' activity. Due to multiplayer games allowing players to interact with other individuals, they provide an element of social communication absent from single-player games. History Non-networked Some of the earliest video games were two-player games, including early sports games (such as 1958's ''Tennis For Two'' and 1972's ''Pong''), ear ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of The ACM
The ''Journal of the ACM'' is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects. It is an official journal of the Association for Computing Machinery. Its current editor-in-chief is Venkatesan Guruswami. The journal was established in 1954 and "computer scientists universally hold the ''Journal of the ACM'' in high esteem". See also * ''Communications of the ACM ''Communications of the ACM'' is the monthly journal of the Association for Computing Machinery (ACM). It was established in 1958, with Saul Rosen as its first managing editor. It is sent to all ACM members. Articles are intended for readers with ...'' References External links * Publications established in 1954 Computer science journals Association for Computing Machinery academic journals Bimonthly journals English-language journals {{compu-journal-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Model-checker
In computer science, model checking or property checking is a method for checking whether a finite-state model of a system meets a given specification (also known as correctness). This is typically associated with hardware or software systems, where the specification contains liveness requirements (such as avoidance of livelock) as well as safety requirements (such as avoidance of states representing a system crash). In order to solve such a problem algorithmically, both the model of the system and its specification are formulated in some precise mathematical language. To this end, the problem is formulated as a task in logic, namely to check whether a structure satisfies a given logical formula. This general concept applies to many kinds of logic and many kinds of structures. A simple model-checking problem consists of verifying whether a formula in the propositional logic is satisfied by a given structure. Overview Property checking is used for verification when two desc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Epistemic Logic
Epistemic modal logic is a subfield of modal logic that is concerned with reasoning about knowledge. While epistemology has a long philosophical tradition dating back to Ancient Greece, epistemic logic is a much more recent development with applications in many fields, including philosophy, theoretical computer science, artificial intelligence, economics and linguistics. While philosophers since Aristotle have discussed modal logic, and Medieval philosophers such as Avicenna, Ockham, and Duns Scotus developed many of their observations, it was C. I. Lewis who created the first symbolic and systematic approach to the topic, in 1912. It continued to mature as a field, reaching its modern form in 1963 with the work of Kripke. Historical development Many papers were written in the 1950s that spoke of a logic of knowledge in passing, but the Finnish philosopher G. H. von Wright's 1951 paper titled ''An Essay in Modal Logic'' is seen as a founding document. It was not until 1962 tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Krishnendu Chatterjee
Krishnendu Chatterjee (Bengali: কৃষ্ণেন্দু চ্যাটার্জী) is an Indian computer scientist who is currently a professor at the Institute of Science and Technology Austria (ISTA). He is known for his contributions to theoretical computer science, especially in algorithmic game theory, evolutionary game theory, logics and automata theory. Education Chatterjee obtained his BTech in Computer Science and Engineering from the Indian Institute of Technology Kharagpur. He gained his MSc and PhD from the University of California, Berkeley. His doctoral advisor was Thomas Henzinger. Career He obtained his PhD in 2007 and later moved to UC Santa Cruz for a postdoc. He then joined ISTA in 2009 as an assistant professor and was promoted to professor in 2014. In his research, he studies graph games with omega-regular and quantitative objectives, especially variants with probabilistic moves, multiple objectives, and/or partial information. Recently, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Thomas Henzinger
Thomas Henzinger (born 1962) is an Austrian computer scientist, researcher, and president of the Institute of Science and Technology, Austria. Life and career Henzinger was born in Austria. He received his bachelor's degree in computer science from Johannes Kepler University Linz, and his PhD from Stanford University in 1991, advised by Zohar Manna. He is married to Monika Henzinger and has three children. He was successively Assistant Professor of Computer Science at Cornell University (1992–95) and Assistant Professor (1996–97), Associate Professor (1997–98), Professor (1998–2004) and Adjunct Professor (till 2011) of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He was also director of the Max Planck Institute of Computer Science in Saarbrücken, Germany in 1999 and Professor of Computer and Communication Sciences at EPFL (the Swiss Federal Institute of Technology in Lausanne), Switzerland from 2004 to 2009. He is currently ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
First-order Logic
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables, so that rather than propositions such as "Socrates is a man", one can have expressions in the form "there exists x such that x is Socrates and x is a man", where "there exists''"'' is a quantifier, while ''x'' is a variable. This distinguishes it from propositional logic, which does not use quantifiers or relations; in this sense, propositional logic is the foundation of first-order logic. A theory about a topic is usually a first-order logic together with a specified domain of discourse (over which the quantified variables range), finitely many functions from that domain to itself, finitely many predicates defined on that domain, and a set of ax ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Model-checker")
