Sciweavers

31 search results - page 3 / 7
» Non Interleaving Process Algebra
Sort
View
71
Voted
ENTCS
2007
111views more  ENTCS 2007»
14 years 9 months ago
Reversibility and Models for Concurrency
There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [2...
Iain Phillips, Irek Ulidowski
ENTCS
2007
126views more  ENTCS 2007»
14 years 9 months ago
Notes on Generative Probabilistic Bisimulation
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...
Simone Tini
FROCOS
2000
Springer
15 years 1 months ago
Non-Trivial Symbolic Computations in Proof Planning
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
Volker Sorge
87
Voted
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 2 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
COLING
1996
14 years 11 months ago
The Power of Words in Message Planning
Abstract: Before engaging in a conversation, a message must be planned. While there are many ways to perform this task, I believe that people do this in the following way, in parti...
Michael Zock