A new polynomial-time algorithm for linear programming
Combinatorica
Performability Analysis Using Semi-Markov Reward Processes
IEEE Transactions on Computers
Algorithms in C
Stochastic Automata Network of Modeling Parallel Systems
IEEE Transactions on Software Engineering
On the learnability and usage of acyclic probabilistic finite automata
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Feedback Control of Dynamic Systems
Feedback Control of Dynamic Systems
Specification of real-time and hybrid systems in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Stochastic Grammatical Inference with Multinomial Tests
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning Stochastic Regular Grammars by Means of a State Merging Method
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Efficient Reachability Set Generation and Storage Using Decision Diagrams
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
A Data Structure for the Efficient Kronecker Solution of GSPNs
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Tracking a moving object with a binary sensor network
Proceedings of the 1st international conference on Embedded networked sensor systems
Poster abstract: cooperative tracking with binary-detection sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
The Kronecker product and stochastic automata networks
Journal of Computational and Applied Mathematics
A Structured Path-Based Approach for Computing Transient Rewards of Large CTMCs
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Learning Continuous Time Markov Chains from Sample Executions
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
PRISM 2.0: A Tool for Probabilistic Model Checking
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
A wireless sensor network For structural monitoring
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
An analysis of a large scale habitat monitoring application
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
iLTLChecker: A Probabilistic Model Checker for Multiple DTMCs
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Scalable Modeling and Performance Evaluation of Wireless Sensor Networks
RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
Semantics and pragmatics of Real-Time Maude
Higher-Order and Symbolic Computation
Learning and Detecting Emergent Behavior in Networks of Cardiac Myocytes
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
LTLC: Linear Temporal Logic for Control
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
25 Years of Model Checking
Redesign of the LMST Wireless Sensor Protocol through Formal Modeling and Statistical Model Checking
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
CMSB '08 Proceedings of the 6th International Conference on Computational Methods in Systems Biology
Theoretical Computer Science
Probabilistic Analysis of Wireless Systems Using Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Resilient localization for sensor networks in outdoor environments
ACM Transactions on Sensor Networks (TOSN)
Reasoning about MDPs as Transformers of Probability Distributions
QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
Verifying the Evolution of Probability Distributions Governed by a DTMC
IEEE Transactions on Software Engineering
A probabilistic task scheduling method for grid environments
Future Generation Computer Systems
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
On statistical model checking of stochastic systems
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Hi-index | 0.00 |
Modeling and evaluating the performance of large-scale wireless sensor networks (WSNs) is a challenging problem. The traditional method for representing the global state of a system as a cross product of the states of individual nodes in the system results in a state space whose size is exponential in the number of nodes. We propose an alternative way of representing the global state of a system: namely, as a probability mass function (pmf) which represents the fraction of nodes in different states. A pmf corresponds to a point in a Euclidean space of possible pmf values, and the evolution of the state of a system is represented by trajectories in this Euclidean space. We propose a novel performance evaluation method that examines all pmf trajectories in a dense Euclidean space by exploring only finite relevant portions of the space. We call our method Euclidean model checking. Euclidean model checking is useful both in the design phase—where it can help determine system parameters based on a specification—and in the evaluation phase—where it can help verify performance properties of a system. We illustrate the utility of Euclidean model checking by using it to design a time difference of arrival (TDoA) distance measurement protocol and to evaluate the protocol's implementation on a 90-node WSN. To facilitate such performance evaluations, we provide a Markov model estimation method based on applying a standard statistical estimation technique to samples resulting from the execution of a system.