434 search results - page 10 / 87 » Structural Operational Semantics for Weighted Transition Sys... |
ENTCS
2006
15 years 3 months ago
2006
We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of ...
125
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
145
click to vote
HYBRID
1997
Springer
15 years 7 months ago
1997
Springer
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode an algebraic or di erential equation for each state variable in ...
114
click to vote
ASE
2008
15 years 3 months ago
2008
Goal-oriented methods are increasingly popular for elaborating software requirements. They offer systematic support for incrementally building intentional, structural, and operati...
148
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...