Realizability of schedules by stochastic time Petri nets with blocking semantics
From MaRDI portal
Recommendations
Cites work
- A branch and bound algorithm for scheduling trains in a railway network
- A causal semantic for time Petri nets
- A technique of state space search based on unfolding
- An improvement of McMillan's unfolding algorithm
- Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
- Conformance testing for real-time systems
- Fault detection and diagnosis in distributed systems: An approach by partially stochastic Petri nets
- Formal Modeling and Analysis of Timed Systems
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- Model checking of time Petri nets using the state class timed automaton
- Realizability of real-time logics
- Simulation and the Monte Carlo Method
Cited in
(3)
This page was built for publication: Realizability of schedules by stochastic time Petri nets with blocking semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822654)