Results 1 to 10 of about 1,197,742 (268)
Model-Checking Process Equivalences [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic systems to display the same behaviour there are a multitude of formal ...
Martin Lange +2 more
doaj +8 more sources
Model Checking Probabilistic Pushdown Automata [PDF]
Logical Methods in Computer Science, 2006 We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that
Javier Esparza +2 more
doaj +10 more sources
Probabilistic model checking of cancer metabolism [PDF]
Scientific Reports, 2022 Cancer cell metabolism is often deregulated as a result of adaption to meeting energy and biosynthesis demands of rapid growth or direct mutation of key metabolic enzymes.
Meir D. Friedenberg +4 more
doaj +2 more sources
Model Checking Paxos in Spin [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We present a formal model of a distributed consensus algorithm in the executable specification language Promela extended with a new type of guards, called counting guards, needed to implement transitions that depend on majority voting. Our formalization
Giorgio Delzanno +2 more
doaj +4 more sources
Model-checking ecological state-transition graphs. [PDF]
PLoS Computational Biology, 2022 Model-checking is a methodology developed in computer science to automatically assess the dynamics of discrete systems, by checking if a system modelled as a state-transition graph satisfies a dynamical property written as a temporal logic formula.
Colin Thomas +3 more
doaj +2 more sources
On the Complexity of ATL and ATL* Module Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Module checking has been introduced in late 1990s to verify open systems, i.e., systems whose behavior depends on the continuous interaction with the environment.
Laura Bozzelli, Aniello Murano
doaj +3 more sources
Model Checking Usage Policies [PDF]
Mathematical Structures in Computer Science, 2009 We study usage automata, a formal model for specifying policies on the usage of resources. Usage automata extend finite state automata with some additional features, parameters and guards, that improve their expressivity. We show that usage automata are expressive enough to model policies of real-world applications.
BARTOLETTI, MASSIMO +3 more
openaire +9 more sources
Model checking embedded system designs [PDF]
, 2002 We survey the basic principles behind the application of model checking to controller verification and synthesis. A promising development is the area of guided model checking, in which the state space search strategy of the model checking algorithm can ...
Brinksma, Ed, Mader, Angelika
core +23 more sources
Causality-based Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Model checking is usually based on a comprehensive traversal of the state space. Causality-based model checking is a radically different approach that instead analyzes the cause-effect relationships in a program.
Bernd Finkbeiner, Andrey Kupriyanov
doaj +1 more source
On-the-fly Probabilistic Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Model checking approaches can be divided into two broad categories: global approaches that determine the set of all states in a model M that satisfy a temporal logic formula f, and local approaches in which, given a state s in M, the procedure determines
Diego Latella +2 more
doaj +1 more source