Network invariants for real-time systems
From MaRDI portal
Publication:1019007
DOI10.1007/S00165-008-0089-0zbMath1163.68326OpenAlexW2008237330MaRDI QIDQ1019007
Olga Grinchtein, Martin Leucker
Publication date: 27 May 2009
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-008-0089-0
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (3)
Learning of event-recording automata ⋮ Active learning of timed automata with unobservable resets ⋮ Generating models of infinite-state communication protocols using regular inference with abstraction
Cites Work
- The existence of refinement mappings
- A theory of timed automata
- Model checking of systems with many identical timed processes
- Control and data abstraction: The cornerstones of practical formal verification
- A structural induction theorem for processes
- Abstraction and Refinement in Model Checking
- Inferring Network Invariants Automatically
- Automatic verification of parameterized networks of processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Network invariants for real-time systems