CONCUR
2012
Springer
11 years 6 months ago
2012
Springer
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 ...
FOSSACS
2011
Springer
12 years 7 months ago
2011
Springer
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...
CORR
2009
Springer
13 years 2 months ago
2009
Springer
We equip choreography-level session descriptions with a simple abstraction of a security infrastructure. Message components may be enclosed within (possibly nested) "boxes&quo...
SOFSEM
2010
Springer
13 years 2 months ago
2010
Springer
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...
ISOLA
2010
Springer
13 years 2 months ago
2010
Springer
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...
ENTCS
2008
13 years 4 months ago
2008
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...
ENTCS
2008
13 years 4 months ago
2008
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 ...
FMCAD
2000
Springer
13 years 8 months ago
2000
Springer
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...
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
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...
LICS
2000
IEEE
13 years 8 months ago
2000
IEEE
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats ...