Waiting nets
From MaRDI portal
Publication:2165233
DOI10.1007/978-3-031-06653-5_4zbMATH Open1499.68226OpenAlexW4285308543MaRDI QIDQ2165233FDOQ2165233
Authors: Loïc Hélouët, Pranay Agrawal 
Publication date: 19 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06653-5_4
Recommendations
Cites Work
- A theory of timed automata
- Title not available (Why is that?)
- Lectures on Concurrency and Petri Nets
- The covering and boundedness problems for vector addition systems
- Title not available (Why is that?)
- The expressive power of time Petri nets
- Reachability problems and abstract state spaces for time Petri nets with stopwatches
- Complexity of some problems in Petri nets
- Removing \(\epsilon \)-transitions in timed automata
- Model checking of time Petri nets using the state class timed automaton
- Weak Time Petri Nets Strike Back!
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity results for 1-safe nets
- Title not available (Why is that?)
- Timed Petri nets with reset for pipelined synchronous circuit design
- Verification of Timed-Arc Petri Nets
- Combining free choice and time in Petri nets
- Decidable classes of unbounded Petri nets with time and urgency
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)
