Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Global renaming operators in concrete process algebra
Information and Computation
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Process algebra
Transition system specifications with negative premises (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Advances in distributed computing (ADC) and colloquium on combining paradigms for software development (CCPSD): Vol. 2
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Selected papers of the 3rd workshop on Concurrency and compositionality
Structured operational semantics and bisimulation as a congruence
Information and Computation
Turning SOS rules into equations
Information and Computation
GSOS and finite labelled transition systems
Theoretical Computer Science
Journal of the ACM (JACM)
Structural operational semantics for weak bisimulations
Theoretical Computer Science
Location equivalence in a parametric setting
Theoretical Computer Science
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Timing and causality in process algebra
Acta Informatica
CPO models for compact GSOS languages
Information and Computation
A &pgr;-calculus with explicit substitutions
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Communication and Concurrency
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Compositionality Through an Operational Semantics of Contexts
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Observation Algebra of Spatial Pomsets
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
A Congruence Theorem for Structured Operational Semantics with Predicates
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours
CONCUR '94 Proceedings of the Concurrency Theory
The Weak Late pi-Calculus Semantics as Observation Equivalence
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Axiomatisations of Weak Equivalences for De Simone Languages
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Permutation of transitions: An event structure semantics for CCS and SCCS
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Expressive Results for Process Algebras
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Causality for Mobile Processes
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Full Abstraction in Structural Operational Semantics (Extended Abstract)
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Categories of asynchronous systems
Categories of asynchronous systems
Hi-index | 0.00 |
A generalization of De Simone format, where labels of transitions are structured actions, is presented. This provides a parameterized SOS framework where several paradigms of the observational semantics of process calculi can be uniformly handled. Moreover, standard algebraic techniques provide the formal machineries to relate the different semantics. It is also shown that much of the meta results developed for standard SOS format extend to this parameterized context.