TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publications
  4. A model template for reachability-based containment checking of imprecise observations in timed automata
 
Options

A model template for reachability-based containment checking of imprecise observations in timed automata

Citation Link: https://doi.org/10.15480/882.13769
Publikationstyp
Journal Article
Date Issued
2025-04
Sprache
English
Author(s)
Lehmann, Sascha 
Softwaresysteme E-16  
Schupp, Sibylle  
Softwaresysteme E-16  
TORE-DOI
10.15480/882.13769
TORE-URI
https://hdl.handle.net/11420/52210
Journal
Software and systems modeling  
Volume
24
Issue
2
Citation
Software and Systems Modeling 24 (2): 411-444 (2025)
Publisher DOI
10.1007/s10270-024-01205-w
Scopus ID
2-s2.0-105004027965
Publisher
Springer
Verifying safety requirements by model checking becomes increasingly important for safety-critical applications. For the validity of such proof in practice, the model needs to capture the actual behavior of the real system, which could be tested by containment checks of real observation traces. Basic equivalence checks, however, are not applicable if the system is only partially or imprecisely observable, if the model abstracts from explicit states with symbolic semantics, or if the checks are not expressible in the logics supported by a model checker. In this article, we solve the problem of observation containment checking in timed automata via reachability checking on tester systems. We introduce the logic SRL (sequence reachability logic) to express observations as sequences of delayed reachability properties. Through SBLL (introduced by Aceto et al.) as intermediate logic, we synthesize a set of matcher model templates for partial and imprecise observations and further extend these templates for the case of limited state accessibility in a model. For the obtained matching traces, we define the back-transformation into the original model domain and formally prove the correctness of the transformation. We implemented the observation matching approach, and apply it to a set of 7 demo and 3 case study models with different levels of observability. The results show that all positive and negative observations are correctly classified, and that the most advanced matcher model instance still offers average run times between 0.1 and 1 s in all but 3 scenarios.
Subjects
Containment checking | Model transformation | Observation matching | Reachability problem | Timed automata
DDC Class
004: Computer Sciences
620: Engineering
519: Applied Mathematics, Probabilities
Funding(s)
Projekt DEAL  
Publication version
publishedVersion
Lizenz
https://creativecommons.org/licenses/by/4.0/
Loading...
Thumbnail Image
Name

s10270-024-01205-w.pdf

Type

Main Article

Size

1.93 MB

Format

Adobe PDF

TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback