Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
A Unified High-Level Petri Net Formalism for Time-Critical Systems
IEEE Transactions on Software Engineering
Reasoning about systems with many processes
Journal of the ACM (JACM)
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
Deciding bisimulation equivalences for a class of non-finite-state programs
Information and Computation
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Composition, decomposition and model checking of pushdown processes
Nordic Journal of Computing
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Bisimulation Equivalence is Decidable for One-Counter Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Verifying Networks of Timed Processes (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Simulation Is Decidable for One-Counter Nets (Extended Abstract)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Checking Regular Properties of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Symbolic Model Checking with Rich ssertional Languages
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Efficient Timed Reachability Analysis Using Clock Difference Diagrams
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Putting Time into Proof Outlines
Proceedings of the Real-Time: Theory in Practice, REX Workshop
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Better is Better than Well: On Efficient Verification of Infinite-State Systems
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On Non-Decidability of Reachability for Timed-Arc Petri Nets
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Decidability of the termination problem for completely specified protocols
Distributed Computing
Decidability of properties of timed-arc Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Decidability of Safety Properties of Timed Multiset Rewriting
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
Translating TPAL Specifications into Timed-Arc Petri Nets
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Weak Alternating Timed Automata
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Weak Time Petri Nets Strike Back!
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Noetherian spaces in verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Ordinal theory for expressiveness of well structured transition systems
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
On the verification of timed ad hoc networks
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Timed petri nets and timed automata: on the discriminating power of zeno sequences
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Comparison of different semantics for time petri nets
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Comparison of the expressiveness of timed automata and time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
An algebra of petri nets with arc-based time restrictions
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Timed-arc petri nets vs. networks of timed automata
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed petri nets
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Controller synthesis for MTL specifications
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Zenoness detection and timed model checking for real time systems
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
On the expressive power of timed automata and time petri nets
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
TAPAAL 2.0: integrated development environment for timed-arc petri nets
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
The expressive power of time Petri nets
Theoretical Computer Science
Ordinal theory for expressiveness of well-structured transition systems
Information and Computation
Reachability of communicating timed processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
The right timing: reflections on the modeling and analysis of time
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
We consider (unbounded) Timed Petri Nets (TPNs) where each token is equipped with a real-valued clock representing the "age" of the token. Each arc in the net is provided with a subinterval of the natural numbers, restricting the ages of the tokens travelling the arc. We apply a methodology developed in [AN00], based on the theory of better quasi orderings (BQOs), to derive an efficient constraint system for automatic verification of safety properties for TPNs. We have implemented a prototype based on our method and applied it for verification of a parametrized version of Fischer's protocol.