Sciweavers

68 search results - page 1 / 14
» Impossibility Results for the Equational Theory of Timed CCS
Sort
View
CALCO
2007
Springer
112views Mathematics» more  CALCO 2007»
13 years 10 months ago
Impossibility Results for the Equational Theory of Timed CCS
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
Luca Aceto, Anna Ingólfsdóttir, Moha...
IPL
2008
84views more  IPL 2008»
13 years 4 months ago
The equational theory of prebisimilarity over basic CCS with divergence
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduced by Hennessy and Milner in the early 1980s, over basic CCS with the divergent ...
Luca Aceto, Silvio Capobianco, Anna Ingólfs...
KBSE
1998
IEEE
13 years 8 months ago
Planning Equational Verification in CCS
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
Raul Monroy, Alan Bundy, Ian Green
CSFW
2010
IEEE
13 years 8 months ago
Impossibility Results for Secret Establishment
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
Benedikt Schmidt, Patrick Schaller, David A. Basin
BIRTHDAY
2005
Springer
13 years 10 months ago
Finite Equational Bases in Process Algebra: Results and Open Questions
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...