Michael W. Shields

According to our database1, Michael W. Shields authored at least 29 papers between 1977 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2008
A theoretical framework for multiple neural network systems.
Neurocomputing, 2008

2007
A True-Concurrent Interpretation of Behavioural Scenarios.
Proceedings of the Formal Foundations of Embedded Software and Component-Based Software Architectures, 2007

2005
Modelling Component Behaviour with Concurrent Automata.
Proceedings of the Second International Workshop on Formal Foundations of Embedded Software and Component-based Software Architectures, 2005

2004
A Set-Theoretic Framework for Component Composition.
Fundam. Informaticae, 2004

2003
Component-Based Design: Towards Guided Composition.
Proceedings of the 3rd International Conference on Application of Concurrency to System Design (ACSD 2003), 2003

2002
Local Invariance.
Formal Aspects Comput., 2002

1999
An Acceptance Vector Semantics for Path Programs.
Fundam. Informaticae, 1999

Overtaking in Asynchronous Periodic Systems.
Formal Aspects Comput., 1999

1997
Cyclic Vector Languages.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

Semantics of parallelism - non-interleaving representation of behaviour.
Springer, ISBN: 978-3-540-76059-7, 1997

1996
Algebraic manipulations and vector languages.
Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

1992
Multitraces, Hypertraces and Partial Order Semantics.
Formal Aspects Comput., 1992

1989
Implicit System Specification and the Interface Equation.
Comput. J., 1989

1988
Behavioural Presentations.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

1985
Concurrent Machines.
Comput. J., 1985

1984
Non-Sequential Behaviour.
Proceedings of the International Symposium on Programming, 1984

Deterministic asynchronous automata.
Proceedings of the Automata on Infinite Words, 1984

1983
Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets.
Proceedings of the CAAP'83, 1983

The Train Set Problem.
Proceedings of the Analysis of Concurrent Systems, 1983

1981
Formal Behavioural Specification of Concurrent Systems Without Globality Assumptions.
Proceedings of the Formalization of Programming Concepts, 1981

Interpreted COSY Programs: Programming and Verification.
Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

1980
Verifying Concurrent System Specification in COSY.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979
COSY - A System Specification Language Based on Paths and Processes.
Acta Informatica, 1979

Adequate Path Expressions.
Proceedings of the Semantics of Concurrent Computation, 1979

A Formal Semantics for Concurrent Systems.
Proceedings of the Automata, 1979

Design & Analysis of Highly Parallel & Distributed Systems.
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School, January 22, 1979

1978
Abstract specification of resource accessing disciplines: adequacy, starvation, priority and interrupts.
ACM SIGPLAN Notices, 1978

On the abstract specification and formal analysis of synchronization properties of concurrent systems.
Proceedings of the Mathematical Studies of Information Processing, 1978

1977
On the Problem of Achieving Adequacy of Concurrent Programs.
Proceedings of the Formal Description of Programming Concepts: Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts, 1977


  Loading...