Sciweavers

74 search results - page 4 / 15
» Product Automata and Process Algebra
Sort
View
106
Voted
NCA
2008
IEEE
15 years 3 months ago
On the Application of Formal Methods for Specifying and Verifying Distributed Protocols
In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the tw...
Marina Gelastou, Chryssis Georgiou, Anna Philippou
FOSSACS
2004
Springer
15 years 2 months ago
Duality for Labelled Markov Processes
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
Michael W. Mislove, Joël Ouaknine, Dusko Pavl...
ENTCS
2006
273views more  ENTCS 2006»
14 years 9 months ago
Operator Algebras and the Operational Semantics of Probabilistic Languages
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Alessandra Di Pierro, Herbert Wiklicky
WER
2010
Springer
14 years 7 months ago
A Tool for Formal Feature Modeling Based on BDDs and Product Families Algebra
Feature models are commonly used to capture the commonality and the variability of product families. There are several feature model notations that correspondingly depict the conce...
Fadil Alturki, Ridha Khedri
ENTCS
2007
117views more  ENTCS 2007»
14 years 9 months ago
Relating Hybrid Chi to Other Formalisms
The hybrid χ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. It integrates concepts from dynamics and control theory with concepts from com...
D. A. van Beek, J. E. Rooda, Ramon R. H. Schiffele...