Modeling and analysis of timed Petri nets using heaps of pieces

DOI10.1109/9.754807zbMath0955.68082OpenAlexW2160168402MaRDI QIDQ4506745

Jean Mairesse, Stéphane Gaubert

Publication date: 17 October 2000

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.754807

zbMATH Keywords

Petri netsheaps of pieces

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (36)

A MAX-plus model of ribosome dynamics during mRNA translation ⋮ Supervisory control of \((\max,+)\) automata: a behavioral approach ⋮ Determinization of timed Petri nets behaviors ⋮ Coinduction in Concurrent Timed Systems ⋮ Networked conflicting timed event graphs representation in (Max,+) algebra ⋮ Initial-state detectability and initial-state opacity of unambiguous weighted automata ⋮ A contribution to the determinization of max-plus automata ⋮ Model approximation for batch flow shop scheduling with fixed batch sizes ⋮ Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata ⋮ Application of an optimization problem in max-plus algebra to scheduling problems ⋮ Towards a tropical automaton product minimizing global completion times ⋮ Transferring progress control policies in scheduling problems for a class of repetitive discrete event systems ⋮ A central limit theorem for stochastic recursive sequences of topical operators ⋮ Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra ⋮ Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture ⋮ Backward coupling in bounded free-choice nets under Markovian and non-Markovian assumptions ⋮ Extremal throughputs in free-choice nets ⋮ Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton ⋮ State estimation of max-plus automata with unobservable events ⋮ Asymptotic behavior in a heap model with two pieces ⋮ Direct and dual laws for automata with multiplicities ⋮ Supervisory control of (max,+) automata: extensions towards applications ⋮ Series which are both max-plus and min-plus rational are unambiguous ⋮ Unnamed Item ⋮ Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan ⋮ Behaviour equivalent max-plus automata for timed Petri nets under open-loop race-policy semantics ⋮ REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS ⋮ Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring ⋮ Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net ⋮ The Shortest Identities for Max-Plus Automata with Two States. ⋮ Comparison of max-plus automata and joint spectral radius of tropical matrices ⋮ New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems ⋮ Compositions of (max,+) automata ⋮ Formal analysis and control of timed automata with guards using (max, +) and (min, +) algebras ⋮ Analysis of P-time event graphs in (max,+) and (min,+) semirings ⋮ Modelling and feedback control for a class of Petri Nets with shared resources subject to strict time constraints using Max-plus algebra

This page was built for publication: Modeling and analysis of timed Petri nets using heaps of pieces