Pages that link to "Item:Q5491871"
From MaRDI portal
The following pages link to Automated Technology for Verification and Analysis (Q5491871):
Displaying 17 items.
- Comparative trace semantics of time Petri nets (Q300337) (← links)
- When are timed automata weakly timed bisimilar to time Petri nets? (Q944375) (← links)
- Interpreted synchronous extension of time Petri nets. Definition, semantics and formal analysis (Q2128086) (← links)
- `True concurrency' semantics for time Petri nets with weak time and persistent atomic policies (Q2664520) (← links)
- Decidable Classes of Unbounded Petri Nets with Time and Urgency (Q2822660) (← links)
- Maximally permissive controller synthesis for time Petri nets (Q2871733) (← links)
- Weak Time Petri Nets Strike Back! (Q3184699) (← links)
- Comparing Semantics Under Strong Timing of Petri Nets (Q3455089) (← links)
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
- (Q3601860) (← links)
- Cost Problems for Parametric Time Petri Nets* (Q5025060) (← links)
- Formal Modeling and Analysis of Timed Systems (Q5897964) (← links)
- Liveness enforcement for production systems modeled by time Petri nets (Q6052675) (← links)
- State estimation in labeled time Petri net systems using observed modified state class graph (Q6179959) (← links)
- An approach for enforcing a class of GMECs on time Petri nets with uncontrollable transitions (Q6186994) (← links)
- A state class based controller synthesis approach for time Petri nets (Q6535204) (← links)
- Fast termination and workflow nets (Q6535631) (← links)