Dynamic connectors for concurrency
Theoretical Computer Science
A simple process algebra based on atomic actions with resources
Mathematical Structures in Computer Science
Well-behaved flow event structures for parallel composition and action refinement
Theoretical Computer Science
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Causality versus true-concurrency
Theoretical Computer Science
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
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Full Abstractness of a Metric Semantics for Action Refinement
Fundamenta Informaticae
| Hi-index | 0.00 |