Sciweavers

1071 search results - page 76 / 215
» The Calculus of Algebraic Constructions
Sort
View
APAL
2008
112views more  APAL 2008»
15 years 6 months ago
A domain model characterising strong normalisation
Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped -calculus with pattern matching and term rewriting which has the p...
Ulrich Berger
INFORMATICALT
2008
74views more  INFORMATICALT 2008»
15 years 6 months ago
Termination of Derivations in a Fragment of Transitive Distributed Knowledge Logic
A transitive distributed knowledge logic is considered. The considered logic S4nD is obtained from multi-modal logic S4n by adding transitive distributed knowledge operator. For a ...
Regimantas Pliuskevicius, Aida Pliuskeviciene
ENTCS
2007
96views more  ENTCS 2007»
15 years 6 months ago
Cryptographic Pattern Matching
We construct a language extension for process calculi for modelling the exchange of cryptographically composed data. More specifically, we devise a succinct syntax for terms and ...
Christoffer Rosenkilde Nielsen, Flemming Nielson, ...
ENTCS
2007
91views more  ENTCS 2007»
15 years 6 months ago
Timed Concurrent Constraint Programming for Analysing Biological Systems
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...
Julian Gutierrez, Jorge A. Pérez, Camilo Ru...
CMSB
2008
Springer
15 years 8 months ago
Compositional Definitions of Minimal Flows in Petri Nets
Abstract. This paper gives algebraic definitions for obtaining the minimal transition and place flows of a modular Petri net from the minimal transition and place flows of its comp...
Michael Pedersen