Sciweavers

50 search results - page 8 / 10
» A Behavioural Pseudometric for Metric Labelled Transition Sy...
Sort
View
APLAS
2007
ACM
13 years 10 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
MPC
2010
Springer
181views Mathematics» more  MPC 2010»
13 years 11 months ago
Process Algebras for Collective Dynamics
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
Jane Hillston
MEMOCODE
2008
IEEE
14 years 29 days ago
Bisimulator 2.0: An On-the-Fly Equivalence Checker based on Boolean Equation Systems
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
Radu Mateescu, Emilie Oudot
ACSD
1998
IEEE
121views Hardware» more  ACSD 1998»
13 years 11 months ago
Identifying State Coding Conflicts in Asynchronous System Specifications Using Petri Net Unfoldings
State coding conflict detection is a fundamental part of synthesis of asynchronous concurrent systems from their specifications as Signal Transition Graphs (STGs), which are a spe...
Alex Kondratyev, Jordi Cortadella, Michael Kishine...
CL
2000
Springer
13 years 10 months ago
Concurrent Constraint Programming with Process Mobility
Abstract. We propose an extension of concurrent constraint programming with primitives for process migration within a hierarchical network, and we study its semantics. To this purp...
David Gilbert, Catuscia Palamidessi