74 search results - page 7 / 15 » Concurrent Semantics Without the Notions of State or State T... |
IFIP
1992
Springer
13 years 11 months ago
1992
Springer
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
CHARME
2003
Springer
14 years 21 days ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
CONCUR
2003
Springer
14 years 21 days ago
2003
Springer
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
LICS
1998
IEEE
13 years 11 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...