Log in

Relevant bibliographies by topics / Calculus of Communicating Systems (CCS) / Journal articles

To see the other types of publications on this topic, follow the link: Calculus of Communicating Systems (CCS).

Journal articles on the topic 'Calculus of Communicating Systems (CCS)'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 28 journal articles for your research on the topic 'Calculus of Communicating Systems (CCS).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

KRISHNAN, PADMANABHAN. "A CALCULUS OF TIMED COMMUNICATING SYSTEMS." International Journal of Foundations of Computer Science 03, no. 03 (1992): 303–22. http://dx.doi.org/10.1142/s0129054192000176.

Full text

Abstract:

In this paper we define an operational semantics for a timed version of a Calculus of Communicating Systems (CCS) [1], We also consider timing constraints that a process needs to satisfy and develop preorder relations induced by the temporal constraints.

APA, Harvard, Vancouver, ISO, and other styles

2

Winkowski, Józef. "An Equivalence of Communicating Processes in Distributed Environments." Fundamenta Informaticae 12, no. 1 (1989): 97–128. http://dx.doi.org/10.3233/fi-1989-12107.

Full text

Abstract:

The equivalence of communicating processes with respect to their external behaviour is formalized and studied. The processes are represented by mathematical systems related to labelled event structures. The equivalence is similar to the known observational equivalence but it is defined in a manner which reflects how processes behave in distributed environments. It is shown that the introduced equivalence is a congruence with respect to operations as in CCS (Milner’s Calculus of Communicating Systems).

APA, Harvard, Vancouver, ISO, and other styles

3

Sangiorgi, Davide. "Communicating and Mobile Systems: the π-calculus",. Science of Computer Programming 38, № 1-3 (2000): 151–53. http://dx.doi.org/10.1016/s0167-6423(00)00008-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Xu, Xian. "Expressing First-Order π-Calculus in Higher-Order Calculus of Communicating Systems". Journal of Computer Science and Technology 24, № 1 (2009): 122–37. http://dx.doi.org/10.1007/s11390-009-9210-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

EBERBACH, EUGENIUSZ. "SEMAL: A COST LANGUAGE BASED ON THE CALCULUS OF SELF-MODIFIABLE ALGORITHMS." International Journal of Software Engineering and Knowledge Engineering 04, no. 03 (1994): 391–408. http://dx.doi.org/10.1142/s0218194094000192.

Full text

Abstract:

The design, specification, and preliminary implementation of the SEMAL language, based upon the Calculus of Self-modifiable Algorithms model of computation is presented. A Calculus of Self-modifiable Algorithms is a universal theory for parallel and intelligent systems, integrating different styles of programming, and applied to a wealth of domains of future generation computers. It has some features from logic, rule-based, procedural, functional, and object-oriented programming. It has been designed to be a relatively universal tool for AI similar to the way Hoare’s Communicating Sequential P

APA, Harvard, Vancouver, ISO, and other styles

6

Thomsen, B., and S. Abramsky. "A fully abstract denotational semantics for the calculus of higher-order communicating systems." Theoretical Computer Science 254, no. 1-2 (2001): 557–89. http://dx.doi.org/10.1016/s0304-3975(00)00281-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Heath, DJ. "An application of the calculus of communicating systems to the prime factorization problem." Information and Software Technology 35, no. 8 (1993): 474–78. http://dx.doi.org/10.1016/0950-5849(93)90045-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

VERSARI, CRISTIAN, NADIA BUSI, and ROBERTO GORRIERI. "An expressiveness study of priority in process calculi." Mathematical Structures in Computer Science 19, no. 6 (2009): 1161–89. http://dx.doi.org/10.1017/s0960129509990168.

Full text

Abstract:

Priority is a frequently used feature of many computational systems. In this paper we study the expressiveness of two process algebras enriched with different priority mechanisms. In particular, we consider a finite (that is, recursion-free) fragment of asynchronous CCS with global priority (FAP, for short) and Phillips' CPG (CCS with local priority), and contrast their expressive power with that of two non-prioritised calculi, namely the π-calculus and its broadcast-based version, called bπ. We prove, by means of leader-election-based separation results, that, under certain conditions, there

APA, Harvard, Vancouver, ISO, and other styles

9

GAY, SIMON J., and RAJAGOPAL NAGARAJAN. "Types and typechecking for Communicating Quantum Processes." Mathematical Structures in Computer Science 16, no. 3 (2006): 375–406. http://dx.doi.org/10.1017/s0960129506005263.

Full text

Abstract:

