Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
javier lozano silva
Claudia Calabrese
Umut Engin Ayten
Hao Mao
Peter Malec
Giovanni Venturelli
Chen Ma
Amitabha Chattopadhyay
Radu Timofte
Kuanrui Yin
Home
/
Author
/
JAN KOMENDA
Author Info
Open Visualization
Name
Affiliation
Papers
JAN KOMENDA
Institute of Mathematics, Academy of Sciences of the Czech Republic, Žižkova 22, 616 62 Brno, Czech Republic
44
Collaborators
Citations
PageRank
30
147
21.85
Referers
Referees
References
129
293
385
Search Limit
100
293
Publications (44 rows)
Collaborators (30 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Modular control of discrete-event systems using similarity
0
0.34
2022
Observer Construction for Polynomially Ambiguous Max-Plus Automata
0
0.34
2022
Diagnosability of Unambiguous Max-Plus Automata
0
0.34
2022
A contribution to the determinization of max-plus automata
1
0.35
2020
Max-plus algebra in the history of discrete event systems.
3
0.37
2018
Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication.
1
0.38
2017
Distributed Computation Of Maximally Permissive Supervisors In Three-Level Relaxed Coordination Control Of Discrete-Event Systems
0
0.34
2016
Distributed Computation Of Supremal Conditionally Controllable Sublanguages
0
0.34
2016
On a distributed computation of supervisors in modular supervisory control
5
0.48
2016
Determinization of timed Petri nets behaviors
3
0.37
2016
Compositions of (max, +) automata
1
0.35
2015
Supervisory Control Of (Max, Plus ) Automata: Extensions Towards Applications
1
0.34
2015
Multilevel coordination control of partially observed modular DES
0
0.34
2015
Relative observability in coordination control
4
0.40
2015
On the Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control.
0
0.34
2015
A Note on Relative Observability in Coordination Control.
1
0.37
2014
Maximally Permissive Coordination Supervisory Control - Towards Necessary and Sufficient Conditions.
3
0.77
2014
Modeling of Timed Petri Nets Using Deterministic (max, +) Automata.
3
0.39
2014
A bridge between decentralized and coordination control.
5
0.47
2013
Coordination control of discrete-event systems revisited
10
0.62
2013
Supervisory control synthesis of discrete-event systems using a coordination scheme
13
0.77
2012
On Conditional Decomposability
7
0.55
2012
On algorithms and extensions of coordination control of discrete-event systems.
3
0.57
2012
Decentralized control of product (max+)-automata using coinduction.
0
0.34
2012
Control of Distributed Systems: Tutorial and Overview.
14
0.92
2011
Hierarchical control with partial observations: Sufficient conditions
2
0.40
2011
Residuation Of Tropical Series: Rationality Issues
4
0.43
2011
Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator
12
1.05
2011
Synchronous composition of interval weighted automata.
2
0.38
2010
Coinduction in Concurrent Timed Systems
1
0.41
2010
Synthesis of safe sublanguages satisfying global specification using coordination scheme for discrete-event systems.
5
0.80
2010
Modeling of interval P-time Petri nets using dioid algebra.
0
0.34
2010
Supremal normal sublanguages in hierarchical supervisory control.
2
0.50
2010
Supervisory Control of (max,+) Automata: A Behavioral Approach
15
1.27
2009
Control of discrete-event systems with modular or distributed structure
2
0.57
2007
Supervisory Control Of Heap Models Using Synchronous Composition
0
0.34
2007
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
20
1.50
2005
Control of modular and distributed discrete-event systems
1
0.40
2005
Discussion on: Supervisory Control of Discrete Event Systems with Flexible Marking
0
0.34
2004
Coinduction in Control of Partially Observed Discrete-Event Systems
0
0.34
2003
Input-Output Relation and Time-Optimal Control of a Classof Hybrid Petri Nets Using (\min,+) Semiring
2
0.40
2001
The Use of Conventional and Minplus Algebra for the Modeling of Hybrid Petri Nets
0
0.34
1998
Analysis Of Hybrid Petri Nets Based On The Hybrid State Equation.
0
0.34
1998
On the Calculation of the Transfer Function of Timed Event Petri Nets
1
0.51
1997
1