skip to main content
research-article

Behavioural logics for configuration structures

Published: 20 April 2022 Publication History

Abstract

We provide a behavioural logic for configuration structures, a model due to van Glabbeek and Plotkin which generalises the families of (finite) configurations of event structures. The logic is a conservative extension of a logic provided by Baldan and Crafa for prime event structures. We show that logical equivalence can be characterized as a form of hereditary history preserving bisimilarity. We compare such a notion of bisimilarity with an equivalence proposed by van Glabbeek in the setting of higher-dimensional automata, showing that, in general, it is finer, while the two notions coincide in the framework of general event structures. Finally, we explore how to restrict the general logic to capture a notion of history preserving bisimilarity.

References

[1]
C. Aubert, I. Cristescu, How reversibility can solve traditional questions: the example of hereditary history-preserving bisimulation, in: CONCUR, in: LIPIcs, vol. 171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, pp. 7:1–7:23.
[2]
P. Baldan, A. Corradini, H. Ehrig, M. Löwe, U. Montanari, F. Rossi, Concurrent semantics of algebraic graph transformation systems, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformation, Volume III: Concurrency, World Scientific, 1999, pp. 107–187.
[3]
P. Baldan, S. Crafa, A logic for true concurrency, in: P. Gastin, F. Laroussinie (Eds.), Proc. of CONCUR'10, in: LNCS, vol. 6269, Springer, 2010, pp. 147–161.
[4]
P. Baldan, S. Crafa, Hereditary history-preserving bisimilarity: logics and automata, in: J. Garrigue (Ed.), Proceedings of APLAS'14, in: LNCS, vol. 8858, Springer, 2014, pp. 469–488.
[5]
P. Baldan, S. Crafa, A logic for true concurrency, J. ACM 61 (4) (2014).
[6]
M.A. Bednarczyk, Hereditary history preserving bisimulations or what is the power of the future perfect in program logics, Technical report Polish Academy of Sciences, 1991.
[7]
E. Best, R. Devillers, A. Kiehn, L. Pomello, Fully concurrent bisimulation, Acta Inform. 28 (1991) 231–261.
[8]
R. Bruni, H.C. Melgratti, U. Montanari, Event structure semantics for nominal calculi, in: CONCUR 2006, in: LNCS, vol. 4137, Springer, 2006, pp. 295–309.
[9]
P. Degano, R. De Nicola, U. Montanari, Partial orderings descriptions and observations of nondeterministic concurrent processes, in: J.W. de Bakker, W.P. de Roever, G. Rozenberg (Eds.), REX Workshop, in: LNCS, vol. 354, Springer, Heidelberg, DE, 1988, pp. 438–466.
[10]
A. Joyal, M. Nielsen, G. Winskel, Bisimulation from open maps, Inf. Comput. 127 (2) (1996) 164–185.
[11]
M. Nielsen, G. Plotkin, G. Winskel, Petri nets, event structures and domains, part 1, Theor. Comput. Sci. 13 (1981) 85–108.
[12]
I. Phillips, I. Ulidowski, Event identifier logic, Math. Struct. Comput. Sci. 24 (2) (2014) 1–51.
[13]
V.R. Pratt, Modeling concurrency with geometry, in: POPL, ACM Press, 1991, pp. 311–322.
[14]
C. Prisacariu, The glory of the past and geometrical concurrency, in: Turing-100, in: EPiC Series in Computing, vol. 10, EasyChair, 2012, pp. 252–267.
[15]
A.M. Rabinovich, B.A. Trakhtenbrot, Behaviour structures and nets, Fundam. Inform. 11 (1988) 357–404.
[16]
R. van Glabbeek, U. Goltz, Refinement of actions and equivalence notions for concurrent systems, Acta Inform. 37 (4/5) (2001) 229–327.
[17]
van Glabbeek, R.J. (1991): Bisimulations for higher dimensional automata. Email message http://theory.stanford.edu/~rvg/hda.
[18]
R.J. van Glabbeek, On the expressiveness of higher dimensional automata, Theor. Comput. Sci. 356 (3) (2006) 265–290.
[19]
R.J. van Glabbeek, G.D. Plotkin, Configuration structures, in: D. Kozen (Ed.), Proceedings of 10th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, June 1995, pp. 199–209.
[20]
D. Varacca, N. Yoshida, Typed event structures and the linear pi-calculus, Theor. Comput. Sci. 411 (19) (2010) 1949–1973.
[21]
G. Winskel, Event structure semantics for CCS and related languages, in: M. Nielsen, E.M. Schmidt (Eds.), Proceedings of ICALP'92, in: LNCS, vol. 140, Springer Verlag, 1982, pp. 561–576.
[22]
G. Winskel, Event structures, in: W. Brauer, W. Reisig, G. Rozenberg (Eds.), Petri Nets: Applications and Relationships to Other Models of Concurrency, in: LNCS, vol. 255, Springer, 1987, pp. 325–392.
[23]
G. Winskel, Events, causality and symmetry, Comput. J. 54 (1) (2011) 42–57.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science
Theoretical Computer Science  Volume 913, Issue C
Apr 2022
174 pages

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 20 April 2022

Author Tags

  1. Configuration structures
  2. Modal logics
  3. Behavioural equivalences
  4. Event structures
  5. Semantics of true concurrency

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 30 Jan 2025

Other Metrics

Citations

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media