SMT-based generation of symbolic automata
From MaRDI portal
Publication:2182674
DOI10.1007/s00236-020-00367-6zbMath1443.68114OpenAlexW3021455043MaRDI QIDQ2182674
Simon Bliudze, Zechen Hou, Xudong Qin, Eric Madelaine, Min Zhang, Yu-xin Deng
Publication date: 26 May 2020
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-020-00367-6
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symbolic bisimulations
- A general framework for architecture composability
- Calculi for synchrony and asynchrony
- Higher-level synchronising devices in Meije-SCCS
- A context dependent equivalence between processes
- Bisimulations for a calculus of broadcasting systems
- Bisimilarity of open terms.
- Integration of SMT-solvers in B and Event-B development environments
- Infinite-state invariant checking with IC3 and predicate abstraction
- A Theory for the Composition of Concurrent Processes
- Bisimulation by Unification*
- A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses
- Towards SMT Model Checking of Array-Based Systems
- Compositionality Through an Operational Semantics of Contexts
- The Algebra of Connectors—Structuring Interaction in BIP
- Parameterized Systems in BIP: Design and Model Checking
- SMT-based verification of data-aware processes: a model-theoretic approach
- Symbolic Bisimulation for Quantum Processes
- Well-structured transition systems everywhere!
- Causal semantics for the algebra of connectors
- Symbolic transition graph with assignment
This page was built for publication: SMT-based generation of symbolic automata
