Regular model checking with regular relations
From MaRDI portal
Publication:2140498
Cites work
- scientific article; zbMATH DE number 1670791 (Why is no real title available?)
- scientific article; zbMATH DE number 1538041 (Why is no real title available?)
- scientific article; zbMATH DE number 1796140 (Why is no real title available?)
- scientific article; zbMATH DE number 2090515 (Why is no real title available?)
- scientific article; zbMATH DE number 7168153 (Why is no real title available?)
- scientific article; zbMATH DE number 7058469 (Why is no real title available?)
- An effective decision procedure for linear arithmetic over the integers and reals
- CONCUR 2004 - Concurrency Theory
- Computer Aided Verification
- Computer Aided Verification
- Elements of automata theory. Translated from the French by Reuben Thomas
- Expressiveness of streaming string transducers
- Graph structure and monadic second-order logic. A language-theoretic approach
- Handling liveness properties in (\(\omega\)-)regular model checking
- Iterating transducers in the large (extended abstract)
- MSO definable string transductions and two-way finite-state transducers
- Monadic second-order definable graph transductions: a survey
- Nondeterministic Streaming String Transducers
- On (omega-)regular model checking
- Regular Real Analysis
- Regular model checking using inference of regular languages
- Regular model checking using widening techniques
- Regular transformations of infinite strings
- Sur les rélations rationnelles entre monoides libres
- Symbolic model checking with rich assertional languages
- Tools and Algorithms for the Construction and Analysis of Systems
- Why These Automata Types?
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)
