Modeling concurrency with partial orders
International Journal of Parallel Programming
Current trends in concurrency. Overviews and tutorials
Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching
IEEE Transactions on Software Engineering
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Interleaving set temporal logic
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On the development of reactive systems
Logics and models of concurrent systems
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
Operational semantics of a kernel of the language ELECTRE
Theoretical Computer Science
Defining conditional independence using collapses
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Compilation of the ELECTRE reactive language into finite transition systems
Theoretical Computer Science
Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs
IEEE Transactions on Software Engineering - Special issue: best papers of the 1996 international symposium on software testing and analysis ISSTA'96
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
A partial order approach to branching time logic model checking
Information and Computation
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Symbolic Model Checking
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Coverage Preserving Reduction Strategies for Reachability Analysis
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Specifiying and Proving Communication Closedness in Protocols
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
Proceedings of the 3rd International Workshop on Distributed Algorithms
Partial-Order Methods for Temporal Verification
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Partial Orders and Verification of Real-Time systems
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Analysis of Slope-Parametric Hybrid Automata
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Using Partial Orders to Improve Automatic Verification Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
On-the-Fly Verification with Stubborn Sets
CAV '93 Proceedings of the 5th International Conference 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
Combining Partial Order Reductions with On-the-fly Model-Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
A temporal logic for reasoning about partially ordered computations (Extended Abstract)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Verification of concurrent systems: function and timing
Verification of concurrent systems: function and timing
Verification of distributed programs using representative interleaving sequences
Distributed Computing
| Hi-index | 0.01 |
We are concerned in this paperwith the verification of reactive systems with event memorization.The reactive systems are specified with an asynchronous reactivelanguage Electre the main feature of whichis the capability of memorizing occurrences of events in orderto process them later. This memory capability is quite interestingfor specifying reactive systems but leads to a verification modelwith a dramatically large number of states (due to the storedoccurrences of events). In this paper, we show that partial-ordermethods can be applied successfuly for verification purposeson our model of reactive programs with event memorization. Themain points of our work are two-fold: (1) we show that the independencerelation which is a key point for applying partial-order methodscan be extracted automatically from an Electreprogram; (2) the partial-order technique turns out to be veryefficient and may lead to a drastic reduction in the number ofstates of the model as demonstrated by a real-life industrialcase study.