Results 11 to 20 of about 435,235 (283)
Process algebra with strategic interleaving [PDF]
Theory of Computing Systems, 2019 In process algebras such as ACP (Algebra of Communicating Processes), parallel processes are considered to be interleaved in an arbitrary way. In the case of multi-threading as found in contemporary programming languages, parallel processes are actually ...
Bergstra, J. A., Middelburg, C. A.
core +6 more sources
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
Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real-World Data. [PDF]
Adv Intell DiscovThis article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Ren Y, Wei GW.
europepmc +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
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
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
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
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
, 1999 The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. Two approaches are presented using the verification system PVS. One approach declares process terms as an uninterpreted type and specifies equality on terms by axioms.
Basten, T., Hooman, J.J.M.
openaire +3 more sources
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