20126 search results - page 116 / 4026 » Timed Transition Systems |
111
click to vote
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...
RTSS
1989
IEEE
15 years 7 months ago
1989
IEEE
115
click to vote
RTA
2005
Springer
15 years 8 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
136
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
108
Voted
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...