Sciweavers

349 search results - page 2 / 70
» The Finite and the Infinite
Sort
View
JUCS
2010
124views more  JUCS 2010»
13 years 3 months ago
Finding a Consistent Scenario to an Interval Algebra Network Containing Possibly Infinite Intervals
: Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infini...
André Trudel
AWPN
2008
249views Algorithms» more  AWPN 2008»
13 years 6 months ago
Towards Synthesis of Petri Nets from General Partial Languages
In this paper we investigate synthesis of place/transition Petri nets from three different finite representations of infinite partial languages, generalizing previous results.
Robert Lorenz
ECAI
2010
Springer
13 years 3 months ago
LTL Goal Specifications Revisited
The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the seman...
Andreas Bauer 0002, Patrik Haslum
JGT
2008
105views more  JGT 2008»
13 years 5 months ago
The bond and cycle spaces of an infinite graph
Bonnington and Richter defined the cycle space of an infinite graph to consist of the sets of edges of subgraphs having even degree at every vertex. Diestel and K
Karel Casteels, R. Bruce Richter
CONCUR
2006
Springer
13 years 9 months ago
On Finite Alphabets and Infinite Bases III: Simulation
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
Taolue Chen, Wan Fokkink