258 search results - page 12 / 52 » Hybrid Logics on Linear Structures: Expressivity and Complex... |
113
Voted
DEDS
1998
14 years 11 months ago
1998
In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in de...
106
click to vote
CONEXT
2007
ACM
15 years 3 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
HYBRID
2010
Springer
14 years 9 months ago
2010
Springer
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
103
click to vote
NJC
2000
14 years 11 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
114
click to vote
LICS
1999
IEEE
15 years 4 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...