A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Towards a general theory of action and time
Artificial Intelligence
The theory of database concurrency control
The theory of database concurrency control
Introduction to higher order categorical logic
Introduction to higher order categorical logic
Modeling concurrency with partial orders
International Journal of Parallel Programming
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Theoretical Computer Science
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
The equational theory of pomsets
Theoretical Computer Science
Modeling concurrency with geometry
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Process algebra
Schedulers as abstract interpretations of higher-dimensional automata
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
CHU spaces: a model of concurrency
CHU spaces: a model of concurrency
Mappings of languages by two-tape devices
Journal of the ACM (JACM)
Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Dynamic Logic
Handbook of Process Algebra
Process logic: preliminary report
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Durations for Truly-Concurrent Transitions
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Time and Information in Sequential and Concurrent Computation
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
Event Spaces and their Linear Logic
AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
ECHIDNA: A System for Manipulating Explicit Choice Higher Dimensional Automata
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Detecting Deadlocks in Concurrent Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Event-State Duality: The Enriched Case
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial
Seminar on Concurrency, Carnegie-Mellon University
The Duality of TIme and Information
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Homology of Higher Dimensional Automata
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Semantics and Analysis of Linda-Based Languages
WSA '93 Proceedings of the Third International Workshop on Static Analysis
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Some Constructions for Order-Theoretic Models of Concurrency
Proceedings of the Conference on Logic of Programs
Extraction of Concurrent Processes from Higher Dimensional Automata
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Arithmetic + Logic + Geometry = Concurrency
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Two-way Channel with Disconnect
The Analysis of Concurrent Systems
Chu spaces as a semantic bridge between linear logic and mathematics
Theoretical Computer Science - Linear logic
Higher Dimensional Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
SEMANTICS OF COMMUNICATING PARALLEL PROCESSES
SEMANTICS OF COMMUNICATING PARALLEL PROCESSES
The modeling and analysis of supervisory systems
The modeling and analysis of supervisory systems
Transition and cancellation in concurrency and branching time
Mathematical Structures in Computer Science
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Higher dimensional automata revisited
Mathematical Structures in Computer Science
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
Semantical consideration on floyo-hoare logic
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Gates accept concurrent behavior
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
| Hi-index | 0.00 |
A linear process is a system of events and states related by an inner product, on which are defined the behaviorally motivated operations of tensor product or orthocurrence, sum or concurrence, sequence, and choice. Linear process algebra or LPA is the theory of this framework. LPA resembles Girard's linear logic with the differences attributable to its focus on behavior instead of proof. As with MLL the multiplicative part can be construed via the Curry-Howard isomorphism as an enrichment of Boolean algebra. The additives cater for independent concurrency or parallel play. The traditional sequential operations of sequence and choice exploit process-specific state information catering for notions of transition and cancellation.