We define a language CQP (Communicating Quantum Processes) for modelling systems that combine quantum and classical communication and computation. CQP combines the communication primitives of the pi-calculus with primitives for measurement and transformation of the quantum state; in particular, quantum bits (qubits) can be transmitted from process to process along communication channels. CQP has a static type system, which classifies channels, distinguishes between quantum and classical data, and controls the use of quantum states. We formally define the syntax, operational semantics and type

APA, Harvard, Vancouver, ISO, and other styles

10

Jeffrey, Alan. "Communicating and Mobile Systems: the π-calculus by Robin Milner, Cambridge University Press, 1999". Journal of Functional Programming 11, № 4 (2001): 433–36. http://dx.doi.org/10.1017/s0956796801224113.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

BAIER, CHRISTEL, and MARTA KWIATKOWSKA. "Domain equations for probabilistic processes." Mathematical Structures in Computer Science 10, no. 6 (2000): 665–717. http://dx.doi.org/10.1017/s0960129599002984.

Full text

Abstract:

In this paper we consider Milner's calculus CCS enriched by a probabilistic choice operator. The calculus is given operational semantics based on probabilistic transition systems. We define operational notions of preorder and equivalence as probabilistic extensions of the simulation preorder and the bisimulation equivalence respectively. We extend existing category-theoretic techniques for solving domain equations to the probabilistic case and give two denotational semantics for the calculus. The first, ‘smooth’, semantic model arises as a solution of a domain equation involving the probabilis

APA, Harvard, Vancouver, ISO, and other styles

12

DENG, YUXIN, ROBERT J. SIMMONS, and ILIANO CERVESATO. "Relating reasoning methodologies in linear logic and process algebra." Mathematical Structures in Computer Science 26, no. 5 (2014): 868–906. http://dx.doi.org/10.1017/s0960129514000413.

Full text

Abstract:

We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of barbed preorder for a CCS-like process calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The argument makes use of other standard notions in process algebra, namely simulation and labelled transition systems. This result establishes a connection between an approach to reason about process specifications, the barbed preorder, and a method to reason about logic specifications, the logical preorder.

APA, Harvard, Vancouver, ISO, and other styles

13

Xiao, Fangxiong, Zhiqiu Huang, Zining Cao, Jun Hu, Linyuan Liu, and Min Yuan. "Unified Modelling Functional and Non-Functional Aspects of Web Services Composition Using PTCCS." International Journal of Web Services Research 8, no. 4 (2011): 47–80. http://dx.doi.org/10.4018/jwsr.2011100103.

Full text

Abstract:

