It is widely agreed that the modular method is one of the most eective methods to specify and verify complex systems in order to avoid combinatorial explosion. FLC ( Fixpoint Logic with Chop) is an important modal logic because of its expressivity and logic properties, e.g., it is strictly more expressive than the -calculus. In this paper, we study the compositionality of FLC, namely, to investigate the connection between the connectives of the logic and the constructors of programs. To this end, we rst extend FLC with a nondeterministic operator \+ " (FLC+ for the extension) and then establish a correspondence between the logic and the basic process algebra with deadlock and termination (abbreviated by BPA). Finally, we show that as a...
The Theory of Sequential Processes includes deadlock, successful termination, action prefixing, alte...
Abstract. This paper analyses the complexity of model checking Fix-point Logic with Chop – an extens...
In component based software design, formal reasoning about programs has to be compositional, allowin...
AbstractIt is widely agreed that the modular method is one of the most effective methods to specify ...
Abstract. Compositionality plays an important role in designing reac-tive systems as it allows one t...
This paper examines FLC, which is the modal -calculus enriched with a sequential composition operat...
We present the first compositional proof system for checking processes against formulas in the modal...
We identify two features of common process algebra operations: their first-order flavour and the fac...
AbstractIn component based software design, formal reasoning about programs has to be compositional,...
Introduces a new paradigm for concurrency, called behaviours-as-types. In this paradigm, types are u...
We introduce a new paradigm for concurrency, called behaviours-as-types. In this paradigm, types are...
We identify two features of common process algebra operations: their first-order flavour and the fa...
AbstractRohit Parikh has been one of the pioneers at the interface of modal and dynamic logic. Bring...
This paper provides a denotational semantics for the ‘saturation method’, described by J. A. Bergstr...
We present a proof system for determining satisfaction betweenprocesses in a fairly general process ...
The Theory of Sequential Processes includes deadlock, successful termination, action prefixing, alte...
Abstract. This paper analyses the complexity of model checking Fix-point Logic with Chop – an extens...
In component based software design, formal reasoning about programs has to be compositional, allowin...
AbstractIt is widely agreed that the modular method is one of the most effective methods to specify ...
Abstract. Compositionality plays an important role in designing reac-tive systems as it allows one t...
This paper examines FLC, which is the modal -calculus enriched with a sequential composition operat...
We present the first compositional proof system for checking processes against formulas in the modal...
We identify two features of common process algebra operations: their first-order flavour and the fac...
AbstractIn component based software design, formal reasoning about programs has to be compositional,...
Introduces a new paradigm for concurrency, called behaviours-as-types. In this paradigm, types are u...
We introduce a new paradigm for concurrency, called behaviours-as-types. In this paradigm, types are...
We identify two features of common process algebra operations: their first-order flavour and the fa...
AbstractRohit Parikh has been one of the pioneers at the interface of modal and dynamic logic. Bring...
This paper provides a denotational semantics for the ‘saturation method’, described by J. A. Bergstr...
We present a proof system for determining satisfaction betweenprocesses in a fairly general process ...
The Theory of Sequential Processes includes deadlock, successful termination, action prefixing, alte...
Abstract. This paper analyses the complexity of model checking Fix-point Logic with Chop – an extens...
In component based software design, formal reasoning about programs has to be compositional, allowin...