1000 search results - page 33 / 200 » Nominal rewriting systems |
RTA
1995
Springer
13 years 11 months ago
1995
Springer
In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable...
TCS
2002
13 years 7 months ago
2002
This paper explores the application of rewriting logic to the executable formal modeling of real-time and hybrid systems. We give general techniques by which such systems can be s...
FSTTCS
1998
Springer
13 years 11 months ago
1998
Springer
In [NO88], a particular trace monoid M is constructed such that for the class of length
CONCUR
2003
Springer
14 years 24 days ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
CONCUR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...