Unified modelling and analyzing functional and non-functional aspects of Web services composition reduces the gap caused by modelling them in different models respectively, increases development speed, and reduces development cost. Though existing process algebras have advantages over modelling concurrent and composite systems, including Web services composition, they lack the capability of modelling cost that is an important non-functional property. This paper proposes a process algebra called PTCCS (Priced Temporal Calculus of Communicating Systems) based on the existing TCCS (Temporal Calcu

APA, Harvard, Vancouver, ISO, and other styles

14

Bezerra, J. M., and C. M. Hirata. "A Polyadic pi-Calculus Approach for the Formal Specification of UML-RT." Advances in Software Engineering 2009 (August 13, 2009): 1–26. http://dx.doi.org/10.1155/2009/656810.

Full text

Abstract:

UML-RT is a UML real-time profile that allows modeling event-driven and distributed systems; however it is not a formal specification language. This paper proposes a formal approach for UML-RT through a mapping of the UML-RT communicating elements into the -calculus (or pi-calculus) process algebra. The formal approach both captures the intended behavior of the system being modeled and provides a rigorous and nonambiguous system description. Our proposal differentiates from other research work because we map UML-RT to -calculus, and we allow the mapping of dynamic reconfiguration of UML-RT unw

APA, Harvard, Vancouver, ISO, and other styles

15

Kordzadeh, Nima, and John Warren. "Communicating Personal Health Information in Virtual Health Communities: An Integration of Privacy Calculus Model and Affective Commitment." Journal of the Association for Information Systems 18, no. 1 (2017): 45–81. http://dx.doi.org/10.17705/1jais.00446.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

BOCCHI, LAURA, and EMILIO TUOSTO. "Attribute-based transactions in service oriented computing." Mathematical Structures in Computer Science 25, no. 3 (2014): 619–65. http://dx.doi.org/10.1017/s0960129512000904.

Full text

Abstract:

We present a theory for the design and verification of distributed transactions in dynamically reconfigurable systems. Despite several formal approaches have been proposed to study distributed transactional behaviours, the inter-relations between failure propagation and dynamic system reconfiguration still need investigation. We propose a formal model for transactions in service oriented architectures (SOAs) inspired by the attribute mechanisms of the Java Transaction API. Technically, we model services in ATc (after ‘Attribute-basedTransactionalcalculus’), a CCS-like process calculus where se

APA, Harvard, Vancouver, ISO, and other styles

17

Volkodav, Vladimir A., and Ivan A. Volkodav. "Development of the structure and composition of a building information classifier towards the application of BIM technologies." Vestnik MGSU, no. 6 (June 2020): 867–906. http://dx.doi.org/10.22227/1997-0935.2020.6.867-906.

Full text

Abstract:

Abstract Introduction. Various building information classification systems are used internationally; their critical analysis makes it possible to highlight basic requirements applicable to the Russian classifier and substantiate its structure and composition. Materials and methods. Modern international building information classification systems, such as OmniClass (USA), Uniclass 2015 (UK), CCS (Denmark), and CoClass (Sweden), are considered in the article. Their structure, composition, methodological fundamentals are analyzed. In addition to international classification systems, R

APA, Harvard, Vancouver, ISO, and other styles

18

Engberg, Uffe, and Mogens Nielsen. "A Calculus of Communicating Systems with Label Passing." DAIMI Report Series 15, no. 208 (1986). http://dx.doi.org/10.7146/dpb.v15i208.7559.

Full text

Abstract:

Milner's Calculus of Communicating Systems (CCS) is extended with a mechanism for label passing - as an attempt to remedy some of the shortcomings of CCS w.r.t. dynamic change of agent interconnections. In the extended calculus, restriction is viewed formally as a binder, and the calculus allows dynamic change of scope (of label) in connection with communication. It is proved that algebraic properties of strong (and observational) equivalence for CCS are preserved by the extension. Examples illustrating the expressive power of the calculus and its methods for reasoning are given.

APA, Harvard, Vancouver, ISO, and other styles

19

Aceto, Luca, Willem Jan Fokkink, Anna Ingólfsdóttir, and Bas Luttik. "CCS with Hennessy's Merge has no Finite Equational Axiomatization." BRICS Report Series 10, no. 34 (2003). http://dx.doi.org/10.7146/brics.v10i34.21802.

Full text

Abstract:

This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner's Calculus of Communicationg Systems is not finitely based modulo bisimulation equivalence. Thus Hennessy's merge cannot replace the left merge and communication merge operators proposed by Bergstra and Klop, at least if a finite axiomatization of parallel composition is desired.

APA, Harvard, Vancouver, ISO, and other styles

20

Aceto, Luca, Willem Jan Fokkink, Anna Ingólfsdóttir, and Bas Luttik. "Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge." BRICS Report Series 11, no. 1 (2004). http://dx.doi.org/10.7146/brics.v11i1.21826.

Full text

Abstract:

This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion free fragment of Milner's Calculus of Communicating Systems. Thus the addition of a single binary operation, viz. Hennessy's merge, is sufficient for the finite equational axiomatization of parallel composition modulo this non-interleaving equivalence. This result is in sharp contrast to a theorem previously obtained by the same authors to the effect tha

APA, Harvard, Vancouver, ISO, and other styles

21

Peng, Tu, Shuliang Wang, Jing Geng, Qinsi Wang, Yun Yang, and Kang Zhang. "Verification of the Instantiation and Integration of Security Patterns." Journal of Web Engineering, August 20, 2020. http://dx.doi.org/10.13052/jwe1540-9589.19347.

Full text

Abstract:

As software applications suffer from increasing malicious attacks, security becomes a critically important issue for software development. To avoid security problems and increase efficiency, a large software system design may reuse good security solutions for existing security patterns. While security patterns document expert solutions to common security problems and capture well-examined practices on secure software design, implementing them in a particular context (pattern instantiation) and composing them with other related patterns (pattern integration) are prone to flaws and may break exp

APA, Harvard, Vancouver, ISO, and other styles

22

Nielsen, Mogens, and Kim Sunesen. "Behavioural Equivalence for Infinite Systems—Partially Decidable!" BRICS Report Series 2, no. 55 (1995). http://dx.doi.org/10.7146/brics.v2i55.19956.

Full text

Abstract:

For finite-state systems non-interleaving equivalences are computationally<br />at least as hard as interleaving equivalences. In this paper we show<br />that when moving to infinite-state systems, this situation may change<br />dramatically.<br />We compare standard language equivalence for process description languages with two generalizations based on traditional approaches capturing non-interleaving behaviour, pomsets representing global causal dependency, and locality representing spatial distribution of events.<br />We first study equivalences on Basic Paral

APA, Harvard, Vancouver, ISO, and other styles

23

Diaz, Juan Francisco, Camilo Rueda, and Frank D. Valencia. "Pi+-Calculus: A Calculus for Concurrent Processes with Constraints." CLEI Electronic Journal 1, no. 2 (1998). http://dx.doi.org/10.19153/cleiej.1.2.2.

Full text

Abstract:

The Pi-calculus is a formal model of concurrent computation based on the notion of naming. It has an important role to play in the search for more abstract theories of concurrent and communicating systems. In this paper we augment the Pi-calculus with a constraint store and add the notion of constraint agent to the standard Pi-calculus concept of agent. We call this extension the Pi+-calculus. We also extend the notion of barbed bisimulation to define behavioral equivalence for the Pi+-calculus and use it to characterize some equivalent behaviors derived from constraint agents. The paper discu

APA, Harvard, Vancouver, ISO, and other styles

24

Madiot, Jean-Marie, Damien Pous, and Davide Sangiorgi. "Modular coinduction up-to for higher-order languages via first-order transition systems." Logical Methods in Computer Science Volume 17, Issue 3 (September 17, 2021). http://dx.doi.org/10.46298/lmcs-17(3:25)2021.

Full text

Abstract:

The bisimulation proof method can be enhanced by employing `bisimulations up-to' techniques. A comprehensive theory of such enhancements has been developed for first-order (i.e., CCS-like) labelled transition systems (LTSs) and bisimilarity, based on abstract fixed-point theory and compatible functions. We transport this theory onto languages whose bisimilarity and LTS go beyond those of first-order models. The approach consists in exhibiting fully abstract translations of the more sophisticated LTSs and bisimilarities onto the first-order ones. This allows us to reuse directly the large corpu

APA, Harvard, Vancouver, ISO, and other styles

25

Sunesen, Kim. "Further Results on Partial Order Equivalences on Infinite Systems." BRICS Report Series 5, no. 6 (1998). http://dx.doi.org/10.7146/brics.v5i6.19278.

Full text

Abstract:

In [26], we investigated decidability issues for standard language equivalence for process description languages with two generalisations based on traditional approaches<br />for capturing non-interleaving behaviour: pomset equivalence reflecting global causal dependency, and location equivalence reflecting spatial distribution of events. In this paper, we continue by investigating the role played by TCSP-style renaming and hiding combinators with respect to decidability. One result of [26] was that in contrast to pomset equivalence, location equivalence remained decidable for a class of

APA, Harvard, Vancouver, ISO, and other styles

26

Andersen, Jørgen H., Carsten H. Kristensen, and Arne Skou. "Specification and Automated Verification of Real-Time Behaviour —A Case Study." BRICS Report Series 2, no. 60 (1995). http://dx.doi.org/10.7146/brics.v2i60.19961.

Full text

Abstract:

<p>In this paper we sketch a method for specification and automatic<br />verification of real-time software properties. The method combines<br />the IEC 848 norm and the recent specification techniques TCCS (Timed<br />Calculus of Communicating Systems) and TML (Timed Modal Logic)<br /> - supported by an automatic verification tool, Epsilon. The method<br />is illustrated by modelling a small real-life steam generator example and<br />subsequent automated analysis of its properties.</p><p><br />Keywords: Control system analysis; forma

APA, Harvard, Vancouver, ISO, and other styles

27

Ingólfsdóttir, Anna. "A Semantic Theory for Value–Passing Processes Late Approach Part II: A Behavioural Semantics and Full Abstractness." BRICS Report Series 2, no. 22 (1995). http://dx.doi.org/10.7146/brics.v2i22.19924.

Full text

Abstract:

This is the second of two companion papers on a semantic theory for communicating processes with values based on the late approach. In the first one, [Ing95], we explained the general idea of the late semantic approach. Furthermore we<br />introduced a general syntax for value-passing process algebra based on the late approach and a general class of denotational models for these languages in the Scott-Strachey style. Then we defined a concrete language, CCSL, which is<br />an extension of the standard CCS with values according to the late approach.<br />We also provided a den

APA, Harvard, Vancouver, ISO, and other styles

28

Aceto, Luca, Willem Jan Fokkink, and Chris Verhoef. "Conservative Extension in Structural Operational Semantics." BRICS Report Series 6, no. 24 (1999). http://dx.doi.org/10.7146/brics.v6i24.20093.

Full text

Abstract:

<p>Structural operational semantics (SOS) [44] provides a framework to give<br />an operational semantics to programming and specification languages. In<br />particular, because of its intuitive appeal and flexibility, SOS has found considerable application in the study of the semantics of concurrent processes. SOS generates a labelled transition system, whose states are the closed terms over an algebraic signature, and whose transitions are supplied with labels. The transitions between states are obtained inductively from a transition system specification (TSS), which consis

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!