Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation

Lecture Notes in Computer Science - Germany
doi 10.1007/11560548_12
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Symbolic Reachability Analysis of B Through ProB and LTSmin

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Reachability Analysis on Distributed Executions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

A Service-Based Agent Framework for Distributed Symbolic Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Estimating Attractor Reachability in Asynchronous Logical Models

Frontiers in Physiology
Physiology
2018English

Symbolic Computation

1989English

Compositional Reachability Analysis of Finite-State Distributed Systems With User-Specified Constraints

1995English

Distributed Games and Distributed Control for Asynchronous Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Distributed Asynchronous Optimal Routing in Data Networks

1987English

Symbolic Dynamics and Computation in Model Gene Networks

Chaos
Nonlinear PhysicsApplied MathematicsMathematical PhysicsStatisticalMedicineAstronomyPhysics
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy