Models and logics for true concurrency.
From MaRDI portal
Cites work
- A logical characterization of well branching event structures
- A logical study of distributed transition systems
- A Perspective in Theoretical Computer Science
- A Proof System for Communicating Sequential Processes
- Algebraic laws for nondeterminism and concurrency
- An axiomatic basis for computer programming
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Concurrent dynamic logic
- Concurrent histories: a basis for observing distributed systems
- Concurrent transition systems
- Decidability for branching time
- scientific article; zbMATH DE number 4018370 (Why is no real title available?)
- scientific article; zbMATH DE number 4208063 (Why is no real title available?)
- scientific article; zbMATH DE number 3821120 (Why is no real title available?)
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 4037225 (Why is no real title available?)
- scientific article; zbMATH DE number 4049019 (Why is no real title available?)
- scientific article; zbMATH DE number 4074504 (Why is no real title available?)
- scientific article; zbMATH DE number 4108727 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1028831 (Why is no real title available?)
- scientific article; zbMATH DE number 1032009 (Why is no real title available?)
- scientific article; zbMATH DE number 4119602 (Why is no real title available?)
- scientific article; zbMATH DE number 4119618 (Why is no real title available?)
- scientific article; zbMATH DE number 4119639 (Why is no real title available?)
- scientific article; zbMATH DE number 4119653 (Why is no real title available?)
- Modal logics for communicating systems
- Modeling concurrency with partial orders
- Notes on finite asynchronous automata
- Petri nets, event structures and domains. I
- Petri nets: central models and their properties. Advances in Petri nets 1986, Part I. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
- Process algebra for synchronous communication
- Recurring Dominoes: Making the Highly Undecidable Highly Understandable
- Some behavioural aspects of net theory
- TEMPORAL LOGICS FOR COMMUNICATING SEQUENTIAL AGENTS: I
Cited in
(3)
This page was built for publication: Models and logics for true concurrency.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955751)