Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Petri nets: an introduction
Communicating sequential processes
Communicating sequential processes
Modeling concurrency with partial orders
International Journal of Parallel Programming
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Axiomatising finite concurrent processes
SIAM Journal on Computing
Interleaving set temporal logic
Theoretical Computer Science
A logical characterization of well branching event structures
Selected papers of the Second Workshop on Concurrency and compositionality
Proving partial order properties
Theoretical Computer Science
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Communication and Concurrency
ACM Transactions on Computational Logic (TOCL)
LTL is expressively complete for Mazurkiewicz traces
Journal of Computer and System Sciences
Difficult Configurations - On the Complexity of LTrL
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Ten Years of Partial Order Reduction
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Some equivalence notions for concurrent systems. An overview
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
Model-Checking for a Subclass of Event Structures
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation - Special issue: LICS'97
Model-Checking of causality properties
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
In order to obtain a formalism for the specification of true concurrency in reactive systems, we modify the @m-calculus such that properties that are valid during the execution of an action can be expressed. The interpretation of this logic is based on transition systems that are used to model the ST-semantics. We show that this logic and step equivalence have an incomparable expressive power. Furthermore, we show that the logic characterizes the ST-bisimulation equivalence for finite process algebra expressions that do not contain synchronization mechanisms.