Sciweavers

ASIAN
1998
Springer
111views Algorithms» more  ASIAN 1998»
14 years 3 months ago
A Comparison of Petri Net Semantics under the Collective Token Philosophy
In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities betwe...
Roberto Bruni, José Meseguer, Ugo Montanari...
ASIAN
1998
Springer
101views Algorithms» more  ASIAN 1998»
14 years 3 months ago
The Rewriting Calculus as a Semantics of ELAN
call it, provides abstraction through the rewriting arrow and explicit rule application. It also embeds the notion of sets of results to deal with non-deterministic computations. F...
Horatiu Cirstea, Claude Kirchner
ASIAN
1998
Springer
83views Algorithms» more  ASIAN 1998»
14 years 3 months ago
Rigid Reachability
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of ...
Harald Ganzinger, Florent Jacquemard, Margus Veane...
ASIAN
1998
Springer
118views Algorithms» more  ASIAN 1998»
14 years 3 months ago
Bisimulation Lattice of Chi Processes
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-...
Yuxi Fu
ASIAN
1998
Springer
99views Algorithms» more  ASIAN 1998»
14 years 3 months ago
Eventuality in LOTOS with a Disjunction Operator
LOTOS is a formal specification language, designed for the precise description of open distributed systems and protocols. Our purpose is to introduce the operators of logics (for e...
Yoshinao Isobe, Yutaka Sato, Kazuhito Ohmaki
APPROX
1998
Springer
150views Algorithms» more  APPROX 1998»
14 years 3 months ago
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
Vijay Kumar
ANTS
1998
Springer
139views Algorithms» more  ANTS 1998»
14 years 3 months ago
Generating Arithmetically Equivalent Number Fields with Elliptic Curves
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
Bart de Smit
ANTS
1998
Springer
112views Algorithms» more  ANTS 1998»
14 years 3 months ago
Unit Computation in Purely Cubic Function Fields of Unit Rank 1
Abstract. This paper describes a method for computing the fundamental unit and regulator of a purely cubic congruence function field of unit
Renate Scheidler, Andreas Stein
ANTS
1998
Springer
123views Algorithms» more  ANTS 1998»
14 years 3 months ago
Primality Proving Using Elliptic Curves: An Update
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...
François Morain
ANTS
1998
Springer
82views Algorithms» more  ANTS 1998»
14 years 3 months ago
Timing Analysis of Targeted Hunter Searches
John W. Jones, David P. Roberts