{"title":"公共交通网络空间可达性规范的模型检查","authors":"Jun Niu , Jia Wang","doi":"10.1016/j.simpat.2024.103033","DOIUrl":null,"url":null,"abstract":"<div><div>Well-designed spatial configurations of public transport stops and routes in big cities contribute to enhancing daily travel services for citizens, effectively mitigating traffic congestion, and addressing other pertinent challenges. When examining spatial layouts of public transport networks (PTNs), various reachability demands between stops or urban Points of Interest (POIs) are crucial issues should be firstly taken into account. Existing methods to investigate spatial reachability properties of PTNs generally need to construct some evaluation functions, or survey reachability metrics through some network analysis techniques. These methods are often impractical, as the functional relations always cannot be accurately defined, or some global network metrics cannot provide explicit evidences for PTN layout planning or optimization.</div><div>In this paper, we introduce spatial model checking techniques to the formal verification of the reachability specifications of PTN to guarantee the rationality of PTN layout. First, we extend closure space structure by incorporating attribute labeling functions and logical propositions for public transport stops and routes to develop a formal spatial verification model for PTN spatial layout. Second, we propose several novel reachability operators based on the logical operators of the Spatial Logic for Closure Space (SLCS) to facilitate the logical characterization of reachability specifications. Third, we perform the verification of the transformed reachability formulas by the spatial model checker topochecker. Examples demonstrate the effectiveness of our approach and indicate that it can perform automatic, descriptive and comprehensible verification of the reachability properties PTN layouts.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103033"},"PeriodicalIF":3.5000,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Model checking spatial reachability specifications of public transport networks\",\"authors\":\"Jun Niu , Jia Wang\",\"doi\":\"10.1016/j.simpat.2024.103033\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Well-designed spatial configurations of public transport stops and routes in big cities contribute to enhancing daily travel services for citizens, effectively mitigating traffic congestion, and addressing other pertinent challenges. When examining spatial layouts of public transport networks (PTNs), various reachability demands between stops or urban Points of Interest (POIs) are crucial issues should be firstly taken into account. Existing methods to investigate spatial reachability properties of PTNs generally need to construct some evaluation functions, or survey reachability metrics through some network analysis techniques. These methods are often impractical, as the functional relations always cannot be accurately defined, or some global network metrics cannot provide explicit evidences for PTN layout planning or optimization.</div><div>In this paper, we introduce spatial model checking techniques to the formal verification of the reachability specifications of PTN to guarantee the rationality of PTN layout. First, we extend closure space structure by incorporating attribute labeling functions and logical propositions for public transport stops and routes to develop a formal spatial verification model for PTN spatial layout. Second, we propose several novel reachability operators based on the logical operators of the Spatial Logic for Closure Space (SLCS) to facilitate the logical characterization of reachability specifications. Third, we perform the verification of the transformed reachability formulas by the spatial model checker topochecker. Examples demonstrate the effectiveness of our approach and indicate that it can perform automatic, descriptive and comprehensible verification of the reachability properties PTN layouts.</div></div>\",\"PeriodicalId\":49518,\"journal\":{\"name\":\"Simulation Modelling Practice and Theory\",\"volume\":\"138 \",\"pages\":\"Article 103033\"},\"PeriodicalIF\":3.5000,\"publicationDate\":\"2024-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Simulation Modelling Practice and Theory\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1569190X24001473\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Simulation Modelling Practice and Theory","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1569190X24001473","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Model checking spatial reachability specifications of public transport networks
Well-designed spatial configurations of public transport stops and routes in big cities contribute to enhancing daily travel services for citizens, effectively mitigating traffic congestion, and addressing other pertinent challenges. When examining spatial layouts of public transport networks (PTNs), various reachability demands between stops or urban Points of Interest (POIs) are crucial issues should be firstly taken into account. Existing methods to investigate spatial reachability properties of PTNs generally need to construct some evaluation functions, or survey reachability metrics through some network analysis techniques. These methods are often impractical, as the functional relations always cannot be accurately defined, or some global network metrics cannot provide explicit evidences for PTN layout planning or optimization.
In this paper, we introduce spatial model checking techniques to the formal verification of the reachability specifications of PTN to guarantee the rationality of PTN layout. First, we extend closure space structure by incorporating attribute labeling functions and logical propositions for public transport stops and routes to develop a formal spatial verification model for PTN spatial layout. Second, we propose several novel reachability operators based on the logical operators of the Spatial Logic for Closure Space (SLCS) to facilitate the logical characterization of reachability specifications. Third, we perform the verification of the transformed reachability formulas by the spatial model checker topochecker. Examples demonstrate the effectiveness of our approach and indicate that it can perform automatic, descriptive and comprehensible verification of the reachability properties PTN layouts.
期刊介绍:
The journal Simulation Modelling Practice and Theory provides a forum for original, high-quality papers dealing with any aspect of systems simulation and modelling.
The journal aims at being a reference and a powerful tool to all those professionally active and/or interested in the methods and applications of simulation. Submitted papers will be peer reviewed and must significantly contribute to modelling and simulation in general or use modelling and simulation in application areas.
Paper submission is solicited on:
• theoretical aspects of modelling and simulation including formal modelling, model-checking, random number generators, sensitivity analysis, variance reduction techniques, experimental design, meta-modelling, methods and algorithms for validation and verification, selection and comparison procedures etc.;
• methodology and application of modelling and simulation in any area, including computer systems, networks, real-time and embedded systems, mobile and intelligent agents, manufacturing and transportation systems, management, engineering, biomedical engineering, economics, ecology and environment, education, transaction handling, etc.;
• simulation languages and environments including those, specific to distributed computing, grid computing, high performance computers or computer networks, etc.;
• distributed and real-time simulation, simulation interoperability;
• tools for high performance computing simulation, including dedicated architectures and parallel computing.