A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Modeling the ADA task system by Petri nets
Computer Languages
Communicating sequential processes
Communicating sequential processes
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
IEEE Transactions on Software Engineering
Petr nets, algebras, morphisms, and compositionality
Information and Computation
Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching
IEEE Transactions on Software Engineering
Another look at abstraction in process algebra
14th International Colloquium on Automata, languages and programming
Interactive State-Space Analysis of Concurrent Systems
IEEE Transactions on Software Engineering
Algebraic theory of processes
A Petri net framework for automated analysis of Ada tasking behavior
Journal of Systems and Software
Communication and concurrency
A practical algorithm for static analysis of parallel programs
Journal of Parallel and Distributed Computing
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
Proceedings of the international workshop on Automatic verification methods for finite state systems
Design and validation of computer protocols
Design and validation of computer protocols
Information and Computation
Strong bisimilarity on nets revisited (extended abstract)
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume II: parallel languages: volume II: parallel languages
Data flow analysis of concurrent systems that use the rendezvous model of synchronization
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Computing reachable states of parallel programs
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
A model of Ada programs for static deadlock detection in polynomial times
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Programming and verifying critical systems by means of the synchronous data-flow language LUSTRE
SIGSOFT '91 Proceedings of the conference on Software for citical systems
Automated Analysis of Concurrent Systems with the Constrained Expression Toolset
IEEE Transactions on Software Engineering
Structural Testing of Concurrent Programs
IEEE Transactions on Software Engineering
A toolbox for the verification of LOTOS programs
ICSE '92 Proceedings of the 14th international conference on Software engineering
Separations of concerns in the Chiron-1 user interface development and management system
CHI '93 Proceedings of the INTERACT '93 and CHI '93 Conference on Human Factors in Computing Systems
An empirical evaluation of three methods for deadlock analysis of Ada tasking programs
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Data flow analysis for verifying properties of concurrent programs
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
A concurrency analysis tool suite for Ada programs: rationale, design, and preliminary experience
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
User interface development and software environments: the Chiron-1 system
ICSE '91 Proceedings of the 13th international conference on Software engineering
Use of Petri net invariants to detect static deadlocks in Ada programs
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Start/Pat: A Parallel-Programming Toolkit
IEEE Software
Design and Implementation of a Petri Net Based Toolkit for Ada Tasking Analysis
IEEE Transactions on Parallel and Distributed Systems
Winston: A Toll for Hierarchical Design and Simulation of Concurrent Systems
Proceedings of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems
Validation of Concurrent ADA Programs using Symbolic Execution
ESEC '89 Proceedings of the 2nd European Software Engineering Conference
A Semantics Based Verification Tool for Finite State Systems
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
A New Definition of Morphism on Petri Nets
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Generating BDDs for Symbolic Model Checking in CCS
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
A Static Analysis of CSP Programs
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Strong bisimilarity on nets: a new concept for comparing net semantics
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
The complexity of problems in systems of communicating sequential processes (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Analysis of communicating finite-state processes
Analysis of communicating finite-state processes
A Compact Petri Net Representation and Its Implications for Analysis
IEEE Transactions on Software Engineering
Software methodologies for VHDL code static analysis based on flow graphs
EURO-DAC '96/EURO-VHDL '96 Proceedings of the conference on European design automation
ICSE '97 Proceedings of the 19th international conference on Software engineering
Deriving Petri Nets from Finite Transition Systems
IEEE Transactions on Computers
Compositional verification of concurrent systems using Petri-net-based condensation rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Checking safety properties using compositional reachability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Incremental Integration Testing of Concurrent Programs
IEEE Transactions on Software Engineering
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Hermes: agent-based middleware for mobile computing
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
Hi-index | 0.00 |
The problem of analyzing concurrent systems has been investigated by many researchers, and several solutions have been proposed. Among the proposed techniques, reachability analysis—systematic enumeration of reachable states in a finite-state model—is attractive because it is conceptually simple and relatively straightforward to automate and can be used in conjunction with model-checking procedures to check for application-specific as well as general properties. This article shows that the nature of the translation from source code to a modeling formalism is of greater practical importance than the underlying formalism. Features identified as pragmatically important are the representation of internal choice, selection of a dynamic or static matching rule, and the ease of applying reductions. Since combinatorial explosion is the primary impediment to application of reachability analysis, a particular concern in choosing a model is facilitating divide-and-conquer analysis of large programs. Recently, much interest in finite-state verification systems has centered on algebraic theories of concurrency. Algebraic structure can be used to decompose reachability analysis based on a flowgraph model. The semantic equivalence of graph and Petri net-based models suggests that one ought to be able to apply a similar strategy for decomposing Petri nets. We describe how category-theoretic treatments of Petri nets provide a basis for decomposition of Petri net reachability analysis.