Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Using partial orders for the efficient verification of deadlock freedom and safety properties
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Journal of the ACM (JACM)
The Book of Traces
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
Black Box Unfolding with Local First Search
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
An Unfolding Algorithm for Synchronous Products of Transition Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Local First Search - A New Paradigm for Partial Order Reductions
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
IF-2.0: A Validation Environment for Component-Based Real-Time Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A partial order semantics approach to the clock explosion problem of timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Adding invariants to event zone automata
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
A nice labelling for tree-like event structures of degree 3
Information and Computation
Stronger reduction criteria for local first search
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
A nice labelling for tree-like event structures of degree 3
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
We present the implementation of trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to store trace systems, which allows sharing common prefixes among traces and therefore reduces memory cost. This structure is easy to extend to incorporate additional features. Two applications are shown in the paper: An extended structure to support a new adequate order for Local First Search, and an acceleration of event zone based state space search for timed automata.