Waiting nets
From MaRDI portal
Publication:2165233
Recommendations
Cites work
- scientific article; zbMATH DE number 1696456 (Why is no real title available?)
- scientific article; zbMATH DE number 4209631 (Why is no real title available?)
- scientific article; zbMATH DE number 1302047 (Why is no real title available?)
- scientific article; zbMATH DE number 1755138 (Why is no real title available?)
- scientific article; zbMATH DE number 1759608 (Why is no real title available?)
- A theory of timed automata
- Combining free choice and time in Petri nets
- Complexity of some problems in Petri nets
- Complexity results for 1-safe nets
- Decidable classes of unbounded Petri nets with time and urgency
- Lectures on Concurrency and Petri Nets
- Model checking of time Petri nets using the state class timed automaton
- Reachability problems and abstract state spaces for time Petri nets with stopwatches
- Removing \(\epsilon \)-transitions in timed automata
- The covering and boundedness problems for vector addition systems
- The expressive power of time Petri nets
- Timed Petri nets with reset for pipelined synchronous circuit design
- Verification of Timed-Arc Petri Nets
- Weak Time Petri Nets Strike Back!
Cited in
(6)
This page was built for publication: Waiting nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165233)