Sciweavers

15 search results - page 2 / 3
» Concepts of Automata Construction from LTL
Sort
View
ATVA
2006
Springer
112views Hardware» more  ATVA 2006»
13 years 9 months ago
Synthesis for Probabilistic Environments
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
Sven Schewe
VMCAI
2007
Springer
13 years 11 months ago
Lattice Automata
Abstract. Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a B...
Orna Kupferman, Yoad Lustig
ICALP
2009
Springer
14 years 5 months ago
On Regular Temporal Logics with Past,
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange
ENTCS
2010
136views more  ENTCS 2010»
13 years 2 months ago
A Solver for Modal Fixpoint Logics
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
Oliver Friedmann, Martin Lange
ALIFE
2005
13 years 5 months ago
Material Representations: From the Genetic Code to the Evolution of Cellular Automata
We present a new definition of the concept of representation for cognitive science that is based on a study of the origin of structures that are used to store memory in evolving sy...
Luis Mateus Rocha, Wim Hordijk