4 search results - page 1 / 1 » Combinatorics of labelling in higher-dimensional automata |
CORR
1999
Springer
13 years 5 months ago
1999
Springer
ABSTRACT. We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combi...
TCS
2010
13 years 20 hour ago
2010
The main idea for interpreting concurrent processes as labelled precubical sets is that a given set of n actions running concurrently must be assembled to a labelled ncube, in exac...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
CONCUR
2005
Springer
13 years 10 months ago
2005
Springer
Starting from the opinion that the standard firing rule of Petri nets embodies the collective token interpretation of nets rather than their individual token interpretation, I pro...