Sciweavers

IANDC
2010
78views more  IANDC 2010»
13 years 9 months ago
An efficient simulation algorithm based on abstract interpretation
Francesco Ranzato, Francesco Tapparo
IANDC
2010
87views more  IANDC 2010»
13 years 9 months ago
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
We consider the dynamical behavior of Martin-L
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
IANDC
2010
105views more  IANDC 2010»
13 years 10 months ago
Symmetries, local names and dynamic (de)-allocation of names
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...
Vincenzo Ciancia, Ugo Montanari
IANDC
2010
151views more  IANDC 2010»
13 years 10 months ago
Complete sets of cooperations
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well-known but commonly elided. In this paper we argue that any such concrete re...
Clemens Kupke, Jan J. M. M. Rutten
IANDC
2010
102views more  IANDC 2010»
13 years 10 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan
IANDC
2010
119views more  IANDC 2010»
13 years 10 months ago
Cut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Dirk Pattinson, Lutz Schröder
IANDC
2010
68views more  IANDC 2010»
13 years 10 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr
IANDC
2010
79views more  IANDC 2010»
13 years 10 months ago
Complexity of deciding bisimilarity between normed BPA and normed BPP
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
Petr Jancar, Martin Kot, Zdenek Sawa
IANDC
2010
125views more  IANDC 2010»
13 years 10 months ago
Continuation semantics for the Lambek-Grishin calculus
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
Raffaella Bernardi, Michael Moortgat
IANDC
2010
141views more  IANDC 2010»
13 years 10 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner