Informatica

Conventional parking lots struggle to meet demand, prompting the rise of Fully Automated Parking Systems (FAPS), offering eco-friendly alternatives with advanced technology. However, operational challenges persist, especially in planning and scheduling. Real-time responsiveness necessitates dispatching rules and heuristics. This study comprehensively explores FAPS operational dynamics, assessing various rule combinations’ impact on customer wait times and system utilization. Utilizing a six-month MATLAB simulation, results favour the Nearest-Available-Slot (NAS) allocation rule coupled with First-Come-First-Served (FCFS) sequencing, emphasizing allocation’s pivotal role in system efficiency. Future research will refine allocation strategies to further optimize FAPS operational performance.

The result of simulation of an idealized thin wet film connecting fixed points in the Euclidean plane is a length-minimizing curve. Gradually increasing the exterior pressure we are able to achieve the film configuration near to the Steiner minimal tree. This film evolution may be an interesting tool for solving the Euclidean Steiner problem, but several dead-point situations may occur for a certain location of fixed points. A continuous evolution of the film is impossible by increasing the pressure in these situations. The investigation of dead-point situations gives the ways of overcoming the difficulties of dead-point situations and continuing the film evolution by temporarily decreasing pressure.

The Steiner problem asks for the shortest network that spans a given set of fixed points in the Euclidean plane. The problem is NP hard.

The paper deals with a simple model of the competition of two queuing systems, providing the same service. Each system may vary its service price and its service rate. The customers choose the system with less total service price, that depends on the waiting time and on the service price. The possibility for the existence of equilibrium is investigated. Simple cases are investigated analytically. It is shown that the Nash equilibrium exists in special cases only. A modification of the Stakelberg equilibrium is proposed as a model of competition with a prognosis. This prognosis helps form more stable prices and more stable strategies of competitors. The case of social economics is investigated, too. The dynamics of the competition of more realistic stochastic queuing systems is investigated by Monte Carlo simulation. The simulative analysis is realized by means of a rule-based simulation system.

The aggregate approach to the formal description, verification and simulation of computer network protocols is considered in the paper. With this approach, the offered design stages can be performed using a single mathematical scheme. The reachability analysis method and the program proof technique are viewed as methods for correctness analysis. The proposed approach for correctness analysis and model construction was used in creating the protocol analysis system PRANAS.