Determinization of timed Petri nets behaviors
From MaRDI portal
Publication:312642
DOI10.1007/s10626-015-0214-1zbMath1346.93252OpenAlexW789548629MaRDI QIDQ312642
Jean-Louis Boimond, Jan Komenda, Sébastien Lahaye
Publication date: 16 September 2016
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-015-0214-1
Hierarchical systems (93A13) Discrete event control/observation systems (93C65) Max-plus and related algebras (15A80)
Related Items (3)
Determinization of timed Petri nets behaviors ⋮ Initial-state detectability and initial-state opacity of unambiguous weighted automata ⋮ Behaviour equivalent max-plus automata for timed Petri nets under open-loop race-policy semantics
Cites Work
- Unnamed Item
- Determinization of timed Petri nets behaviors
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Supervisory control of \((\max,+)\) automata: a behavioral approach
- \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
- A theory of timed automata
- On supervisory policies that enforce global fairness and bounded fairness in partially controlled Petri nets
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Feedback control of Petri nets based on place invariants
- Compositions of (max,+) automata
- Sequential?
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- Modeling and analysis of timed Petri nets using heaps of pieces
- Discrete, Continuous, and Hybrid Petri Nets
- Performance evaluation of (max,+) automata
- Efficient implementation of fairness in discrete-event systems using queues
- Blending Timed Formal Models with Clock Transition Systems
- Supervisory Control of Petri Nets with Language Specifications
This page was built for publication: Determinization of timed Petri nets behaviors
