656 search results - page 45 / 132 » A Formalization of Transition P Systems |
112
Voted
SPIN
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...
100
Voted
FORMATS
2005
Springer
15 years 6 months ago
2005
Springer
We define quantitative similarity functions between timed transition systems that measure the degree of closeness of two systems as a real, in contrast to the traditional boolean ...
117
Voted
POPL
2012
ACM
13 years 8 months ago
2012
ACM
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
103
click to vote
PPSN
1992
Springer
15 years 4 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
139
click to vote
ECMDAFA
2009
Springer
15 years 7 months ago
2009
Springer
The need for a design language that is rigorous but accessible and intuitive is often at odds with the formal and mathematical nature of languages used for analysis. UML and Petri ...