Sciweavers

CONCUR
2012
Springer
12 years 2 months ago
Avoiding Shared Clocks in Networks of Timed Automata
Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks. This is a problem ...
Sandie Balaguer, Thomas Chatain
FOSSACS
2011
Springer
13 years 3 months ago
Similarity Quotients as Final Coalgebras
We give a general framework connecing a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by o...
Paul Blain Levy
CORR
2009
Springer
137views Education» more  CORR 2009»
13 years 9 months ago
Choreographies with Secure Boxes and Compromised Principals
We equip choreography-level session descriptions with a simple abstraction of a security infrastructure. Message components may be enclosed within (possibly nested) "boxes&quo...
Marco Carbone, Joshua D. Guttman
SOFSEM
2010
Springer
13 years 9 months ago
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
Parosh Aziz Abdulla
ISOLA
2010
Springer
13 years 9 months ago
Analysing Message Sequence Graph Specifications
We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has...
Joy Chakraborty, Deepak D'Souza, K. Narayan Kumar
ENTCS
2008
99views more  ENTCS 2008»
13 years 12 months ago
A Categorical Model of the Fusion Calculus
We provide a categorical presentation of the Fusion calculus. Working in a suitable category of presheaves, we describe the syntax as initial algebra of a signature endofunctor, a...
Marino Miculan
ENTCS
2008
91views more  ENTCS 2008»
13 years 12 months ago
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
Mario Bravetti
FMCAD
2000
Springer
14 years 3 months ago
The Semantics of Verilog Using Transition System Combinators
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
Gordon J. Pace
LICS
1999
IEEE
14 years 4 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
LICS
2000
IEEE
14 years 4 months ago
Precongruence Formats for Decorated Trace Preorders
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats ...
Bard Bloom, Wan Fokkink, Rob J. van Glabbeek