Behaviour equivalent max-plus automata for timed Petri nets under open-loop race-policy semantics

DOI10.1007/S10626-021-00346-0zbMath1480.93273OpenAlexW3190560908WikidataQ113444922 ScholiaQ113444922MaRDI QIDQ2063100

Lukas Triska, Thomas Moor

Publication date: 10 January 2022

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-021-00346-0

zbMATH Keywords

Petri netstimed discrete-event systemsmax-plus automatarace policy

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete event control/observation systems (93C65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Determinization of timed Petri nets behaviors
• Control of discrete-event systems. Automata and Petri net perspectives
• Supervisory control of \((\max,+)\) automata: a behavioral approach
• Time-based expressivity of time Petri nets for system specification
• A theory of timed automata
• A contribution to the determinization of max-plus automata
• Compositions of (max,+) automata
• 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
• Performance evaluation of (max,+) automata
• Verification of Detectability for Unambiguous Weighted Automata
• The Synthesis of Time Optimal Supervisors by Using Heaps-of-Pieces

This page was built for publication: Behaviour equivalent max-plus automata for timed Petri nets under open-loop race-policy semantics