327 search results - page 43 / 66 » A Theory of Information-Flow Labels |
FATES
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
70
Voted
FOSSACS
2000
Springer
15 years 1 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
103
click to vote
ACSD
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
GG
2008
Springer
14 years 10 months ago
2008
Springer
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
ENTCS
2006
14 years 9 months ago
2006
The article introduces an extension of the well-known conformance relation ioco on labeled transition systems (LTS) with refused inputs and forbidden actions. This extension helps...