Church synthesis on register automata over linearly ordered data domains
Authors:
- 1 December 2022
- journal article
- research article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 61 (2-3) , 290-337
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Fonds De La Recherche Scientifique - FNRS (F451019F)
- Icelandic Centre for Research (217987-051)
This publication has 41 references indexed in Scilit:
- Parameterized Verification of Broadcast Networks of Register AutomataLecture Notes in Computer Science, 2013
- Two-Variable Logic with Two Order RelationsLogical Methods in Computer Science, 2012
- Weak MSO with the Unbounding QuantifierTheory of Computing Systems, 2010
- LTL with the freeze quantifier and register automataACM Transactions on Computational Logic, 2009
- An automata-theoretic approach to constraint LTLInformation and Computation, 2007
- Automatic verification of recursive procedures with one integer parameterTheoretical Computer Science, 2003
- Verifying linear temporal properties of data insensitive controllers using finite instantiations1997
- Finite-memory automataTheoretical Computer Science, 1994
- Solving sequential conditions by finite-state strategiesTransactions of the American Mathematical Society, 1969
- Computation: Finite and Infinite Machines.The American Mathematical Monthly, 1968