Article

Event-State Duality: The Enriched Case

Author:

Vaughan R. PrattAuthors Info & Claims

CONCUR '02: Proceedings of the 13th International Conference on Concurrency Theory

Pages 41 - 56

Published: 20 August 2002 Publication History

Abstract

Enriched categories have been applied in the past to both event-oriented true concurrency models and state-oriented information systems, with no evident relationship between the two. Ordinary Chu spaces expose a natural duality between partially ordered temporal spaces (pomsets, event structures), and partially ordered information systems. Barr and Chu's original definition of Chu spaces however was for the general V -enriched case, with ordinary Chu spaces arising for V = Set (equivalently V = Pos at least for biextensional Chu spaces). We extend time-information duality to the general enriched case, and apply it to put on a common footing event structures, higher-dimensional automata (HDAs), a cancellation-based approach to branching time, and other models treatable by enriching either event (temporal) space or state (information) space.

References

[1]

Pratt, V.: The duality of time and information. In: Proc. of CONCUR'92. Volume 630 of Lecture Notes in Computer Science., Stonybrook, New York, Springer-Verlag (1992) 237-253

[2]

Gupta, V., Pratt, V.: Gates accept concurrent behavior. In: Proc. 34th Ann. IEEE Symp. on Foundations of Comp. Sci. (1993) 62-71

[3]

Barr, M.: *-Autonomous categories. Volume 752 of Lecture Notes in Mathematics. Springer-Verlag (1979)

[4]

Casley, R., Crew, R., Meseguer, J., Pratt, V.: Temporal structures. Math. Structures in Comp. Sci. 1 (1991) 179-213

[5]

Girard, J. Y.: Linear logic. Theoretical Computer Science 50 (1987) 1-102

[6]

Pratt, V.: Modeling concurrency with geometry. In: Proc. 18th Ann. ACM Symposium on Principles of Programming Languages. (1991) 311-322

[7]

Papadimitriou, C.: The Theory of Database Concurrency Control. Computer Science Press (1986)

[8]

Pratt, V.: Higher dimensional automata revisited. Math. Structures in Comp. Sci. 10 (2000) 525-548

[9]

Goubault, E.: (ed.) geometry and concurrency. Mathematical Structures in Computer Science, special issue 10 (2000) 409-573 (7 papers)

[10]

America, P., Rutten, J.: Solving reflexive domain equations in a category of complete metric spaces. Journal of Computer and System Sciences 39 (1989) 343-375

[11]

Gupta, V.: Chu Spaces: A Model of Concurrency. PhD thesis, Stanford University (1994) Tech. Report, available as http://boole.stanford.edu/pub/gupthes.ps.gz.

[12]

Pratt, V.: Transition and cancellation in concurrency and branching time. Math. Structures in Comp. Sci., special issue on the difference between sequentiality and concurrency, to appear (2002)

[13]

Pratt, V.: Chusp aces as a semantic bridge between linear logic and mathematics. Theoretical Computer Science (2002) to appear, preprint at http://boole.stanford.edu/pub/bridge.ps.gz.

[14]

Lawvere,W.: Metric spaces, generalized logic, and closed categories. In: Rendiconti del Seminario Matematico e Fisico di Milano, XLIII. Tipografia Fusi, Pavia (1973)

[15]

Pratt, V.: Enriched categories and the Floyd-Warshall connection. In: Proc. First International Conference on Algebraic Methodology and Software Technology, Iowa City (1989) 177-180

[16]

Roy, B.: Transitivité et connexité. Comptes Rendues Acad. Sci. 249 (1959) 216- 218

[17]

Warshall, S.: A theorem on Boolean matrices. Journal of the ACM 9 (1962) 11-12

[18]

Floyd, R.: Algorithm 97: shortest path. Communications of the ACM 5 (1962) 345

[19]

Kleene, S.: Representation of events in nerve nets and finite automata. In: Automata Studies. Princeton University Press, Princeton, NJ (1956) 3-42

[20]

Robert, P., Ferland, J.: Généralisation de l'algorithme de Warshall. Revue Française d'Informatique et de Recherche Operationnelle 2 (1968) 13-25

[21]

Mac Lane, S.: Categories for the Working Mathematician. Springer-Verlag (1971)

[22]

Kelly, G.: Basic Concepts of Enriched Category Theory: London Math. Soc. Lecture Notes. 64. Cambridge University Press (1982)

[23]

Rosenthal, K.: Quantales and their applications. Longman Scientific and Technical (1990)

[24]

Rosenthal, K.: The theory of quantaloids. Longman Scientific and Technical (1996)

[25]

Gaifman, H., Pratt, V.: Partial order models of concurrency and the computation of functions. In: Proc. 2nd Annual IEEE Symp. on Logic in Computer Science, Ithaca, NY (1987) 72-85

[26]

Gaifman, H.: Modeling concurrency by partial orders and nonlinear transition systems. In: Proc. REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, The Netherlands, Springer-Verlag (1989) 467-488

Cited By

Pratt V(2011)Linear process algebraProceedings of the 7th international conference on Distributed computing and internet technology10.5555/1964505.1964512(92-111)Online publication date: 9-Feb-2011
https://dl.acm.org/doi/10.5555/1964505.1964512
Cervesato IScedrov A(2009)Relating state-based and process-based concurrency through linear logic (full-version)Information and Computation10.1016/j.ic.2008.11.006207:10(1044-1077)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1016/j.ic.2008.11.006

Event-State Duality: The Enriched Case
1. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms

Recommendations

Monoidal Extended Stone Duality
Foundations of Software Science and Computation Structures
Abstract
Extensions of Stone-type dualities have a long history in algebraic logic and have also been instrumental for proving results in algebraic language theory. We show how to extend abstract categorical dualities via monoidal adjunctions, subsuming ...
Bitopological duality for distributive lattices and heyting algebras

We introduce pairwise Stone spaces as a bitopological generalisation of Stone spaces – the duals of Boolean algebras – and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces ...
Loomis--Sikorski theorem and Stone duality for effect algebras with internal state

Recently Flaminio and Montagna extended the language of MV-algebras by adding a unary operation, called a state-operator. This notion is introduced here also for effect algebras. Having it, we generalize the Loomis-Sikorski Theorem for monotone @s-...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CONCUR '02: Proceedings of the 13th International Conference on Concurrency Theory

August 2002

615 pages

ISBN:3540440437

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 August 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Pratt V(2011)Linear process algebraProceedings of the 7th international conference on Distributed computing and internet technology10.5555/1964505.1964512(92-111)Online publication date: 9-Feb-2011
https://dl.acm.org/doi/10.5555/1964505.1964512
Cervesato IScedrov A(2009)Relating state-based and process-based concurrency through linear logic (full-version)Information and Computation10.1016/j.ic.2008.11.006207:10(1044-1077)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1016/j.ic.2008.11.006

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents