Results 11 to 20 of about 17,836 (258)
An algebra of quantum processes [PDF]
ACM Transactions on Computational Logic, 2009 We introduce an algebra qCCS of pure quantum processes in which communications by moving quantum states physically are allowed and computations are modeled by super-operators, but no classical data is explicitly involved. An operational semantics of qCCS is presented in terms of (nonprobabilistic) labeled transition systems. Strong bisimulation between
Mingsheng Ying +3 more
openaire +2 more sources
An Abstraction Technique for Verifying Shared-Memory Concurrency
Applied Sciences, 2020 Modern concurrent and distributed software is highly complex. Techniques to reason about the correct behaviour of such software are essential to ensure its reliability.
Wytse Oortwijn +2 more
doaj +1 more source
Robust Deadlock Control for Reconfigurable Printing Manufacturing System Based on Process Algebra
IEEE Access, 2023 The competition for shared resources in printing manufacturing system may lead to deadlock, which could cause unnecessary downtime and bring vast economic loss for enterprises.
Huailin Li +4 more
doaj +1 more source
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes [PDF]
, 1984 We introduce recursively defined processes and regular processes, both in presence and absence of communication. It is shown that both classes are process algebras. As an example of recursively defined processes, Bag and Stack are discussed in detail. It is shown that Bag cannot be recursively defined without merge.
Bergstra, J.A., Klop, J.W.
openaire +3 more sources
On the Modeling and Verification of Collective and Cooperative Systems
Frontiers in Robotics and AI, 2022 The formal description and verification of networks of cooperative and interacting agents is made difficult by the interplay of several different behavioral patterns, models of communication, scalability issues.
Alessandro Aldini
doaj +1 more source
A Process Algebra for Interworkings [PDF]
, 2001 The Interworking language (lW) is a graphical formalism for displaying the communication behaviour of system components. In this chapter, we develop a format semantics for the Interworking language. This semantics must support the analysis of (collections of) Interworking diagrams and allow to express the relation between diagrams.
S. Mauw (Sjouke), M.A. Reniers (Michel)
openaire +4 more sources
Process algebra with guards [PDF]
Formal Aspects of Computing, 1991 Abstract We extend process algebra with guards, comparable to the guards in guarded commands or conditions in common programming constructs such as ‘if — then — else — fi’ and ‘while — do — od’. The extended language is provided with an operational semantics based on transitions between pairs of a process and a (data-)state.
Jan Friso Groote, Alban Ponse
openaire +2 more sources
Failure Trace Semantics for a Process Algebra with Time-outs [PDF]
Logical Methods in Computer Science, 2021 This paper extends a standard process algebra with a time-out operator, thereby increasing its absolute expressiveness, while remaining within the realm of untimed process algebra, in the sense that the progress of time is not quantified.
Rob van Glabbeek
doaj +1 more source
Journal of Computer and System Sciences, 1987 The paper aims at developing a concept of distributed processes and operations which cover existing approaches, possibly avoiding their shortcomings. The concept of process is similar to that proposed by Brock and Ackerman and Staples and Nguyen. A process is characterized by the set of scenarios it can realize.
Józef Winkowski +1 more
openaire +2 more sources
A Process Algebra With Qualitative Calculus for Modeling Spatio-Temporal Behaviour
IEEE Access, 2019 Distributive real-time autonomous systems like cyber-physical systems (CPS) and biology systems have become a hot topic nowadays. The high-level design of these systems shares a common characteristic that the behavior of agents is always space-related: i.
Yuanrui Zhang, Yixiang Chen, Hengyang Wu
doaj +1 more source