Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Modeling and analysis of a virtual reality system with time Petri nets
Proceedings of the 20th international conference on Software engineering
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Analyzing paths in time petri nets
Fundamenta Informaticae - Special issue on Petri nets
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Bounded model checking for the universal fragment of CTL
Fundamenta Informaticae
Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets
IEEE Transactions on Software Engineering
Bounded Model Checking for Timed Systems
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Verification Based on Local States
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Bounded Reachability Checking with Process Semantics
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Towards Bounded Model Checking for the Universal Fragment of TCTL
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Tuning SAT Checkers for Bounded Model Checking
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
A Partial Order Method for the Verification of Time Petri Nets
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Parametric Quantitative Temporal Reasoning
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Checking reachability properties for timed automata via SAT
Fundamenta Informaticae - Concurrency specification and programming
Minimization Algorithms for Time Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Improvements in SAT-based Reachability Analysis for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
ACTLS properties and Bounded Model Checking
Fundamenta Informaticae
SAT-based Reachability Checking for Timed Automata with Diagonal Constraints
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Bounded model checking for past LTL
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
√erics: a tool for verifying timed automata and estelle specifications
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Parametric model checking with verICS
Transactions on Petri nets and other models of concurrency IV
Hi-index | 0.00 |
Formal methods - among them the model checking techniques - play an important role in the design and production of both systems and software. In this paper we deal with an adaptation of the bounded model checking methods for timed systems, developed for timed automata, to the case of time Petri nets. We consider distributed time Petri nets and parametric reachability checking, but the approach can be easily adapted to verification of other kinds of properties for which the bounded model checking methods exist. A theoretical description is supported by some experimental results, generated using an extension of the model checker VerICS.