A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Modeling concurrency with partial orders
International Journal of Parallel Programming
Petr nets, algebras, morphisms, and compositionality
Information and Computation
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
CCS—and its relationship to net theory
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
On the semantics of concurrency: partial orders and transition systems
The International Joint Conference on theory and practice of software development on TAPSOFT '87
Bisimulations and abstraction homomorphisms
Journal of Computer and System Sciences
Concurrent histories: a basis for observing distributed systems
Journal of Computer and System Sciences
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Axiomatising finite concurrent processes
SIAM Journal on Computing
Journal of the ACM (JACM)
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Connections between a concrete and an abstract model of concurrent systems
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
A partial ordering semantics for CCS
Theoretical Computer Science
Towards the unification of models for concurrency
CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
Modelling nondeterministic concurrent processes with event structures
Fundamenta Informaticae
Selected papers of the Second Workshop on Concurrency and compositionality
Selected papers of the 3rd workshop on Concurrency and compositionality
Universal axioms for bisimulations
Selected papers of the 3rd workshop on Concurrency and compositionality
Refinement of actions in event structures and causal trees
MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
History preserving, causal and mixed-ordering equivalence over stable event structures (note)
Fundamenta Informaticae
Relating distributed, temporal and causal observations of simple processes
Fundamenta Informaticae
Towards action-refinement in process algebras
Information and Computation
Adding action refinement to a finite process algebra
Information and Computation
Flow models of distributed computations: three equivalent semantics for CCS
Information and Computation
Comparing locality and causality based equivalences
Acta Informatica
Transition systems, event structures, and unfoldings
Information and Computation
Handbook of logic in computer science (vol. 4)
Location equivalence in a parametric setting
Theoretical Computer Science
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallel product of event structures
Theoretical Computer Science
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Flow Event Structures and Flow Nets
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
Observing Distribution in Processes
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
On the Relationship of CCS and Petri Nets
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Bundle event structures: a non-interleaving semantics for LOTOS
FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
A Parametric Approach to Localities
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A New Definition of Morphism on Petri Nets
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Locality Based Linda: Programming with Explicit Localities
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
TAPSOFT '91 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD)
Categories of Models for Concurrency
Seminar on Concurrency, Carnegie-Mellon University
A Theory of Process with Localities (Extended Abstract)
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Structural Operational Specifications and the Trace Automata
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Failures Semantics for a Simple Process Language with Refinement
Proceedings of the 11th Conference on Foundations of Software Technology and Theoretical Computer Science
CCS, Location and Asynchronous Transition Systems
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Milner's Communicationg Systmes and Petri Nets
Selected Papers from the 3rd European Workshop on Applications and Theory of Petri Nets
CSP-programs with individual tokens
Proceedings of the European Workshop on Applications and Theory in Petri Nets, covers the last two years which include the workshop 1983 in Toulouse and the workshop 1984 in Aarhus, selected papers
Operational Petri net semantics for CCSP
Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Partial ordering derivations for CCS
FCT '85 Fundamentals of Computation Theory
Partial orderings descriptions and observations of nondeterministic concurrent processes
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Permutation of transitions: An event structure semantics for CCS and SCCS
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Fully abstract models for a process language with refinement
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Refinement of Actions in Causality Based Models
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
SCONE: A Simple Calculus of Nets
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Causal Trees: Interleaving + Causality
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Partial orders and the axiomatic theory of shuffle (pomsets)
Partial orders and the axiomatic theory of shuffle (pomsets)
Categories of asynchronous systems
Categories of asynchronous systems
Well-behaved flow event structures for parallel composition and action refinement
Theoretical Computer Science
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
A Distributed Pi-Calculus
Transactions on Computational Systems Biology VI (Lecture Notes in Computer Science)
Transactions on Computational Systems Biology VI (Lecture Notes in Computer Science)
Action Refinement in Process Algebras (Distinguished Dissertations in Computer Science)
Action Refinement in Process Algebras (Distinguished Dissertations in Computer Science)
Reversibility and Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A fully abstract view for local cause semantics
GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
| Hi-index | 0.01 |
We recall some memories of the Esprit Basic Research Action CEDISYS, a small, well-focussed and fruitful project which brought together researchers at the meeting point of true concurrency and process algebra, in the period 1988-1991. The project was initiated and effectively animated by Ugo Montanari, a passionate and long-time advocate of both these approaches to the semantics of concurrency.