289 search results - page 32 / 58 » Regular Linear Temporal Logic |
127
click to vote
CONCUR
1999
Springer
15 years 8 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
136
click to vote
AICOM
2010
15 years 4 months ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
152
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...
143
click to vote
CONCUR
2010
Springer
15 years 5 months ago
2010
Springer
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
113
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...