Petri nets: an introduction
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Fundamenta Informaticae - Special issue on Petri nets
Symbolic Model Checking
Formal Development of Reactive Systems - Case Study Production Cell
Formal Development of Reactive Systems - Case Study Production Cell
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
prod 3.2: An Advanced Tool for Efficient Reachability Analysis
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Model Checking LTL Using Net Unforldings
CAV '98 Proceedings of the 10th 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
Deadlock Checking Using Net Unfoldings
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Net Reductions for LTL Model-Checking
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Dynamic partial-order reduction for model checking software
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Faster Unfolding of General Petri Nets Based on Token Flows
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Executability of scenarios in Petri nets
Theoretical Computer Science
Unfolding Semantics of Petri Nets Based on Token Flows
Fundamenta Informaticae - Petri Nets 2008
Efficient model checking of safety properties
SPIN'03 Proceedings of the 10th international conference on Model checking software
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Efficient contextual unfolding
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Answer set programming: a declarative approach to solving search problems
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Towards synthesis of petri nets from scenarios
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Efficient unfolding of contextual Petri nets
Theoretical Computer Science
Unfolding Semantics of Petri Nets Based on Token Flows
Fundamenta Informaticae - Petri Nets 2008
Go beyond the SCOPE: a temporal situation calculus-based software tool for time petri nets
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Verification of petri nets with read arcs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Vector-clock based partial order reduction for JPF
ACM SIGSOFT Software Engineering Notes
Hi-index | 0.00 |
We report on an implementation of the unfolding approach to model-checking LTL-X recently presented by the authors. Contrary to that work, we consider an state-based version of LTL-X, which is more used in practice. We improve on the checking algorithm; the new version allows to reuse code much more efficiently. We present results on a set of case studies.