Verification complexity of a class of observational properties for modular discrete events systems

Automatica ◽  
2017 ◽  
Vol 83 ◽  
pp. 199-205 ◽  
Author(s):  
Xiang Yin ◽  
Stéphane Lafortune
Keyword(s):  
Discrete Events ◽  
Discrete Events Systems

Decision making at unsignalized inner city intersections using discrete events systems

2022 ◽  
Vol 0 (0) ◽  
Author(s):  
Hannes Weinreuter ◽  
Balázs Szigeti ◽  
Nadine-Rebecca Strelau ◽  
Barbara Deml ◽  
Michael Heizmann
Keyword(s):  
Inner City ◽  
Road Safety ◽  
Autonomous Vehicles ◽  
Discrete Event ◽  
Autonomous Driving ◽  
Simulation Environment ◽  
Discrete Events ◽  
Real World Data ◽  
Event System ◽  
Discrete Events Systems

Abstract Autonomous driving is a promising technology to, among many aspects, improve road safety. There are however several scenarios that are challenging for autonomous vehicles. One of these are unsignalized junctions. There exist scenarios in which there is no clear regulation as to is allowed to drive first. Instead, communication and cooperation are necessary to solve such scenarios. This is especially challenging when interacting with human drivers. In this work we focus on unsignalized T-intersections. For that scenario we propose a discrete event system (DES) that is able to solve the cooperation with human drivers at a T-intersection with limited visibility and no direct communication. The algorithm is validated in a simulation environment, and the parameters for the algorithm are based on an analysis of typical human behavior at intersections using real-world data.

An architecture for control and monitoring of discrete events systems

1998 ◽  
Vol 36 (1-2) ◽  
pp. 95-100 ◽  
Author(s):  
E Zamaı̈ ◽  
A Chaillet-Subias ◽  
M Combacau
Keyword(s):  
Discrete Events ◽  
Discrete Events Systems

scholarly journals Strong Tolerance and Strong Universality of Interval Eigenvectors in a Max-Łukasiewicz Algebra

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1504
Author(s):  
Martin Gavalec ◽  
Zuzana Němcová ◽  
Ján Plavka
Keyword(s):  
Set Theory ◽  
Binary Operation ◽  
Sufficient Conditions ◽  
Discrete Events ◽  
Linear Combinations ◽  
Main Method ◽  
Max Algebra ◽  
Discrete Events Systems ◽  
Necessary And Sufficient ◽  
Theoretical Results

The Łukasiewicz conjunction (sometimes also considered to be a logic of absolute comparison), which is used in multivalued logic and in fuzzy set theory, is one of the most important t-norms. In combination with the binary operation ‘maximum’, the Łukasiewicz t-norm forms the basis for the so-called max-Łuk algebra, with applications to the investigation of systems working in discrete steps (discrete events systems; DES, in short). Similar algebras describing the work of DES’s are based on other pairs of operations, such as max-min algebra, max-plus algebra, or max-T algebra (with a given t-norm, T). The investigation of the steady states in a DES leads to the study of the eigenvectors of the transition matrix in the corresponding max-algebra. In real systems, the input values are usually taken to be in some interval. Various types of interval eigenvectors of interval matrices in max-min and max-plus algebras have been described. This paper is oriented to the investigation of strong, strongly tolerable, and strongly universal interval eigenvectors in a max-Łuk algebra. The main method used in this paper is based on max-Ł linear combinations of matrices and vectors. Necessary and sufficient conditions for the recognition of strong, strongly tolerable, and strongly universal eigenvectors have been found. The theoretical results are illustrated by numerical examples.

Sign in / Sign up

Export Citation Format

Share Document