384 search results - page 15 / 77 » On the Semantics of Markov Automata |
111
click to vote
IANDC
2010
15 years 12 days ago
2010
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
136
Voted
CODES
2008
IEEE
15 years 3 months ago
2008
IEEE
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...
95
Voted
ICTAC
2004
Springer
15 years 7 months ago
2004
Springer
A switched probabilistic I/O automaton is a special kind of probabilistic I/O automaton (PIOA), enriched with an explicit mechanism to exchange control with its environment. Every ...
107
click to vote
ATVA
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets ex...
140
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...