Results 1 to 10 of about 230,174 (255)
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
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
, 2012 In this paper we investigate a potential use of fluid approximation techniques in the context of stochastic model checking of CSL formulae. We focus on properties describing the behaviour of a single agent in a (large) population of agents, exploiting a limit result known also as fast simulation.
BORTOLUSSI, LUCA, J. Hillston
openaire +6 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
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 Parse Trees [PDF]
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013 Parse trees are fundamental syntactic structures in both computational linguistics and compilers construction. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word according to a context-free grammar. We put forward the adequacy of propositional dynamic logic (PDL) on trees in these
Boral, Anudhyan, Schmitz, Sylvain
openaire +5 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 +18 more sources
Fault Tolerance Framework for Composite Web Services
IEEE Access, 2021 A composite Web service combines multiple, logically interrelated services for creating more common services meeting complex requirements from users. The services participating in a composition coordinate the actions of distributed activity using Web ...
Nimra Memon +3 more
doaj +1 more source
Synthesis of Fault-Tolerant Reliable Broadcast Algorithms With Reinforcement Learning
IEEE Access, 2023 Fault-tolerant algorithms, such as Reliable Broadcast, assure the correct operation of modern distributed systems, even when some of the system nodes fail.
Diogo Vaz +3 more
doaj +1 more source
DICER 2.0: A New Model Checker for Data-Flow Errors of Concurrent Software Systems
Mathematics, 2021 Petri nets are widely used to model concurrent software systems. Currently, there are many different kinds of Petri net tools that can analyze system properties such as deadlocks, reachability and liveness. However, most tools are not suitable to analyze
Dongming Xiang, Fang Zhao, Yaping Liu
doaj +1 more source