Modeling the ADA task system by Petri nets
Computer Languages
The distributed deadlock detection algorithm
ACM Transactions on Computer Systems (TOCS)
A distributed scheme for detecting communication deadlocks
IEEE Transactions on Software Engineering
Interactive State-Space Analysis of Concurrent Systems
IEEE Transactions on Software Engineering
A general-purpose algorithm for analyzing concurrent programs
Communications of the ACM
Task interaction graphs for concurrency analysis
ICSE '89 Proceedings of the 11th international conference on Software engineering
Integrated concurrency analysis in a software development enviornment
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Sufficient Condition for a Communication Deadlock and Distributed Deadlock Detection
IEEE Transactions on Software Engineering
A distributed deadlock detection algorithm for CSP-like communication
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data flow analysis of distributed communicating processes
International Journal of Parallel Programming
Starvation and Critical Race Analyzers for Ada
IEEE Transactions on Software Engineering
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Automated Analysis of Concurrent Systems with the Constrained Expression Toolset
IEEE Transactions on Software Engineering
Distributed algorithm for communication deadlock detection
Information and Software Technology
Representing circuits more efficiently in symbolic model checking
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Analysis of a hybrid system using symbolic dynamics and Petri nets
Automatica (Journal of IFAC)
Data flow analysis for verifying properties of concurrent programs
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
ACM Transactions on Software Engineering and Methodology (TOSEM)
Using integer programming to verify general safety and liveness properties
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Graph models for reachability analysis of concurrent programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
A Compact Petri Net Representation and Its Implications for Analysis
IEEE Transactions on Software Engineering
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Applying static analysis to software architectures
ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
A Distributed Graph Algorithm for the Detection of Local Cycles and Knots
IEEE Transactions on Parallel and Distributed Systems
Compositional verification of concurrent systems using Petri-net-based condensation rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
Model checking
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
A Distributed Graph Algorithm: Knot Detection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Communicating sequential processes
Communications of the ACM
Parallel methods for integrating ordinary differential equations
Communications of the ACM
Efficient compilation of process-based concurrent programs without run-time scheduling
Proceedings of the conference on Design, automation and test in Europe
Symbolic Model Checking
Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations
Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations
Operating System Concepts
An empirical evaluation of deadlock detection in software architecture specifications
Annals of Software Engineering
Design and Implementation of a Petri Net Based Toolkit for Ada Tasking Analysis
IEEE Transactions on Parallel and Distributed Systems
Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis
IEEE Transactions on Software Engineering
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
Fast Bounds for Stochastic Petri Nets
International Workshop on Timed Petri Nets
Efficient Distributed Deadlock Detection and Resolution using Probes, Tokens, and Barriers
ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract)
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
SMC: A Symmetry Based Model Checker for Verification of Liveness Properties
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Deadlock Analysis of Synchronous Message-Passing Programs
PDSE '99 Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems
Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model
IEEE Transactions on Software Engineering
Principles of Concurrent and Distributed Programming (2nd Edition) (Prentice-Hall International Series in Computer Science)
Compositional State Space Reduction Using Untangled Actions
Electronic Notes in Theoretical Computer Science (ENTCS)
Debugging Ada Tasking Programs
IEEE Software
A rigorous approach towards test case generation
Information Sciences: an International Journal
Performance Analysis of Concurrent Programs Using Ordinary Differential Equations
COMPSAC '08 Proceedings of the 2008 32nd Annual IEEE International Computer Software and Applications Conference
Performance Analysis of Service Composition Using Ordinary Differential Equations
FTDCS '08 Proceedings of the 2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems
From petri nets to differential equations – an integrative approach for biochemical network analysis
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Applying ordinary differential equations to the performance analysis of service composition
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Hypergraph partitioning for the parallel computation of continuous Petri nets
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Checking system boundedness using ordinary differential equations
Information Sciences: an International Journal
Parallel computation of continuous Petri nets based on hypergraph partitioning
The Journal of Supercomputing
| Hi-index | 0.00 |
Static analysis may cause state space explosion problem. In this paper we demonstrate how ordinary differential equations can be used to check the deadlocks and boundedness of the programs. We hope that our method can avoid explosion of state space entirely. A concurrent program is represented by a family of differential equations of a restricted type, where each equation describes the program state change. This family of equations are shown analytically to have a unique solution. Each program state is measured by a time-dependent function that indicates the extent to which the state can be reached in execution. It is shown that 1) a program deadlocks iff every state measure converges to either 0 or 1 as time increases. Thus instead of exploring states, the solution of a family of differential equations is analyzed. 2) a program is bounded iff every state measure converges to a bounded nonnegative number.