From timed Petri nets to timed LOTOS
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Analysis of Place/Transition Nets with Timed Arcs and its Application to Batch Process Control
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
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 properties of timed-arc Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application 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
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
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
| Hi-index | 0.00 |
In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. This formalism enables to model e.g. hardware architectures like GALS. We give a formal definition of process semantics for our model and investigate several properties of local versus global timing: expressiveness, reachability and coverability.