Sciweavers

71 search results - page 8 / 15
» A Calculus for Team Automata
Sort
View
LICS
2007
IEEE
14 years 1 months ago
Higher-Order Matching, Games and Automata
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
Colin Stirling
ENTCS
2006
161views more  ENTCS 2006»
13 years 7 months ago
Algebraic Specification and Coalgebraic Synthesis of Mealy Automata
We introduce the notion of functional stream derivative, generalising the notion of input derivative of rational expressions (Brzozowski 1964) to the case of stream functions over...
Jan J. M. M. Rutten
CADE
2007
Springer
14 years 7 months ago
An Incremental Technique for Automata-Based Decision Procedures
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
David Toman, Gulay Ünel
VMCAI
2010
Springer
14 years 2 months ago
Regular Linear Temporal Logic with Past
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
César Sánchez, Martin Leucker
CAV
2003
Springer
166views Hardware» more  CAV 2003»
14 years 21 days ago
Bridging the Gap between Fair Simulation and Trace Inclusion
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
Yonit Kesten, Nir Piterman, Amir Pnueli