154
click to vote
CALCO
2015
Springer
10 years 1 months ago
2015
Springer
We propose a generalization of higher-dimensional automata, partial HDA. Unlike HDA, and also extending event structures and Petri nets, partial HDA can model phenomena such as pr...
137
click to vote
CALCO
2015
Springer
10 years 1 months ago
2015
Springer
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algeb...
141
click to vote
CALCO
2015
Springer
10 years 1 months ago
2015
Springer
Models of concurrent systems employ a wide variety of semantics inducing various notions of process equivalence, ranging from linear-time semantics such as trace equivalence to br...
117
click to vote
CALCO
2015
Springer
10 years 1 months ago
2015
Springer
We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of ...