|
Principles Of Model Checking
''Principles of Model Checking'' is a textbook on model checking, an area of computer science that automates the problem of determining if a machine meets specification requirements. It was written by Christel Baier and Joost-Pieter Katoen, and published in 2008 by MIT Press. Synopsis The introduction and first chapter outline the field of model checking: a model of a machine or process can be analysed to see if desirable properties hold. For instance, a vending machine might satisfy the property "the balance can never fall below €0,00". A video game might enforce the rule "if the player has 0 lives then the game ends in a loss". Both the vending machine and video game can be modelled as transition systems. Model checking is the process of describing such requirements in mathematical language, and automating proofs that the model satisfies the requirements, or discovery of counterexamples if the model is faulty. The second chapter focuses on creating an appropriate model for ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Christel Baier
Christel Baier (born 26 September 1965) is a German theoretical computer scientist known for her work in model checking, temporal logic, and automata theory. She is a professor at TU Dresden, where she holds the chair for Algebraic and Logic Foundations of Computer Science in the Faculty of Computer Science. Baier is the editor-in-chief of ''Acta Informatica''. Education and career Baier earned a diploma in mathematics at the University of Mannheim in 1990, and stayed at the same university for graduate study in computer science, completing her Ph.D. there in 1994. Her dissertation, ''Transitionssystem- und Baum-Semantiken für CCS'', was supervised by Mila Majster-Cederbaum. She earned a habilitation at Mannheim in 1999. She became an associate professor for computer science at the University of Bonn in 1999, and moved to TU Dresden as a professor in 2006. Book With Joost-Pieter Katoen, Baier is coauthor of the book ''Principles of Model Checking'' (MIT Press, 2008). Recogni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Language
In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science (as opposed to many modern regular expressions engines, which are augmented with features that allow recognition of non-regular languages). Alternatively, a regular language can be defined as a language recognized by a finite automaton. The equivalence of regular expressions and finite automata is known as Kleene's theorem (after American mathematician Stephen Cole Kleene). In the Chomsky hierarchy, regular languages are the languages generated by Type-3 grammars. Formal definition The collection of regular languages over an alphabet Σ is defined recursively as follows: * The empty language Ø is a regular language. * For each ''a'' ∈ Σ (''a'' belongs to Σ), the singleton language is a regular language. * If ''A'' is a regular language, ''A'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ACM Computing Reviews
''ACM Computing Reviews'' (''CR'') is a scientific journal that reviews literature in the field of computer science. It is published by the Association for Computing Machinery and the editor-in-chief is Carol Hutchins (New York University). See also * ''ACM Guide to Computing Literature'' * '' ACM Computing Surveys'' * ''Algorithms In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing ...'' External links * Computing Reviews Computer science journals Publications established in 1985 English-language journals Review journals 1985 establishments in the United States {{compu-journal-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
The Computer Journal
''The Computer Journal'' is a peer-reviewed scientific journal covering computer science and information systems. Established in 1958, it is one of the oldest computer science research journals. It is published by Oxford University Press on behalf of BCS, The Chartered Institute for IT. The authors of the best paper in each annual volume receive the Wilkes Award from BCS, The Chartered Institute for IT. Editors-in-chief The following people have been editor-in-chief: * 1958–1969 Eric N. Mutch * 1969–1992 Peter Hammersley * 1993–2000 C. J. van Rijsbergen * 2000–2008 Fionn Murtagh * 2008–2012 Erol Gelenbe * 2012–2016 Fionn Murtagh * 2016–2020 Steve Furber Stephen Byram Furber (born 21 March 1953) is a British computer scientist, mathematician and hardware engineer, currently the ICL Professor of Computer Engineering in the Department of Computer Science at the University of Manchester, UK. A ... * 2021–present Tom Crick References External links Offic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Markov Chain
A Markov chain or Markov process is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, this may be thought of as, "What happens next depends only on the state of affairs ''now''." A countably infinite sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC). It is named after the Russian mathematician Andrey Markov. Markov chains have many applications as statistical models of real-world processes, such as studying cruise control systems in motor vehicles, queues or lines of customers arriving at an airport, currency exchange rates and animal population dynamics. Markov processes are the basis for general stochastic simulation methods known as Markov chain Monte Carlo, which are used for simulating sampling from complex probability distr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Probabilistic Automata
In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the nondeterministic finite automaton; it includes the probability of a given transition into the finite state machine, transition function, turning it into a Stochastic matrix, transition matrix. Thus, the probabilistic automaton also generalizes the concepts of a Markov chain and of a subshift of finite type. The formal language, languages recognized by probabilistic automata are called stochastic languages; these include the regular languages as a subset. The number of stochastic languages is uncountable. The concept was introduced by Michael O. Rabin in 1963; a certain special case is sometimes known as the Rabin automaton (not to be confused with the subclass of ω-automaton#Acceptance conditions, ω-automata also referred to as Rabin automata). In recent years, a variant has been formulated in terms of quantum probabilities, the quantum finite automaton. Informal Description For a giv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Timed Automata
In automata theory, a timed automaton is a finite automaton extended with a finite set of real-valued clocks. During a run of a timed automaton, clock values increase all with the same speed. Along the transitions of the automaton, clock values can be compared to integers. These comparisons form guards that may enable or disable transitions and by doing so constrain the possible behaviors of the automaton. Further, clocks can be reset. Timed automata are a sub-class of a type hybrid automata. Timed automata can be used to model and analyse the timing behavior of computer systems, e.g., real-time systems or networks. Methods for checking both safety and liveness properties have been developed and intensively studied over the last 20 years. It has been shown that the state reachability problem for timed automata is decidable,Rajeev Alur, David L. Dill. 199A Theory of Timed Automata In Theoretical Computer Science, vol. 126, 183–235, pp. 194–1955 which makes this an interesting su ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partial Order Reduction
In computer science, partial order reduction is a technique for reducing the size of the state-space to be searched by a model checking or automated planning and scheduling algorithm. It exploits the commutativity of concurrently executed transitions that result in the same state when executed in different orders. In explicit state space exploration, partial order reduction usually refers to the specific technique of expanding a representative subset of all enabled transitions. This technique has also been described as model checking with representatives. There are various versions of the method, the so-called stubborn set method, ample set method, and persistent set method. Ample sets Ample sets are an example of model checking with representatives. Their formulation relies on a separate notion of ''dependency''. Two transitions are considered independent only if whenever they are mutually enabled, they cannot disable another and the execution of both results in a unique state ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bisimulation
In theoretical computer science a bisimulation is a binary relation between state transition systems, associating systems that behave in the same way in that one system simulates the other and vice versa. Intuitively two systems are bisimilar if they, assuming we view them as playing a ''game'' according to some rules, match each other's moves. In this sense, each of the systems cannot be distinguished from the other by an observer. Formal definition Given a labelled state transition system (S, \Lambda, →), where S is a set of states, \Lambda is a set of labels and → is a set of labelled transitions (i.e., a subset of S \times \Lambda \times S), a bisimulation is a binary relation R \subseteq S \times S, such that both R and its converse R^T are simulations. From this follows that the symmetric closure of a bisimulation is a bisimulation, and that each symmetric simulation is a bisimulation. Thus some authors define bisimulation as a symmetric simulation. Equivale ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
CTL*
CTL* is a superset of computational tree logic (CTL) and linear temporal logic (LTL). It freely combines path quantifiers and temporal operators. Like CTL, CTL* is a branching-time logic. The formal semantics of CTL* formulae are defined with respect to a given Kripke structure. History LTL had been proposed for the verification of computer programs, first by Amir Pnueli in 1977. Four years later in 1981 E. M. Clarke and E. A. Emerson invented CTL and CTL model checking. CTL* was defined by E. A. Emerson and Joseph Y. Halpern in 1983. CTL and LTL were developed independently before CTL*. Both sublogics have become standards in the model checking community, while CTL* is of practical importance because it provides an expressive testbed for representing and comparing these and other logics. This is surprising because the computational complexity of model checking in CTL* is not worse than that of LTL: they both lie in PSPACE. Syntax The language of well-formed CTL* fo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monopoly (game)
''Monopoly'' is a multi-player economics-themed board game. In the game, players roll two dice to move around the game board, buying and trading properties and developing them with houses and hotels. Players collect rent from their opponents, aiming to drive them into bankruptcy. Money can also be gained or lost through ''Chance'' and ''Community Chest'' cards and tax squares. Players receive a stipend every time they pass "Go" and can end up in jail, from which they cannot move until they have met one of three conditions. House rules, hundreds of different editions, many spin-offs, and related media exist. ''Monopoly'' has become a part of international popular culture, having been licensed locally in more than 103 countries and printed in more than 37 languages. , it was estimated that the game had sold 275 million copies worldwide. ''Monopoly'' is derived from '' The Landlord's Game'', created by Lizzie Magie in the United States in 1903 as a way to demonstrate that an econo ... [...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. Comp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
