Sciweavers

Share
FOSSACS
2008
Springer

Symbolic Semantics Revisited

8 years 12 months ago
Symbolic Semantics Revisited
Abstract. Symbolic bisimulations were introduced as a mean to define value-passing process calculi using smaller, possibly finite labelled transition systems, equipped with symbolic actions. Similar ideas have been used for modeling with fewer transitions the input behavior of open and asynchronous -calculus. In this paper we generalize the symbolic technique and apply the resulting theory to these two cases, re-deriving existing results. We also apply our approach to a new setting, i.e. open Petri nets, with the usual result of reducing input transitions. Our theory generalizes Leifer and Milner reactive systems by adding observations.
Filippo Bonchi, Ugo Montanari
Added 26 Oct 2010
Updated 26 Oct 2010
Type Conference
Year 2008
Where FOSSACS
Authors Filippo Bonchi, Ugo Montanari
Comments (0)
books