• Home
  • Search
  • Transition and cancellation in concurrency and branching time
  • Open Access IconOpen Access
  • Cite Icon44
  • https://doi.org/10.1017/s0960129503004031Copy DOI Icon

Transition and cancellation in concurrency and branching time

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We review the conceptual development of (true) concurrency and branching time starting from Petri nets and proceeding via Mazurkiewicz traces, pomsets, bisimulation, and event structures up to higher dimensional automata (HDAs), whose acyclic case may be identified with triadic event structures and triadic Chu spaces. Acyclic HDAs may be understood as extending the two truth values of Boolean logic with a third value .

Similar Papers
  • Research Article
  • Citations5

Event Structures for Local Traces

  • Jan 01, 1998
  • Electronic Notes in Theoretical Computer Science
  • H.C.M Kleijn +2
  • Research Article
  • Citations4

Connectedness and synchronization

  • Nov 01, 1991
  • Theoretical Computer Science
  • A Mazurkiewicz
  • Single Report
  • Citations143

Conditional Inference and Logic for Intelligent Systems: A Theory of Measure-Free Conditioning

  • Aug 01, 1991
  • I R Goodman +2
  • Research Article
  • Citations25

Bisimulation from Open Maps

  • May 03, 1994
  • BRICS Report Series
  • André Joyal +2
  • Conference Article
  • Citations5

Some recent applications of high-level Petri nets

  • Jan 01, 1991
  • T Murata
  • Research Article
  • Citations105

A map of dependencies among three-valued logics

  • Jun 25, 2013
  • Information Sciences
  • D Ciucci +1
  • Book Chapter
  • Citations1

Infinitary partial Petri net languages and their relationship to other Petri net semantics

  • Jan 01, 1988
  • Astrid Kiehn
  • Research Article
  • Citations42

Hyper-Contradictions, Generalized Truth Values and Logics of Truth and Falsehood

  • Nov 03, 2006
  • Journal of Logic, Language and Information
  • Yaroslav Shramko +1
  • Conference Article
  • Citations324

NULL Convention Logic/sup TM/: a complete and consistent logic for asynchronous digital circuit synthesis

  • Aug 19, 1996
  • K.M Fant +1
  • Book Chapter
  • Citations22

Regular Event Structures and Finite Petri Nets: A Conjecture

  • Jan 01, 2002
  • P.S Thiagarajan
  • Research Article
  • Citations4

A Study on Flexible Manufacturing Systems using Petri Net Reduction

  • Apr 01, 2021
  • IOP Conference Series: Materials Science and Engineering
  • V Padma
  • Research Article
  • Citations3

A hybrid model for intelligent control systems

  • Jul 01, 1994
  • Journal of Intelligent & Robotic Systems
  • Yafan An +2
  • Conference Article
  • Citations1

Upper Boundary Algebra for Modeling the Missing Values Is a Residuated Lattice

  • Jun 30, 2024
  • Nhung Cao +1
  • Book Chapter

Generalized Truth Values: From FOUR 2 to SIXTEEN 3

  • Jan 01, 2011
  • Yaroslav Shramko +1
  • Research Article

Process-commutative distributed objects: From cryptocurrencies to Byzantine-Fault-Tolerant CRDTs

  • Aug 20, 2024
  • Theoretical Computer Science
  • Davide Frey +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.