Simulation relations and applications in formal methods
From MaRDI portal
Publication:6113980
DOI10.1007/978-3-031-22337-2_13zbMath1528.68188OpenAlexW4312254064MaRDI QIDQ6113980
Kim Guldstrand Larsen, Christian Schilling, Jiří Srba
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22337-2_13
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The existence of refinement mappings
- On determinism in modal transition systems
- Approximate simulation relations for hybrid systems
- Approximate equivalence and synchronization of metric transition systems
- Approximately bisimilar symbolic models for nonlinear control systems
- What's decidable about hybrid automata?
- A theory of timed automata
- Property preserving abstractions for the verification of concurrent systems
- Time-abstracted bisimulation: Implicit specifications and decidability
- From bisimulation to simulation: Coarsest partition problems
- Process rewrite systems.
- Fair simulation
- Uppaal in a nutshell
- Transformational design and implementation of a new efficient solution to the ready simulation problem
- Taylor approximation for hybrid systems
- Abstractions for hybrid systems
- Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
- Advanced automata minimization
- CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
- Büchi Automata Can Have Smaller Quotients
- Equivalence-Checking with Infinite-State Systems: Techniques and Results
- Parametric Modal Transition Systems
- Abstraction and Abstraction Refinement
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT
- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
- On Modal Refinement and Consistency
- Undecidability of bisimilarity by defender's forcing
- From timed automata to logic — and back
- Visibly pushdown languages
- Beyond Language Equivalence on Visibly Pushdown Automata
- Three Partition Refinement Algorithms
- Minimal NFA Problems are Hard
- Algorithmic analysis of nonlinear hybrid systems
- Infinite Games
- Hybrid automata with finite bisimulations
- On the Ehrenfeucht-Fraïssé game in theoretical computer science
- A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
- EXPTIME-complete Decision Problems for Modal and Mixed Specifications
- Approximation Metrics for Discrete and Continuous Systems
- Reactive Systems
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- The algorithmics of bisimilarity
- Complexity of Decision Problems for Mixed and Modal Specifications
- FDR3 — A Modern Refinement Checker for CSP
- Minimizing Generalized Büchi Automata
- CONCUR 2005 – Concurrency Theory
- Infinite results
- State equivalences for rectangular hybrid automata
This page was built for publication: Simulation relations and applications in formal methods
