Book ChapterDOI
Equivalence and Membership Problems for Regular Trace Languages
Alberto Bertoni,Alberto Bertoni,Giancarlo Mauri,Giancarlo Mauri,Nicoletta Sabadini +4 more
- Vol. 140, pp 61-71
Reads0
Chats0
TLDR
Award-winning author and researcher in Computer Science, site leader of Italian MIUR projects COFIN 1997, 1999, 2001 and member of the Organizing or Program Committees of national and international conferences.Abstract:
Biography Born in Lecco, September 3, 1956. Married, two children. Completed the degree in Physics at the University of Milan in 1980, with 110/110 cum laude. Researcher in Computer Science since 1983. Associate Professor since 1989. Full Professor in Computer Science since 1994. Member of the Organizing or Program Committees of national and international conferences. Site leader of Italian MIUR projects COFIN 1997, 1999, 2001.read more
Citations
More filters
Journal ArticleDOI
Heaps of Pieces, I: Basic Definitions and Combinatorial Lemmas
TL;DR: In this article, the authors introduce the combinatorial notion of heaps of pieces, which gives a geometric interpretation of the Cartier-Foata's commutation monoid, and show that heaps may bring new light on classical subjects as poset theory.
Book ChapterDOI
Basic notions of trace theory
TL;DR: The theory of traces can be used as a tool for reasoning about nets and it is hoped that applying this theory one can get a calculus of the concurrent processes analogous to that available for sequential systems.
Journal ArticleDOI
Theory of traces
TL;DR: Although traditionally most of the development in the theory of traces follows the string-language-theoretic line, it is demonstrated to the reader that the graph- theoretic point of view may be more appropriate.
Journal ArticleDOI
Characterizations of the decidability of some problems for regular trace languages
TL;DR: The decidability of the equivalence problem and the disjointness problem for regular trace languages is considered and precise characterizations are given of those concurrency alphabets for which these problems are decidable.
References
More filters
Book ChapterDOI
A decomposition theorem for partially ordered sets
TL;DR: In this article, a partially ordered set P is considered and two elements a and b of P are camparable if either a ≧ b or b ≧ a. If b and a are non-comparable, then they are independent.
Journal ArticleDOI
Concurrent Program Schemes and their Interpretations
TL;DR: It is shown that to each scheme corresponds a set of equations determining the result of the scheme; it is shown how these equations can be solved and that the solutions of these equations are regular trace languages.