Interactive State-Space Analysis of Concurrent Systems

Authors:
E. Timothy Morgan;Rami R. Razouk
Affiliations:
Univ. of California, Irvine;Univ. of California, Irvine
Venue:
IEEE Transactions on Software Engineering
Year:
1987

Citing 0
Cited 22

Combining Static Concurrency Analysis with Symbolic Execution

IEEE Transactions on Software Engineering
Task interaction graphs for concurrency analysis

ICSE '89 Proceedings of the 11th international conference on Software engineering
Rethinking the taxonomy of fault detection techniques

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
A Protocol Modeling and Verification Approach Based on a Specification Language and Petri Nets

IEEE Transactions on Software Engineering
Compositional reachability analysis using process algebra

TAV4 Proceedings of the symposium on Testing, analysis, and verification
Specification and analysis of parallel/distributed software and systems by Petri nets with transition enabling functions

IEEE Transactions on Software Engineering
Using state space reduction methods for deadlock analysis in Ada tasking

ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada

ACM Transactions on Software Engineering and Methodology (TOSEM)
A concurrency analysis tool suite for Ada programs: rationale, design, and preliminary experience

ACM Transactions on Software Engineering and Methodology (TOSEM)
Graph models for reachability analysis of concurrent programs

ACM Transactions on Software Engineering and Methodology (TOSEM)
A compact Petri net representation for concurrent programs

Proceedings of the 17th international conference on Software engineering
A Compact Petri Net Representation and Its Implications for Analysis

IEEE Transactions on Software Engineering
An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis

IEEE Transactions on Parallel and Distributed Systems
The use of Petri nets for modeling pipelined processors

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
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
Behavior relativity of Petri nets

Journal of Computer Science and Technology
State space representation of routing flexibility

Computers and Industrial Engineering
Static Analysis of Concurrent Programs Using Ordinary Differential Equations

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
State space representation of routing flexibility

Computers and Industrial Engineering
A brief survey and synthesis of the roles of time in petri nets

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

The introduction of concurrency into programs has added to the complexity of the software design process. This is most evident in the design of communications protocols where concurrency is inherent to the behavior of the system. The complexity exhibited by such software systems makes more evident the need for computer-aided tools for automatically analyzing behavior.