Verification of Safety Properties Using IntegerProgramming: Beyond the State Equation
Formal Methods in System Design
Implementing LTL model checking with net unfoldings
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Model Checking of Safety Properties
Formal Methods in System Design
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
A New Unfolding Approach to LTL Model Checking
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Bounded LTL Model Checking with Stable Models
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Parallelisation of the Petri Net Unfolding Algorithm
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
LP Deadlock Checking Using Partial Order Dependencies
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Bounded Reachability Checking with Process Semantics
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Towards an Efficient Algorithm for Unfolding Petri Nets
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Model Checking of Safety Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Detection of Illegal Behaviors Based on Unfoldings
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Canonical Prefixes of Petri Net Unfoldings
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
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
SAT-Solving the Coverability Problem for Petri Nets
Formal Methods in System Design
Bounded LTL model checking with stable models
Theory and Practice of Logic Programming
A Sufficient Condition for Reachability in a General Petri Net
Discrete Event Dynamic Systems
Merged processes: a new condensed representation of Petri net behaviour
CONCUR 2005 - Concurrency Theory
A practical application of geometric semantics to static analysis of concurrent programs
CONCUR 2005 - Concurrency Theory
Optimal trajectory generation for petri nets
Acta Cybernetica
Unfolding Based Algorithms for the Reachability Problem
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Verification of bounded Petri nets using integer programming
Formal Methods in System Design
Trellis Processes: A Compact Representation for Runs of Concurrent Systems
Discrete Event Dynamic Systems
Action Planning for Directed Model Checking of Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Designing a LTL model-checker based on unfolding graphs
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
An algorithm for direct construction of complete merged processes
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
On the construction of pullbacks for safe petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
An approach to unfolding asynchronous communication protocols
FM'05 Proceedings of the 2005 international conference on Formal Methods
Structuring acyclic process models
Information Systems
On the construction of fine automata for safety properties
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Structure-based deadlock checking of asynchronous circuits
Journal of Computer Science and Technology - Special issue on Natural Language Processing
Unfolding Based Algorithms for the Reachability Problem
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Verification of petri nets with read arcs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |