chapter

Notes on algebraic calculi of processes

Author:

G. BoudolAuthors Info & Claims

Logics and models of concurrent systems

February 1989

Pages 261 - 303

Published: 01 February 1989 Publication History

Abstract

No abstract available.

Cited By

View all

Valmari A(2015)On constructibility and unconstructibility of LTS operators from other LTS operatorsActa Informatica10.1007/s00236-015-0217-252:2-3(207-234)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1007/s00236-015-0217-2
Baeten JLuttik Bvan Tilburg P(2011)Reactive turing machinesProceedings of the 18th international conference on Fundamentals of computation theory10.5555/2034214.2034244(348-359)Online publication date: 22-Aug-2011
https://dl.acm.org/doi/10.5555/2034214.2034244
Lafrance S(2006)Using equivalence-checking to verify robustness to denial of serviceComputer Networks: The International Journal of Computer and Telecommunications Networking10.5555/1146183.164871450:9(1327-1348)Online publication date: 20-Jun-2006
https://dl.acm.org/doi/10.5555/1146183.1648714
Show More Cited By

Index Terms

Notes on algebraic calculi of processes
1. Theory of computation

Recommendations

Algebraic foundations for qualitative calculi and networks
Abstract
Binary Constraint Problems have traditionally been considered as Network Satisfaction Problems over some relation algebra. A constraint network is satisfiable if its nodes can be mapped into some representation of the relation algebra ...
Representations of Algebraic Domains and Algebraic L-domains by Information Systems

Information systems play an important role in characterizing order structures. In this paper, we introduce the notions of the algebraic information system and algebraic L-information system. They are of the same logic-oriented style as the information ...
Type checking and typability in domain-free lambda calculi

This paper shows (1) the undecidability of the type checking and the typability problems in the domain-free lambda calculus with negation, product, and existential types, (2) the undecidability of the typability problem in the domain-free polymorphic ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Logics and models of concurrent systems

February 1989

498 pages

ISBN:0387151818

Editor:
Krzysztof R. Apt
L.I.T.P, Univ. Paris, Paris, France

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 February 1989

Qualifiers

Chapter

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Valmari A(2015)On constructibility and unconstructibility of LTS operators from other LTS operatorsActa Informatica10.1007/s00236-015-0217-252:2-3(207-234)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1007/s00236-015-0217-2
Baeten JLuttik Bvan Tilburg P(2011)Reactive turing machinesProceedings of the 18th international conference on Fundamentals of computation theory10.5555/2034214.2034244(348-359)Online publication date: 22-Aug-2011
https://dl.acm.org/doi/10.5555/2034214.2034244
Lafrance S(2006)Using equivalence-checking to verify robustness to denial of serviceComputer Networks: The International Journal of Computer and Telecommunications Networking10.5555/1146183.164871450:9(1327-1348)Online publication date: 20-Jun-2006
https://dl.acm.org/doi/10.5555/1146183.1648714
Berry GRamesh SShyamasundar RVan Deusen MLang B(1993)Communicating reactive processesProceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/158511.158526(85-98)Online publication date: 1-Mar-1993
https://dl.acm.org/doi/10.1145/158511.158526
Berry GBoudol GAllen F(1989)The chemical abstract machineProceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/96709.96717(81-94)Online publication date: 1-Dec-1989
https://dl.acm.org/doi/10.1145/96709.96717

Abstract

Cited By

Index Terms

Recommendations

Algebraic foundations for qualitative calculi and networks

Representations of Algebraic Domains and Algebraic L-domains by Information Systems

Type checking and typability in domain-free lambda calculi

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations