Regular model checking with regular relations
From MaRDI portal
Publication:2140498
DOI10.1007/978-3-030-86593-1_13OpenAlexW3200738436MaRDI QIDQ2140498FDOQ2140498
Authors: Vrunda Dave, Taylor Dohmen, Shankara Narayanan Krishna, Ashutosh Trivedi 
Publication date: 20 May 2022
Full work available at URL: https://arxiv.org/abs/1910.09072
Cites Work
- Elements of automata theory. Translated from the French by Reuben Thomas
- Regular model checking using widening techniques
- Iterating transducers in the large (extended abstract)
- Graph structure and monadic second-order logic. A language-theoretic approach
- Monadic second-order definable graph transductions: a survey
- Expressiveness of streaming string transducers
- Nondeterministic Streaming String Transducers
- Sur les rélations rationnelles entre monoides libres
- Title not available (Why is that?)
- Computer Aided Verification
- Computer Aided Verification
- Symbolic model checking with rich assertional languages
- CONCUR 2004 - Concurrency Theory
- Regular model checking using inference of regular languages
- Handling liveness properties in (\(\omega\)-)regular model checking
- Title not available (Why is that?)
- Title not available (Why is that?)
- An effective decision procedure for linear arithmetic over the integers and reals
- Title not available (Why is that?)
- MSO definable string transductions and two-way finite-state transducers
- Tools and Algorithms for the Construction and Analysis of Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular transformations of infinite strings
- Regular Real Analysis
- On (omega-)regular model checking
- Why These Automata Types?
Cited In (1)
This page was built for publication: Regular model checking with regular relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140498)
