Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
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
Symbolic Model Checking
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
Computing Reachability Properties Hidden in Finite Net Unfoldings
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking LTL Using Net Unforldings
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Using Compositional Preorders in the Verification of Sliding Window Protocal
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Deadlock Checking Using Net Unfoldings
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
CONCUR '00 Proceedings of the 11th 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
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
Unfolding of Products of Symmetrical Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
System Specification and Verification Using High Level Concepts - A Tool Demonstration
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Unfoldings of Coloured Petri Nets
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Tight Local Approximation Results for Max-Min Linear Programs
Algorithmic Aspects of Wireless Sensor Networks
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Generalised computation of behavioural profiles based on petri-net unfoldings
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
An approach to unfolding asynchronous communication protocols
FM'05 Proceedings of the 2005 international conference on Formal Methods
| Hi-index | 0.00 |
A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix. The techniques presented so far required to run an elaborate algorithm on the prefix.