92 search results - page 6 / 19 » Decidable Reasoning over Timestamped Conceptual Models |
70
Voted
TIME
2003
IEEE
15 years 2 months ago
2003
IEEE
In bitemporal databases, current facts and transaction states are modelled using a special value to represent the current time (such as a minimum or maximum timestamp or NULL). Pr...
74
Voted
LPAR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
CSL
2006
Springer
14 years 9 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
FSTTCS
2003
Springer
15 years 2 months ago
2003
Springer
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
CONCUR
2010
Springer
14 years 10 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...