Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics
From MaRDI portal
Publication:2822654
DOI10.1007/978-3-319-39086-4_11zbMath1346.68134MaRDI QIDQ2822654
Publication date: 4 October 2016
Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01379424/file/Schedules%28PN2016%29.pdf
90B35: Deterministic scheduling theory in operations research
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- Conformance testing for real-time systems
- Model checking of time Petri nets using the state class timed automaton
- Fault detection and diagnosis in distributed systems: An approach by partially stochastic Petri nets
- A technique of state space search based on unfolding
- A causal semantic for time Petri nets
- An improvement of McMillan's unfolding algorithm
- A branch and bound algorithm for scheduling trains in a railway network
- Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
- Realizability of Real-Time Logics
- Simulation and the Monte Carlo Method
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- Formal Modeling and Analysis of Timed Systems