منابع مشابه
Linearity and Bisimulation
Exploiting linear type structure, we introduce a new theory of weak bisimilarity for the π-calculus in which we abstract away not only τ -actions but also non-τ actions which do not affect well-typed observers. This gives a congruence far larger than the standard bisimilarity while retaining semantic soundness. The framework is smoothly extendible to other settings involving nondeterminism and ...
متن کاملThe Aluffi Algebra and Linearity Condition
The Aluffi algebra is an algebraic version of characteristic cycles in intersection theory which is an intermediate graded algebra between the symmetric algebra (naive blowup) and the Rees algebra (blowup). Let R be a commutative Noetherian ring and J ⊂I ideals of R. We say that J ⊂I satisfy linearity condition if the Aluffi algebra of I/J is isomorphic with the symmetric algebra. In this pa...
متن کاملDistribution-based Bisimulation and Bisimulation Metric in Probabilistic Automata
Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equivalent if and only if they accept each word with the same probability. On the other side, in the process algebra community, probabilistic automata were re-proposed by Segala in 1995 which are more general than Rabin’s automata. Bisimulations have been proposed for Segala’s automata to characteriz...
متن کاملBisimulation and open maps
An abstract deenition of bisimulation is presented. It enables a uniform deenition of bisimulation across a range of diierent models for parallel computation presented as categories. As examples, transition systems, synchronisation trees, transition systems with independence (an abstraction from Petri nets) and labelled event structures are considered. On transition systems the abstract deeniti...
متن کاملLogic Programming and Bisimulation
The logic programming encoding of the set-theoretic graph property known as bisimulation is analyzed. This notion is of central importance in non-well-founded set theory, semantics of concurrency, model checking, and coinductive reasoning. From a modeling point of view, it is particularly interesting since it allows two alternative high-level characterizations. We analyze the encoding style of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2007
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2007.02.011