In: Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 2002), Proceedings of the 7th International Symposium, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002, pages 165-183. Volume 2469 of Lecture Notes in Computer Science / W. Damm, E.-R. Olderog (Eds.) --- Springer Verlag, October 2002.
Abstract: We propose timed multiset rewriting as a framework that subsumes timed Petri nets and timed automata. In timed multiset rewriting, which extends multiset rewriting, each element of a multiset has a clock, and a multiset is transformed not only by usual rewriting but also by time elapse. Moreover, we can specify conditions on clocks for rewriting.
In this paper, we analyze reachability, boundedness, and coverability of timed multiset rewriting. Decidability of each property on the system depends on the presence of invariant rules and diagonal constraints. First, we show that all three properties are undecidable for systems with invariant rules. Then we show that reachability is undecidable, and both boundedness and coverability are decidable for the system without invariant rules. Finally, we show that all the three properties are undecidable if we include diagonal constraints even when excluding invariant rules.
Keywords: real-time systems; timed Petri nets; timed automata; decidability.
Back to the Petri Nets Bibliography