Sciweavers

4460 search results - page 348 / 892
» Formal methods for interactive systems
Sort
View
AISC
2008
Springer
15 years 8 months ago
Extending Graphical Representations for Compact Closed Categories with Applications to Symbolic Quantum Computation
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
Lucas Dixon, Ross Duncan
TCS
2008
15 years 6 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
SMC
2007
IEEE
224views Control Systems» more  SMC 2007»
16 years 1 months ago
Complex networks as control paradigm for complex systems
—Rooted in a deep understanding of their major properties, a control paradigm for complex systems is proposed based on latest advances in modeling the dynamics of complex network...
Stefan Grobbelaar, Mihaela Ulieru
CAISE
2007
Springer
16 years 27 days ago
Analyzing the Dynamic Cost Factors of Process-Aware Information Systems: A Model-Based Approach
Introducing process-aware information systems (PAIS) in enterprises is usually associated with high costs. It is therefore crucial to understand those factors that determine these ...
Bela Mutschler, Manfred Reichert, Stefanie Rinderl...
CONCUR
2005
Springer
16 years 8 days ago
Deriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawe...