Results 1  10
of
235
A completeness theorem for Kleene algebras and the algebra of regular events
 Information and Computation
, 1994
"... We givea nitary axiomatization of the algebra of regular events involving only equations and equational implications. Unlike Salomaa's axiomatizations, the axiomatization given here is sound for all interpretations over Kleene algebras. 1 ..."
Abstract

Cited by 250 (28 self)
 Add to MetaCart
We givea nitary axiomatization of the algebra of regular events involving only equations and equational implications. Unlike Salomaa's axiomatizations, the axiomatization given here is sound for all interpretations over Kleene algebras. 1
Behavioural Theories
 In Recent Trends in Data Type Specification
, 1995
"... Behavioural theories are a generalization of standard theories where the equality predicate is interpreted by an arbitrary (possibly partial) congruence relation, called behavioural equality. In this paper we first show how to reduce the behavioural theory of any class C of algebras to (a subset of ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
of) the standard theory of some corresponding class of algebras. Then we consider infinitary axiomatizations of the behavioural equality and we define a general condition under which the in nitary axiomatization can be replaced by a finitary one. As a consequence, behav...
An Axiomatic Approach to Adequacy
 University of Aarhus
, 1996
"... is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Dissertation Series. Copies may be obtained by contacting: BRICS ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Dissertation Series. Copies may be obtained by contacting: BRICS
An axiomatic semantics for Esterel
"... In this paper we propose an axiomatic semantics for the synchronous language Esterel. We begin with giving a structural operational semantics for Esterel in terms of a labeled transition system (LTS). We prove that bisimulation on LTS states (which correspond to Esterel programs) is a congruence and ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we propose an axiomatic semantics for the synchronous language Esterel. We begin with giving a structural operational semantics for Esterel in terms of a labeled transition system (LTS). We prove that bisimulation on LTS states (which correspond to Esterel programs) is a congruence
The polyadic πcalculus: a tutorial
 LOGIC AND ALGEBRA OF SPECIFICATION
, 1991
"... The πcalculus is a model of concurrent computation based upon the notion of naming. It is first presented in its simplest and original form, with the help of several illustrative applications. Then it is generalized from monadic to polyadic form. Semantics is done in terms of both a reduction syste ..."
Abstract

Cited by 186 (1 self)
 Add to MetaCart
system and a version of labelled transitions called commitment; the known algebraic axiomatization of strong bisimilarity isgiven in the new setting, and so also is a characterization in modal logic. Some theorems about the replication operator are proved. Justification for the polyadic form is provided
A Complete Axiomatization of HigherOrder Intuitionistic Logic
 CLE ePrints
, 2001
"... Two Hilbert calculi for higherorder logic (or theory of types) are introduced. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Two Hilbert calculi for higherorder logic (or theory of types) are introduced.
A Hilbertstyle axiomatization of higherorder intuitionistic logic
"... Two Hilbert calculi for higherorder logic (or theory of types) are introduced. ..."
Abstract
 Add to MetaCart
Two Hilbert calculi for higherorder logic (or theory of types) are introduced.
Decidable Fragments of FirstOrder Temporal Logics
, 1999
"... In this paper, we introduce a new fragment of the firstorder temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time ..."
Abstract

Cited by 96 (27 self)
 Add to MetaCart
In this paper, we introduce a new fragment of the firstorder temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical firstorder logic. This reduction is then used to single out a number of decidable fragments of firstorder temporal logics and of twosorted firstorder logics in which one sort is intended for temporal reasoning. Besides standard firstorder time structures, we consider also those that have only finite firstorder domains, and extend the results mentioned above to temporal logics of finite domains. We prove decidability in three different ways: using decidability of monadic secondorder logic over the intended flows of time, by an explicit analysis of structures with natural numbers time, and by a composition m...
Results 1  10
of
235