Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Simon Ware"'
Publikováno v:
IEEE Access, Vol 8, Pp 92637-92646 (2020)
In this paper we consider the problem of collision avoidance among robots that follow pre-planned trajectories in a structured environment while minimizing the maximum traveling time among them. More precisely, we consider a discrete event formulatio
Externí odkaz:
https://doaj.org/article/19409b1f264342d989ca2b2666783dcb
Autor:
Simon Ware, Robi Malik
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 58, Iss Proc. FOCLASA 2011, Pp 34-48 (2011)
This paper proposes a way to effectively compare the potential of processes to cause conflict. In discrete event systems theory, two concurrent systems are said to be in conflict if they can get trapped in a situation where they are both waiting or r
Externí odkaz:
https://doaj.org/article/c99c7772e799419c98a867407049f28b
Publikováno v:
Measurement + Control, Vol 36 (2003)
Externí odkaz:
https://doaj.org/article/5b8791418b1d4493ac6d7d679384270f
Publikováno v:
Measurement + Control, Vol 35 (2002)
Externí odkaz:
https://doaj.org/article/14d0d782126a4044bafaa474eb63aac4
Autor:
Simon Ware, Robi Malik
Publikováno v:
Discrete Event Dynamic Systems. 30:301-334
This paper describes algorithms to compute a counterexample when compositional nonblocking verification determines that a discrete event system is blocking. Counterexamples are an important feature of model checking that explains the cause of a detec
Publikováno v:
Transportation Research Part C: Emerging Technologies. 87:138-158
The performance and complicated interactions of different classes of travelers on regional urban networks are presented and analyzed. A new multi-class extension of a regional dynamic traffic model, the Network Transmission Model is proposed. The cla
Autor:
Simon Ware, Robi Malik
Publikováno v:
IFAC-PapersOnLine. 51:416-421
This paper describes algorithms to compute a counterexample when compositional nonblocking verification determines that a discrete event system is blocking. Counterexamples are an important feature of model checking that explains the cause of a detec
Publikováno v:
IFAC-PapersOnLine. 51:206-211
In this paper, we outline a method for carrying out efficient (max, +) matrix multiplication when using the heaps of pieces framework. We present an algorithm for multiplying an arbitrary m by r matrix X by a r by r heaps of pieces matrix M, making i
Publikováno v:
IEEE Transactions on Automatic Control. 62:5755-5768
In this work, a notion of reduction of distributions is proposed as a technical tool for improving the complexity of decomposability verification and supporting parallel verification of decomposability, by exploiting the rich structures of distributi
Autor:
Simon Ware, Rong Su
Publikováno v:
IEEE Transactions on Automation Science and Engineering. 14:772-784
The Ramadge–Wonham supervisory control paradigm has been shown effective in dealing with logic control. Nevertheless, time-related performance is always one of the major concerns in industry. Current methods for synthesizing time optimal supervisor