Graph models for reachability analysis of concurrent programs (original) (raw)
Related papers
Graph Models for Reachability of Concurrent Programs
Petri Net Reachability Graphs: Decidability Status of First Order Properties
Christophe Morvan, Roland Meyer
Logical Methods in Computer Science, 2012
Improving reachability analysis for partially symmetric high level Petri nets
Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets
ACM Transactions on Embedded Computing Systems, 2013
Using Forward Reachability Analysis for Verification of Timed Petri Nets
Nord. J. Comput., 2007
Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking
Lecture Notes in Computer Science, 2014
A Technique for Reachability Graph Generation for the Petri Net Models of Parallel Processes
Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies
Lecture Notes in Computer Science, 2005
Verification in concurrent programming with Petri nets structural techniques
Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231), 1998
Compositional reachability analysis using process algebra
Proceedings of the symposium on Testing, analysis, and verification - TAV4, 1991
Lecture Notes in Computer Science, 2011
Efficient Hybrid Reachability Analysis for Asynchronous Concurrent Systems
Lecture Notes in Computer Science, 2003
A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis
Lecture Notes in Computer Science, 2006
MARCIE - Model Checking and Reachability Analysis Done EffiCIEntly
2011 Eighth International Conference on Quantitative Evaluation of SysTems, 2011
Model checking through symbolic reachability graph
Lecture Notes in Computer Science, 1997
Exploiting predicate structure for efficient reachability detection
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering - ASE '05, 2005
SAT-Based (Parametric) Reachability for Time Petri Nets
Coverage Preserving Reduction Strategies for Reachability Analysis
Protocol Specification, Testing and Verification, XII, 1992
Reachability Analysis of Time Basic Petri Nets: a Time Coverage Approach
Arxiv preprint arXiv:1107.1166, 2011
SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets
2010
Formal Verification of Concurrent Systems via Directed Model Checking Abstract
2006
Extensions to the CEGAR Approach on Petri Nets
Acta Cybernetica, 2014
LREs: A Framework for Guiding Symbolic Reachability Analysis
Verification of temporal properties in concurrent systems
2003
Formal Verification of Concurrent Systems via Directed Model Checking
Electronic Notes in Theoretical Computer Science, 2007
Evaluating symbolic traversal algorithms applied to asynchronous concurrent systems
Proceedings. Fourth International Conference on Application of Concurrency to System Design, 2004. ACSD 2004., 2004
A Reduced Reachability Tree for a Class of Unbounded Petri Nets
Context Constraint for Automated Compositional Reachability Analysis
1995
Computing reachable states of parallel programs
Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging - PADD '91, 1991
An Interleaving Reduction for Reachability Checking in Symbolic Modeling
2015
Logical Methods in Computer Science, 2009
A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
Electronic Proceedings in Theoretical Computer Science, 2012
The complexity of reachability in distributed communicating processes
Acta Informatica, 1988
Symbolic analysis of bounded Petri nets
IEEE Transactions on Computers, 2001