×

zbMATH — the first resource for mathematics

A complete inference system for a class of regular behaviours. (English) Zbl 0562.68065
The author defines a behaviour as a congruence class of charts (non- deterministic finite-state acceptors). He presents a complete inference system for finite behaviours.
Reviewer: W.Kwasowiec

MSC:
68Q55 Semantics in the theory of computing
68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] de Bakker, J.W.; Zucker, J.I., Denotational semantics of concurrency, (), 153-158 · Zbl 0508.68010
[2] Courcelle, B., Fundamental properties of infinite trees, Report no. 8105, uer de mathématique et informatique Bordeaux, (1981) · Zbl 0495.68019
[3] Elgot, C.C., Monadic computation and iterative algebraic theories, (), 175-230 · Zbl 0327.02040
[4] Hennessy, M.; Milner, R., On observing nondeterminism and concurrency, Lecture notes in computer science, Vol. 85, 299-309, (1973)
[5] Hoare, C.A.R.; Brookes, S.D.; Roscoe, A.W., A theory of communicating sequential processes, (1981), Programming Research Group Oxford University · Zbl 0628.68025
[6] Jensen, K., A method to compare the descriptive power of different types of Petri nets, () · Zbl 0454.68051
[7] Milner, R., A calculus of communicating systems, () · Zbl 0452.68027
[8] Park, D.M.R., Concurrency and automata on finite sequences, (1981), Computer Science Department, University of Warwick
[9] Salomaa, A., Two complete axiom systems for the algebra of regular events, J. assoc. comput. Mach., 13, 1, 158-169, (1966) · Zbl 0149.24902
[10] Salomaa, A., Jewels of formal language theory, (1981), Computer Science Press Potomac, Md · Zbl 0487.68063
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.