#### Filter Results:

#### Publication Year

1986

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this paper, a process algebra that incorporates explicit representations of successful termination, deadlock, and divergence is introduced and its semantic theory is analyzed. Both an operational and a denotational semantics for the language is given and it is shown that they agree. The operational theory is based upon a suitable adaptation of the notion… (More)

Many process algebras are deened by structural operational semantics (SOS). Indeed , most such deenitions are nicely structured and t the GSOS format of 19]. We give a procedure for converting any GSOS language deenition to a nite complete equa-tional axiom system (possibly with one innnitary induction principle) which precisely characterizes strong… (More)

There has been considerable controversy in concurrency theory between the `interleaving' and`true concurrency' schools. The former school advocates associating a transition system with a process which captures concurrent execution via the interleaving of occurrences; the latter adopts more complex semantic structures to avoid reducing concurrency to… (More)

This paper contributes to the study of the equational theory of the semantics in van Glabbeek's linear time-branching time spectrum over the language BCCSP, a basic process algebra for the description of finite synchronization trees. It offers an algorithm for producing a complete (respectively, ground-complete) equational axiomatization of any behav-ioral… (More)

This paper studies the structural complexity of model checking for (variations on) the speciication formalisms used in the tools CMC and Uppaal, and fragments of a timed alternation-free-calculus. For each of the logics we study, we characterize the computational complexity of model checking, as well as its speciication and program complexity, using timed… (More)

An extension of a structural definition of an operational semantics is (operationally) conservative if it does not affect the semantics of terms over the original signature. We present a survey of syntactic formats that have been developed to guarantee that such an extension is conservative. We also give an overview of properties, in the realm of equational… (More)

- Luca Aceto
- CONCUR
- 1994

Aceto, L., GSOS and finite labelled transition systems, Theoretical Computer Science 131 (1994) 181-195. Recently there has been considerable interest in studying formats of Plotkin style inference rules which ensure that the induced labelled transition system semantics have certain properties, In this note, I shall give a contribution to this line of… (More)

Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of choices that a system has. Independently , g-bisimilarity has been defined over Kripke models as a suitable notion of bisimilarity for graded modal logic. This note shows that these… (More)

In this paper we provide a complete characterization of the class of properties of (networks of) timed automata for which model checking can be reduced to reachability checking in the context of testing automata.