17 citations · 59 across the 35 of their papers we have counts for
35 papers
Finitary Truly Concurrent Bisimulations
Yong Wang
To develop a full abstract denotational model of a process language based on prebisimulation preorder, its behavioural semantics has two problems: (1) Two processes related by a st…
Theories of Truly Concurrent Processes
Yong Wang
A process is able to execute a set of actions with a predefined manner, while a truly concurrent process executes this set of actions with a manner with the flavour of true concurr…
Process Algebra with Imperfect Actions
Yong Wang
We discuss the deal of imperfectness of atomic actions in reality with the background of process algebras. And we show the applications of the imperfect actions in verification of…
Verification of Distributed Quantum Protocols
Yong Wang
Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, to calculus, APPTC to probabil…
Truly Concurrent Process Algebra with Localities
Yong Wang
The well-known process algebras, such as CCS, ACP and -calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent proce…
Truly Concurrent Calculi with Reversibility, Probabilism and Guards
Yong Wang
The well-known process algebras, such as CCS, ACP and -calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent proce…
Probabilistic Process Algebra for True Concurrency
Yong Wang
The well-known process algebras, such as CCS, ACP and -calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent proce…
Actors -- A Process Algebra Based Approach
Yong Wang
We model actors based on truly concurrent process algebra, and capture the actor model in the following characteristics: (1) Concurrency: all actors execute concurrently; (2) Async…
Secure Process Algebra
Yong Wang
Based on our previous work on truly concurrent process algebras APTC, we use it to verify the security protocols. This work (called Secure APTC, abbreviated SAPTC) have the followi…
On the Parallel Composition for True Concurrency
Yong Wang
For insight into the parallel composition for true concurrency, we recall the axiomatization of the parallel composition modulo truly concurrent behavioral equivalences as the side…
Verification of Patterns
Yong Wang
The software patterns provide building blocks to the design and implementation of a software system, and try to make the software engineering to progress from experience to science…
Operational Semantics of Games
Yong Wang
We introduce operational semantics into games. And based on the operational semantics, we establish a full algebra of games, including basic algebra of games, algebra of concurrent…
Truly Concurrent Bisimilarities are Game Equivalent
Yong Wang
We design games for truly concurrent bisimilarities, including strongly truly concurrent bisimilarities and branching truly concurrent bisimilarities, such as pomset bisimilarities…
Algebra of Concurrent Games
Yong Wang
We introduce parallelism into the basic algebra of games to model concurrent game algebraically. Parallelism is treated as a new kind of game operation. The resulted algebra of con…
Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing
Yong Wang
Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, to calculus, APPTC to probabil…
Structured Parallel Programming
Yong Wang
Based on our previous work on algebraic laws for true concurrency, we design a structured parallel programming language for true concurrency called PPL. Different to most programmi…
Truly Concurrent Process Algebra Is Reversible
Yong Wang
Based on our previous process algebra for concurrency APTC, we prove that it is reversible with a little modifications. The reversible algebra has four parts: Basic Algebra for Rev…
Reversible Truly Concurrent Process Algebra
Yong Wang
We design a reversible version of truly concurrent process algebra CTC which is called RCTC. It has good properties modulo several kinds of strongly forward-reverse truly concurren…
Communicating Concurrent Processes
Yong Wang
Process algebra CSP only permits a process to engage in one event on a moment and records this single event into the traces of the process. CSP cannot process events simultaneously…
Truly Concurrent Process Algebra with Timing
Yong Wang
We extend truly concurrent process algebra APTC with timing related properties. Just like ACP with timing, APTC with timing also has four parts: discrete relative timing, discrete…
An Algebra of Actors Based on True Concurrency
Yong Wang
An algebra of actors fully captures the properties of actors based on asynchronous -calculus, but, it is based on the interleaving bisimulation semantics. We adjus…
A Calculus of Truly Concurrent Mobile Processes
Yong Wang
We make a mixture of Milner's -calculus and our previous work on truly concurrent process algebra, which is called . We introduce syntax and semantics of , its p…
A Calculus for True Concurrency
Yong Wang
We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisi…
Algebraic Laws for True Concurrency
Yong Wang
We find the algebraic laws for true concurrency. Eventually, we establish a whole axiomatization for true concurrency called APTC (Algebra for Parallelism in True Concurrency). The…