Sciweavers

44 search results - page 3 / 9
» A Fully Abstract Semantics for Concurrent Graph Reduction
Sort
View
BIRTHDAY
2005
Springer
15 years 3 months ago
Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...
Fabio Gadducci, Ugo Montanari
EURODAC
1994
IEEE
129views VHDL» more  EURODAC 1994»
15 years 1 months ago
A general state graph transformation framework for asynchronous synthesis
Abstract -- A general framework for synthesis of asynchronous control circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well a...
Bill Lin, Chantal Ykman-Couvreur, Peter Vanbekberg...
ESOP
2008
Springer
14 years 11 months ago
Open Bisimulation for the Concurrent Constraint Pi-Calculus
Abstract. The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding Service Level Agreements. The cc-pi calculus combines the synchronous...
Maria Grazia Buscemi, Ugo Montanari
92
Voted
FM
2009
Springer
134views Formal Methods» more  FM 2009»
14 years 7 months ago
Partial Order Reductions Using Compositional Confluence Detection
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
Frédéric Lang, Radu Mateescu
114
Voted
POPL
1992
ACM
15 years 1 months ago
Abstract Semantics for a Higher-Order Functional Language with Logic Variables
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
Radha Jagadeesan, Keshav Pingali