Journal of the ACM (JACM)
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Series and Parallel Operations on Pomsets
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Automata on Series-Parallel Biposets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
Mathematical Structures in Computer Science
A simple process algebra based on atomic actions with resources
Mathematical Structures in Computer Science
Journal of Automata, Languages and Combinatorics
Causality and atomicity in distributed computations
Distributed Computing
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
A Chart Semantics for the Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantic domains of timed event structures
Programming and Computing Software
New Bisimulation Semantics for Distributed Systems
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Concurrency, Graphs and Models
Aggregation of transitions in marking graph generation based on maximality semantics for petri nets
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
A logic characteristic for timed extensions of partial order based equivalences
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Analysis of Timed Concurrent Models Based on Testing Equivalence
Fundamenta Informaticae
Atomicity And Concurrency Control In Process Calculi
Fundamenta Informaticae
ON FOUR PARTIAL ORDERING SEMANTICS FOR A PROCESS CALCULUS
Fundamenta Informaticae
| Hi-index | 0.00 |