Representation of computations in concurrent automata by dependence orders
F Bracho, M Droste, D Kuske - Theoretical Computer Science, 1997 - Elsevier
An automaton with concurrency relations A is a labelled transition system with a collection of
binary relations indicating when two actions in a given state of the automaton can occur …
binary relations indicating when two actions in a given state of the automaton can occur …
[PS][PS] Measurement and Approximation of Infinite Structures via Tolerance Spaces
For convenience of the reader, we start with a general overview of the content of this thesis.
In Chapter 2, we motivate the notion of tolerance space by using some examples coming …
In Chapter 2, we motivate the notion of tolerance space by using some examples coming …
[引用][C] l'UNIVERSITE de RENNES I Institut de Formation Superieure en Informatique et Communication
RF DE COMPORTEMENTS - 1997 - Universite de Rennes I