Results 1 - 10 of 20,907

Timed petri nets and BQOs

by Parosh Aziz Abdulla - In Proc. ICATPN’01 , 2001
"... Abstract. 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 methodolog ..."
Abstract - Cited by 61 (9 self) - Add to MetaCart
Abstract. 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

Processes of Timed Petri Nets

by Józef Winkowski, Instytut Podstaw, Informatyki Pan
"... . Processes of timed Petri nets are represented by labelled partial orders with some extra features. These features reflect the execution times of processes and allow to combine processes sequentially and in parallel, which leads to some algebras. The processes can be represented either without spec ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
. Processes of timed Petri nets are represented by labelled partial orders with some extra features. These features reflect the execution times of processes and allow to combine processes sequentially and in parallel, which leads to some algebras. The processes can be represented either without

and Timed Petri Nets

by Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-velardo, École Normale, Supérieure Cachan, R. Bonnet, A. Finkel, S. Haddad, F. Rosa-velardo , 2010
"... Abstract. Well-Structured Transitions Systems (WSTS) constitute a generic class of infinite-state systems for which several properties like coverability remain decidable. The family of coverability languages that they generate is an appropriate criterium for measuring their expressiveness. Here we e ..."
Abstract - Add to MetaCart
establish that Petri Data nets (PDNs) and Timed Petri nets (TdPNs), two powerful classes of WSTS are equivalent w.r.t this criterium. 1

Back in Time Petri Nets

by Thomas Chatain, Claude Jard
"... 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, exten ..."
Abstract - Add to MetaCart
, 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

PRICED TIMED PETRI NETS

by Parosh Aziz Abdulla, Richard Mayr , 2011
"... We consider priced timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Furthermore, our cost model assigns token storage costs per time unit to places, and firing ..."
Abstract - Add to MetaCart
We consider priced timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Furthermore, our cost model assigns token storage costs per time unit to places

Undecidability of LTL for Timed Petri Nets

by Parosh Aziz Abdulla, Aletta Nylén, Abdulla Aletta Nyl'en - In INFINITY 2002, 4th International Workshop on Verification of Infinite-State Systems , 2002
"... We show undecidability of (action based) linear-time temporal logic (LTL) for timed Petri nets. This is to be contrasted with decidability of both the problem of checking safety properties for timed Petri nets, and the problem of checking LTL formulae for (untimed) Petri nets. The undecidability ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
We show undecidability of (action based) linear-time temporal logic (LTL) for timed Petri nets. This is to be contrasted with decidability of both the problem of checking safety properties for timed Petri nets, and the problem of checking LTL formulae for (untimed) Petri nets

Time processes of time Petri nets

by Tuomas Aura - IN APPLICATIONS AND THEORY OF PETRI NETS , 1996
"... The objective of this thesis is to give time Petri nets a partial order semantics, like the nonsequential processes of untimed net systems. A time process of a time Petri net is defined as a traditionally constructed causal process with a valid timing. This means that the events of the process are l ..."
Abstract - Cited by 19 (1 self) - Add to MetaCart
The objective of this thesis is to give time Petri nets a partial order semantics, like the nonsequential processes of untimed net systems. A time process of a time Petri net is defined as a traditionally constructed causal process with a valid timing. This means that the events of the process

Time Petri Nets Analysis with TINA

by unknown authors
"... Abstract — Beside the usual graphic editing and simulation facilities, the software tool Tina may build a number of state space abstractions for Petri nets or Time Petri nets, preserving certain classes of properties. For Petri nets, these abstractions help preventing combinatorial explosion and rel ..."
Abstract - Add to MetaCart
Abstract — Beside the usual graphic editing and simulation facilities, the software tool Tina may build a number of state space abstractions for Petri nets or Time Petri nets, preserving certain classes of properties. For Petri nets, these abstractions help preventing combinatorial explosion

Time and Timed Petri Nets

by Serge Haddad , 2011
"... (slides) ..."
Abstract - Add to MetaCart
Abstract not found

Analyzing Paths in Time Petri Nets

by Louchka Popova-zeugmann, Dirk Schlatter , 1999
"... . In this paper, a parametric description of a transition sequence in a Time Petri net is introduced. The minimal and maximal time duration of a transition sequence are shown to be integers and furthermore the min/max path passes only integer-states. A necessary condition for the reachability of an ..."
Abstract - Cited by 14 (7 self) - Add to MetaCart
. In this paper, a parametric description of a transition sequence in a Time Petri net is introduced. The minimal and maximal time duration of a transition sequence are shown to be integers and furthermore the min/max path passes only integer-states. A necessary condition for the reachability
Results 1 - 10 of 20,907