5 research outputs found
Back in Time Petri Nets
11th Int. Conf. on Formal Modeling and Analysis of Timed Systems (FORMATS'13) July 2013 Buenos AiresInternational audienceThe time progress assumption is at the core of the semantics of real-time formalisms. It is also the major obstacle to the development of partial-order techniques for real-time distributed systems since the events are ordered both by causality and by their occurrence in time. Anyway, extended free choice safe time Petri nets (TPNs) were already identi ed as a class where partial order semantics behaves well. We show that, for this class, the time progress assumption can even be dropped (time may go back in case of concurrency), which establishes a nice relation between partial-order semantics and time progress assumption
Higher-Dimensional Timed Automata
We introduce a new formalism of higher-dimensional timed automata, based on
van Glabbeek's higher-dimensional automata and Alur's timed automata. We prove
that their reachability is PSPACE-complete and can be decided using zone-based
algorithms. We also show how to use tensor products to combat state-space
explosion and how to extend the setting to higher-dimensional hybrid automata
Back in Time Petri Nets
International audienc
Back in Time Petri Nets
Abstract. The time progress assumption is at the core of the semantics of real-time formalisms. It is also the major obstacle to the development of partial-order techniques for real-time distributed systems since the events are ordered both by causality and by their occurrence in time. Anyway, extended free choice safe time Petri nets (TPNs) were already identified as a class where partial order semantics behaves well. We show that, for this class, the time progress assumption can even be dropped (time may go back in case of concurrency), which establishes a nice relation between partial-order semantics and time progress assumption